1414 search results - page 55 / 283 » Performance Bounds in Communication Networks with Variable-R... |
DAIS
2011
12 years 11 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for Wireless Personal Area networks (WPANs) based on current IEEE 802.1...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
FGCN
2007
IEEE
14 years 2 months ago
2007
IEEE
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...