92 search results - page 4 / 19 » Restricted Shortest Path Routing with Concave Costs |
INFOCOM
2003
IEEE
14 years 24 days ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
IPCCC
2006
IEEE
14 years 1 months ago
2006
IEEE
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
4OR
2010
13 years 5 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
CCR
1998
13 years 7 months ago
1998
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...