Sciweavers

235 search results - page 28 / 47
» Scalability of Routing Tables in Wireless Networks
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Linyphi: an IPv6-compatible implementation of SSR
Scalable Source Routing (SSR) is a self-organizing routing protocol designed for supporting peer-to-peer applications. It is especially suited for networks that do not have a well...
Pengfei Di, Massimiliano Marcon, Thomas Fuhrmann
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 1 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
INFOCOM
2005
IEEE
14 years 2 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
LCN
2008
IEEE
14 years 2 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
INFOCOM
2008
IEEE
14 years 2 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose