Sciweavers

552 search results - page 73 / 111
» Constrained Shortest Path Computation
Sort
View
IPPS
1997
IEEE
15 years 1 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
CONEXT
2007
ACM
15 years 1 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
14 years 9 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
ICNP
2007
IEEE
15 years 4 months ago
Geographically Informed Inter-Domain Routing
Abstract— We propose to add geographic location information into BGP routing updates to enable Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geo...
Ricardo V. Oliveira, Mohit Lad, Beichuan Zhang, Li...
BROADNETS
2006
IEEE
15 years 3 months ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac