Sciweavers

5079 search results - page 300 / 1016
» Hidden-Action in Network Routing
Sort
View
PERCOM
2007
ACM
16 years 7 months ago
Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
Apoorva Jindal, Konstantinos Psounis
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
16 years 19 days ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 7 months ago
On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks
In this paper, a reliability analysis is carried out to state a performance comparison between two recently proposed proactive routing algorithms. These protocols are able to scale...
Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paur...
SODA
2004
ACM
118views Algorithms» more  SODA 2004»
15 years 8 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 7 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda