Sciweavers

364 search results - page 26 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
DIGITALCITIES
2003
Springer
15 years 5 months ago
World Digital Cities: Beyond Heterogeneity
This paper reviews worldwide activities on regional information spaces. In the US and Canada, a large number of community networks appeared in the early 1990s. As a platform for co...
Toru Ishida, Alessandro Aurigi, Mika Yasuoka
ICC
2007
IEEE
130views Communications» more  ICC 2007»
15 years 6 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
P2PKM
2004
15 years 1 months ago
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...
Fred S. Annexstein, Kenneth A. Berman
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu