Sciweavers

745 search results - page 115 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
PAM
2010
Springer
15 years 7 months ago
Toward Topology Dualism: Improving the Accuracy of AS Annotations for Routers
Abstract. To describe, analyze, and model the topological and structural characteristics of the Internet, researchers use Internet maps constructed at the router or autonomous syst...
Bradley Huffaker, Amogh Dhamdhere, Marina Fomenkov...
130
Voted
TON
2002
144views more  TON 2002»
15 years 5 days ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
113
Voted
COMSWARE
2006
IEEE
15 years 6 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
102
Voted
TCS
2010
14 years 11 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
GLOBECOM
2006
IEEE
15 years 6 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang