scholarly journals Combining Source-adaptive and Oblivious Routing with Congestion Control in High-performance Interconnects using Hybrid and Direct Topologies

2019 ◽  
Vol 16 (2) ◽  
pp. 1-26
Author(s):  
Pedro Yebenes ◽  
Jose Rocher-Gonzalez ◽  
Jesus Escudero-Sahuquillo ◽  
Pedro Javier Garcia ◽  
Francisco J. Alfaro ◽  
...  
Author(s):  
Mitsutaka Kimura ◽  
Mitsuhiro Imaizumi ◽  
Takahito Araki

Code error correction methods have been important techniques at a radio environment and video stream transmission. In general, when a server transmits some data packets to a client, the server resends the only loss packets. But in this method, a delay occurs in a transmission. In order to prevent the transmission delay, the loss packets are restored by the error correction packet on a client side. The code error correction method is called Hybrid Automatic Repeat reQuest (ARQ) and has been researched. On the other hand, congestion control schemes have been important techniques at a data communication. Some packet losses are generated by network congestion. In order to prevent some packet losses, the congestion control performs by prolonging packet transmission intervals, which is called High-performance and Flexible Protocol (HpFP). In this paper, we present a stochastic model of congestion control based on packet transmission interval with Hybrid ARQ for data transmission. That is, if the packet loss occurs, the data packet received in error is restored by the error correction packet. Moreover, if errors occur in data packets, the congestion control performs by prolonging packet transmission intervals. The mean time until packet transmissions succeed is derived analytically, and a window size which maximizes the quantity of packets per unit of time until the transmission succeeds is discussed.


Author(s):  
Mitsutaka Kimura ◽  
Mitsuhiro Imaizumi ◽  
Toshio Nakagawa

This paper discusses the reliability model of a window flow control scheme using High-performance and Flexible Protocol (HpFP) with Explicit Congestion Notification (ECN) considering packet loss. HpFP is an important techniques as congestion control scheme in a radio environment and video stream communication. HpFP has the character that throughput is adjusted by changing a packet transmission interval. We have already discussed some reliability models of a window flow control scheme based on a packet transmission interval. In these models, if some packets has failed at a first-time transmission, the packet transmission interval is prolonged. On the other hand, the server checks the state of network congestion by ECN bit. That is, if ECN bit has been set during connection, a packet transmission interval is also prolonged. We consider an extended stochastic model of a window flow control scheme based on a packet transmission interval with ECN considering packet loss. That is, the server checks ECN bit during connection and if the server detects the network congestion, the server executes congestion control that a packet transmission interval is prolonged. Thereafter, if a constant number of the retransmission has failed, or a constant number of packets has failed, the server checks it again. We derive the mean time until packet transmissions succeed, and discuss analytically a window size which maximizes the amount of packets per unit of mean transmission time.


2005 ◽  
Vol 13 (1) ◽  
pp. 43-56 ◽  
Author(s):  
F. Paganini ◽  
Zhikui Wang ◽  
J.C. Doyle ◽  
S.H. Low

Sign in / Sign up

Export Citation Format

Share Document