Sciweavers

1204 search results - page 141 / 241
» Optimal Routing in a Small-World Network
Sort
View
IWDC
2001
Springer
115views Communications» more  IWDC 2001»
15 years 10 months ago
Pricing-Based Control of Large Networks
— In this paper we show that significant simplicity can be exploited for pricing-based control of large networks. We first consider a general loss network with Poisson arrivals...
Xiaojun Lin, Ness B. Shroff
209
Voted
SPAA
1996
ACM
15 years 10 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SECON
2008
IEEE
16 years 15 days ago
DiffQ: Differential Backlog Congestion Control for Wireless Multi-hop Networks
Congestion control in wireless multi-hop networks is challenging because of two reasons. First, broadcast is an inherent feature of wireless networks and motivates many creative p...
Ajit Warrier, Sangtae Ha, P. Wason, Injong Rhee, J...
INFOCOM
2005
IEEE
15 years 11 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez