Sciweavers

410 search results - page 44 / 82
» Upgrading Shortest Paths in Networks
Sort
View
CORR
2011
Springer
536views Education» more  CORR 2011»
14 years 8 months ago
Performance Analysis of AODV under Black Hole Attack through Use of OPNET Simulator
— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...
H. A. Esmaili, M. R. Khalili Shoja, Hossein Gharae...
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 2 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
IWDC
2001
Springer
114views Communications» more  IWDC 2001»
15 years 6 months ago
A Protection-Based Approach to QoS in Packet over Fiber Networks
We propose a novel approach to Quality of Service, intended for IP over SONET (or IP over WDM) networks, that offers end-users the choice between two service classes defined acco...
Patrick Thiran, Nina Taft, Christophe Diot, Hui Za...
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 1 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
15 years 7 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy