Sciweavers

258 search results - page 29 / 52
» Non-cooperative routing in loss networks
Sort
View
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 1 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
INTERSENSE
2006
ACM
14 years 1 months ago
QoS-aware mesh construction to enhance multicast routing in mobile ad hoc networks
— Mobile Ad-hoc Networks (MANETs) are seen as an essential technology to support future Pervasive Computing Scenarios and 4G networks. In a MANET, efficient support of multipoint...
Harald Tebbe, Andreas J. Kassler, Pedro M. Ruiz
PERCOM
2006
ACM
14 years 7 months ago
QoS Routing in OLSR with Several Classes of Service
The Optimized Link State Routing (OLSR) protocol is a proactive link-state protocol bafor ad-hoc networks. It uses an optimization called Multi-Point Relays (MPRs) to provide an e...
Jeremie Leguay, Timur Friedman
COMSWARE
2007
IEEE
14 years 2 months ago
Impact of Network Dynamics on Tardiness of Data in Sensor Networks
- Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes. The age of data used by the end applicatio...
Tarun Banka, Anura P. Jayasumana
AINA
2004
IEEE
13 years 11 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng