Sciweavers

5922 search results - page 811 / 1185
» Navigability of Complex Networks
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICC
2008
IEEE
126views Communications» more  ICC 2008»
16 years 2 months ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
NDSS
2008
IEEE
16 years 2 months ago
Halo: High-Assurance Locate for Distributed Hash Tables
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
Apu Kapadia, Nikos Triandopoulos
TRIDENTCOM
2008
IEEE
16 years 2 months ago
Virtual integrated TCP testbed (VITT)
Research on TCP performance relies either on simulation programs, which run on a single machine, or on the use of real testbeds, where different machines represent different netwo...
Carlo Caini, Rosario Firrincieli, Renzo Davoli, Da...
ISCA
2007
IEEE
111views Hardware» more  ISCA 2007»
16 years 1 months ago
Express virtual channels: towards the ideal interconnection fabric
Due to wire delay scalability and bandwidth limitations inherent in shared buses and dedicated links, packet-switched on-chip interconnection networks are fast emerging as the per...
Amit Kumar 0002, Li-Shiuan Peh, Partha Kundu, Nira...