LEADER 02802oam  2200445zu 450 
001 9910872892703321
005 20241212215056.0
035   $a(CKB)111055184224136
035   $a(SSID)ssj0000452238
035   $a(PQKBManifestationID)12182357
035   $a(PQKBTitleCode)TC0000452238
035   $a(PQKBWorkID)10468373
035   $a(PQKB)11413654
035   $a(NjHacI)99111055184224136
035   $a(EXLCZ)99111055184224136
100   $a20160829d2001      uy 
101 0 $aeng
135   $aur|||||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aCluster Computing: Proceedings of the IEEE International Conference on Cluster Computing (3rd: 2001: Newport Beach, CA)
210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2001
215   $a1 online resource
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a9780769511160 
311 08$a0769511163 
327   $a2001 IEEE International Conference On Cluster Computing [front matter] -- Early experiences with the myricom 2000 switch on an SMP Beowulf-class cluster for unstructured adaptive meshing -- Using multirail networks in high-performance clusters -- Next generation parallel virtual file system -- Experiences with Oasis+: a fault tolerant storage system -- Clusterfile: a flexible physical layout parallel file system -- High performance computing with microsoft windows 2000 -- Gulfstream - a system for dynamic topology management in multi-domain server farms -- Cluster rolling upgrade using multiple version support -- Dense computing with Transmeta's Crusoe.
330   $aMultiProtocol Label Switching (MPLS) is a routing model proposed by the IETF for the Internet, and is becoming widely popular. In this paper, we initiate a theoretical study of the routing model, and give routing algorithms and lower bounds in a variety of situations. We first study the routing problems on the line. We then build up our results from paths through trees to more general graphs. The basic technique to go to general graphs is that of finding a tree cover, which is a small set of subtrees of the graph such that for each pair of vertices, one of the trees contains a shortest (or near-shortest) path between them. The concept of tree covers appears to have many interesting applications.
606   $aComputer science$vCongresses
606   $aComputer science$vHandbooks, manuals, etc
615  0$aComputer science
615  0$aComputer science
676   $a004
700   $aKatz$b Daniel S$0125241
801  0$bPQKB
906   $aPROCEEDING
912   $a9910872892703321
996   $aCluster Computing: Proceedings of the IEEE International Conference on Cluster Computing (3rd: 2001: Newport Beach, CA)$92374645
997   $aUNINA