Sciweavers

92 search results - page 18 / 19
» Restricted Shortest Path Routing with Concave Costs
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Noncooperative Load Balancing in the Continuum Limit of a Dense Network
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
Eitan Altman, Ishai Menache, Asuman E. Ozdaglar
WSC
2004
13 years 9 months ago
Simulating Airspace Redesign for Arrivals to Detroit-Wayne County Airport (DTW)
In 2001, Detroit Metropolitan Wayne County Airport (DTW) opened a new runway parallel to three existing runways. While this increases DTW's runway capacity, the airport is se...
Justin Boesel, David Bodoh
GLOBECOM
2007
IEEE
13 years 11 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
INFOCOM
2008
IEEE
14 years 1 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 26 days ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...