Sciweavers

168 search results - page 27 / 34
» The price of selfish routing
Sort
View
CONEXT
2008
ACM
14 years 11 months ago
MINT: a Market for INternet Transit
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
Vytautas Valancius, Nick Feamster, Ramesh Johari, ...
IEEEIAS
2008
IEEE
15 years 4 months ago
A Friend Mechanism for Mobile Ad Hoc Networks
: In the autonomous environment of mobile ad hoc network (MANET) where nodes are free to move around and depend on each other to initiate communication, cooperation among nodes is ...
Shukor Abd Razak, Normalia Samian, Mohd Aizaini Ma...
74
Voted
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
TIFS
2008
149views more  TIFS 2008»
14 years 9 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu
ICCCN
2007
IEEE
15 years 3 months ago
Distributed Channel Allocation In Multi-Radio Wireless Mesh Networks
Abstract— One of the major advantages of wireless communication over wired is the flexibility when creating links between nodes. But this comes at a price as influences from ou...
Jeroen Avonts, Nik Van den Wijngaert, Chris Blondi...