Sciweavers

1639 search results - page 124 / 328
» Degree-constrained network flows
Sort
View
115
Voted
CONEXT
2010
ACM
14 years 11 months ago
The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh
Recent measurements and anecdotal evidence indicate that the Internet ecosystem is rapidly evolving from a multi-tier hierarchy built mostly with transit (customer-provider) links...
Amogh Dhamdhere, Constantine Dovrolis
INFOCOM
2006
IEEE
15 years 7 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 6 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
INFOCOM
2003
IEEE
15 years 6 months ago
Flow Aggregation for Enhanced TCP over Wide Area Wireless
Abstract— Throughout the world, GSM cellular mobile networks are being upgraded to support the “always-on” General Packet Radio Service (GPRS). Despite the apparent availabil...
Rajiv Chakravorty, Sachin Katti, Ian Pratt, Jon Cr...
ICNP
2002
IEEE
15 years 6 months ago
A Simple and Scalable Fair Bandwidth Sharing Mechanism for Multicast Flows
Despite a decade of research and development, multicast has not yet been deployed on a global scale. Among the difficulties with the current infrastructure are intermulticast fai...
Fethi Filali, Walid Dabbous