Sciweavers

581 search results - page 25 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
15 years 7 months ago
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
Xiaoqing Zhu, Bernd Girod
BROADNETS
2006
IEEE
15 years 5 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
SIGCOMM
2000
ACM
15 years 5 months ago
FIRE: Flexible intra-AS routing environment
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
Craig Partridge, Alex C. Snoeren, W. Timothy Stray...
EUROPAR
2004
Springer
15 years 6 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
SIGCOMM
1999
ACM
15 years 5 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves