Sciweavers

135 search results - page 3 / 27
» Hierarchical source routing using implied costs
Sort
View
MMB
2004
Springer
14 years 29 days ago
SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis
Ever-increasing attention has been drawn to source specific multicast in the Internet society. In this paper, a novel multicast scheme, called Scalable Recursive Explicit Multicast...
Yewen Cao, Khalid Al-Begain
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
ADHOC
2006
167views more  ADHOC 2006»
13 years 7 months ago
Bypass routing: An on-demand local recovery protocol for ad hoc networks
Abstract--On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically perfo...
Cigdem Sengul, Robin Kravets
ICEBE
2005
IEEE
96views Business» more  ICEBE 2005»
14 years 1 months ago
Adding Physical Optimization to Cost Models in Information Mediators
Optimization of execution plans in information mediators is a critical task, specially when sources are remote and semistructured, as in the case of transactional web sites. Lack ...
Justo Hidalgo, Alberto Pan, José Losada, Ma...
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