29 search results - page 6 / 6 » On the maximal throughput of networks with finite buffers an... |
INFOCOM
2007
IEEE
13 years 12 months ago
2007
IEEE
— To discover an efficient fair sending rate for a flow, Transmission Control Protocol (TCP) saturates the bottleneck link and its buffer until the router discards a packet. Su...
JSAC
2007
13 years 5 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
CATA
2003
13 years 7 months ago
2003
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...