1639 search results - page 105 / 328 » Degree-constrained network flows |
118
click to vote
IMC
2004
ACM
15 years 9 months ago
2004
ACM
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
217
click to vote
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
125
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
113
Voted
TELSYS
2002
15 years 3 months ago
2002
Abstract. In this paper, we present a receiver-oriented, request/response protocol for the Web that is compatible with the dynamics of TCP's congestion control algorithm. The ...
138
click to vote
MSWIM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we introduce an effective congestion control scheme for TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the wired Int...