Sciweavers

364 search results - page 44 / 73
» Shortest-path network interdiction
Sort
View
WOWMOM
2009
ACM
128views Multimedia» more  WOWMOM 2009»
14 years 2 months ago
A queuing modeling approach for Load-Aware Route Selection in heterogeneous mesh networks
Wireless mesh networks are primarily used to provide Internet access by sharing the Internet connections of a limited number of gateways. If traffic is routed in the mesh without...
Raffaele Bruno, Marco Conti, Antonio Pinizzotto
LCN
2007
IEEE
14 years 1 months ago
Lightpath Reconfiguration in Regional IP-over-WDM Networks by a Centralized Control System
—Lightpath reconfiguration performance has been evaluated experimentally for regional IP-over-WDM network applications, making the network scalable and stable when traffic change...
Yutaka Katsuyama, Michio Hashimoto, Keiji Nishikaw...
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
14 years 1 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
ALGOSENSORS
2008
Springer
13 years 9 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 6 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna