Sciweavers

410 search results - page 20 / 82
» Upgrading Shortest Paths in Networks
Sort
View
CNSR
2005
IEEE
15 years 7 months ago
Shortest-Hop Based Reliable Network Multicast
Although many multicast communication protocols have been recommended at IETF, reliable multicast communications currently rely on programs built at the application layer, e.g., m...
Ka Lun Eddie Law, Daniel Siu
HICSS
1999
IEEE
115views Biometrics» more  HICSS 1999»
15 years 5 months ago
GIS-based Dynamic Traffic Congestion Modeling to Support Time-Critical Logistics
Time-critical logistics (TCL) refer to time-sensitive procurement, processing and distribution activities. A confounding factor is the transportation networks that contain these l...
Harvey J. Miller, Yi-Hwa Wu, Ming-Chih Hung
ITCC
2003
IEEE
15 years 6 months ago
Alternate Path Routing Algorithm for Traffic Engineering in the Internet
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
Shyam Subramanian, Muthukumar Venkatesan
LCN
2008
IEEE
15 years 7 months ago
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
Fen Zhou, Miklós Molnár, Bernard Cou...
IPPS
2007
IEEE
15 years 7 months ago
A Combinatorial Analysis of Distance Reliability in Star Network
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
Xiaolong Wu, Shahram Latifi, Yingtao Jiang