Sciweavers

2343 search results - page 71 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
ICNP
2002
IEEE
14 years 20 days ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
COMCOM
2006
110views more  COMCOM 2006»
13 years 7 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
TON
1998
145views more  TON 1998»
13 years 7 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
TELSYS
2002
73views more  TELSYS 2002»
13 years 7 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner