Dynamic congestion control in interconnected computer networks
Proceedings  13th Conference on Local Computer Networks
92 - 98
Item Usage Stats
The authors evaluate a window-based congestion control mechanism in an internetwork environment. They also propose and study two dynamic-window congestion-control algorithms. These algorithms provide further control to the window mechanism by adjusting the window size in accordance with the availability of the network resources at the destination. A comparison of dynamic algorithms with fixed window control is provided in terms of throughput and delay performance. It is shown that dynamic algorithms have considerable performance advantages over fixed-window control.
KeywordsComputer programming algorithms
Communication system traffic control
Published Version (Please cite this version)https://doi.org/10.1109/LCN.1988.10212
Showing items related by title, author, creator and subject.
Selçuk, Ali Aydin; Uzun, Ersin; Pariente, Mark Reşat (IEEE, 2004)The open and anonymous nature of a P2P network makes it an ideal medium for attackers to spread malicious content. In this paper, we describe a reputation-based trust management protocol for P2P networks where users rate ...
Sözer, H.; Tekkalmaz, M.; Korpeoglu, I. (Elsevier BV, 2009-01)Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ...
Akgün, İ.; Tansel, B. Ç.; Wood, R. K. (2011)This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K ≥ 3 pre-specified node groups while an interdictor ...