Sciweavers

107 search results - page 4 / 22
» On Balancing Delay and Cost for Routing Paths
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 7 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
74
Voted
SIGCOMM
1999
ACM
15 years 1 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
102
Voted
TELSYS
2002
128views more  TELSYS 2002»
14 years 9 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
65
Voted
ICC
2007
IEEE
15 years 3 months ago
Load Balancing in Mobile IPv6's Correspondent Networks with Mobility Agents
—A foreseeable scenario is where on the Internet Mobile IPv6 is deployed and a large percentage of the clients are mobile nodes. These mobile clients will communicate with large ...
Albert Cabellos-Aparicio, Jordi Domingo-Pascual
82
Voted
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
15 years 2 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier