Sciweavers

2343 search results - page 349 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2006
IEEE
15 years 11 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
BROADNETS
2005
IEEE
15 years 10 months ago
Network design for IP-centric light trail networks
Abstract— We explore network design principles for nextgeneration all-optical wide-area networks, employing light-trail technology. Light-trail [1] is a light-wave circuit that a...
Srivatsan Balasubramanian, Ahmed E. Kamal, Arun K....
ICDCS
2005
IEEE
15 years 10 months ago
Non-Cooperation in Competitive P2P Networks
Large-scale competitive P2P networks are threatened by the noncooperation problem,1 where peers do not forward queries to potential competitors. Non-cooperation will be a growing ...
Beverly Yang, Tyson Condie, Sepandar D. Kamvar, He...
INFOCOM
2005
IEEE
15 years 10 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
IPPS
2005
IEEE
15 years 10 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi