Sciweavers

39 search results - page 4 / 8
» Efficient Algorithms for Large-Scale Topology Discovery
Sort
View
ICUMT
2009
14 years 7 months ago
An efficient solution for max-min fair rate allocation in P2P simulation
Abstract--With the rapid development of peer-to-peer networks, simulation is considered as a useful tool to demonstrate initial ideas before building prototypes with real network t...
Anh Tuan Nguyen, Frank Eliassen
MATA
2000
Springer
137views Communications» more  MATA 2000»
15 years 1 months ago
Topology Discovery in Ad Hoc Wireless Networks Using Mobile Agents
Extensive research on mobile agents has been rife with the growing interests in network computing. In this paper, we have discussed a mobile multi-agent-based framework to address ...
Romit Roy Choudhury, Somprakash Bandyopadhyay, Kri...
ESANN
2000
14 years 11 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...
84
Voted
ICHIT
2009
Springer
15 years 4 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
ICNP
2005
IEEE
15 years 3 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu