Sciweavers

429 search results - page 45 / 86
» Biswapped Networks and Their Topological Properties
Sort
View
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
Random Linear Network Coding: A free cipher?
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
Luísa Lima, Muriel Médard, Joã...
JSAC
2006
157views more  JSAC 2006»
14 years 11 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
MOBICOM
2009
ACM
15 years 6 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
ICALP
2009
Springer
15 years 6 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran