1639 search results - page 159 / 328 » Degree-constrained network flows |
178
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
144
click to vote
ADHOCNETS
2009
Springer
15 years 2 months ago
2009
Springer
This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes coul...
150
click to vote
IMC
2010
ACM
15 years 2 months ago
2010
ACM
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
142
click to vote
HPDC
2010
IEEE
15 years 5 months ago
2010
IEEE
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
135
Voted
CCS
2008
ACM
15 years 6 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...