Sciweavers

99 search results - page 11 / 20
» Routing Indices For Peer-to-Peer Systems
Sort
View
DEBS
2007
ACM
14 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
88
Voted
IWDC
2001
Springer
115views Communications» more  IWDC 2001»
15 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
SIGCOMM
2004
ACM
15 years 3 months ago
Mercury: supporting scalable multi-attribute range queries
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that...
Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Ses...
LCN
2008
IEEE
15 years 4 months ago
Experimental comparison of peer-to-peer streaming overlays: An application perspective
—Peer-to-peer streaming systems are becoming highly popular for IP Television (IPTV). Most systems can be categorized as either tree-based or mesh-based, and as either pushbased ...
Jeff Seibert, David Zage, Sonia Fahmy, Cristina Ni...
ASPLOS
2006
ACM
15 years 3 months ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...