Path layout on tree networks : bounds in different label switching models
Anat Bremler-Barr Artikkel Engelsk
*0011462177 *008081022s2007 xx# 000 0 eng *019 $bk *08230$a004.66 *100 $aBremler-Barr, Anat$uThe Interdisciplinary Center, School of Computer Science, Herzliya, Israel : bremler@idc.ac.il$_162218900 *245 $aPath layout on tree networks$bbounds in different label switching models *300 $aS. [109]-125 *500 $aVitenskapelig artikkel *5208 $aInneholder sammendrag *650 $aasynkron overføring$9nor$2norart$_162219000 *650 $adatanett$2norart$_15461000 *650 $adataoverføringer$9nor$2norart$_131650700 *650 $ainternettprotokoller$9nor$2norart$_133633200 *653 $aasynchronous transfer mode (ATM)$9eng$_162219100 *653 $alabel switch paths$9eng$_162219200 *653 $amulti protocol label switching (MPLS)$9eng$_162219300 *653 $atree networks$9eng$_162219400 *700 $aEpstein, Leah$uUniversity of Haifa, Department of Mathematics, Haifa, Israel : lea@math.haifa.ac.il$_162219500 *773 $tNordic journal of computing$gVol. 14, nr. 1/2 (2007)$x1236-6064$w(NO-LaBS)69800(tnr) *999 $z800437903$anorart:800437903 ^