Sciweavers

177 search results - page 25 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
IPPS
2007
IEEE
14 years 4 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
MOBICOM
2003
ACM
14 years 3 months ago
Manycast: exploring the space between anycast and multicast in ad hoc networks
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
Casey Carter, Seung Yi, Prashant Ratanchandani, Ro...
IWDC
2001
Springer
115views Communications» more  IWDC 2001»
14 years 2 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
ICC
2009
IEEE
116views Communications» more  ICC 2009»
13 years 7 months ago
Network Coding Does Not Change the Multicast throughput Order of Wireless Ad Hoc Networks
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpou...
IPPS
2005
IEEE
14 years 3 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou