Token-based congestion control: Achieving fair resource allocations in P2P networks

2008 ◽  
Author(s):  
Zhiqiang Shi
Keyword(s):  
Congestion Control ◽  
P2p Networks ◽  
Resource Allocations

A Congestion Control Protocol in P2P Networks

2010 ◽  
Vol 29-32 ◽  
pp. 1241-1245
Author(s):  
Yong Xiang Zhao ◽  
Chang Jia Chen
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Transport Protocol ◽  
P2p Networks ◽  
Control Protocol ◽  
Congestion Control Mechanism

Many of current P2P application tend to use UDP as their transport protocol. Since UDP does not provide congestion control mechanism, the developers of these applications have to decide how frequently to send UDP packet individually. It is necessary to provide a common congestion control protocol specially design for P2P networks. This paper proposes a protocol for such propose and use simulation to valid it

scholarly journals CONGESTION CONTROL ALGORITHM FOR MESSAGE ROUTING IN STRUCTURED PEER-TO-PEER NETWORKS

2018 ◽  
Vol 34 (2) ◽  
pp. 145-159
Author(s):  
Nguyễn Đình Nghĩa ◽  
Nguyễn Hoài Sơn
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Control Process ◽  
Peer To Peer ◽  
P2p Networks ◽  
Message Routing ◽  
Retrieval Systems ◽  
Peer To Peer Networks ◽  
Congestion Control Algorithm ◽  
Information Retrieval Systems

Many complex applications have been built on the basis of structured peer-to-peer (P2P) networks such as information retrieval systems, file sharing systems, and so on. These applications often have to process a large number of queries quickly and efficiently. When the number of queries to a node exceeds its capacity, a local bottleneck occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through the congested node. The performance of proposed method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process

An Efficient Congestion Control Scheme for Data Using Tokens in Network

2012 ◽  
Vol 2 (11) ◽  
pp. 104-106
Author(s):  
C.Md.Jamsheed C.Md.Jamsheed ◽  
◽  
D.Surendra D.Surendra ◽  
D.Venkatesh D.Venkatesh
Keyword(s):  
Congestion Control ◽  
Control Scheme

Routing Optimization with Efficient Second Order Distributed Approach Using Congestion Control Rules

2017 ◽  
Vol 7 (7) ◽  
pp. 363
Author(s):  
Jaya Pratha Sebastiyar ◽  
Martin Sahayaraj Joseph
Keyword(s):  
Congestion Control ◽  
Second Order ◽  
Back Pressure ◽  
Order Method ◽  
Delay Performance ◽  
Routing Optimization ◽  
Distributed Approach ◽  
Control Rules ◽  
Primal Dual ◽  
Queue Stability

Distributed joint congestion control and routing optimization has received a significant amount of attention recently. To date, however, most of the existing schemes follow a key idea called the back-pressure algorithm. Despite having many salient features, the first-order sub gradient nature of the back-pressure based schemes results in slow convergence and poor delay performance. To overcome these limitations, the present study was made as first attempt at developing a second-order joint congestion control and routing optimization framework that offers utility-optimality, queue-stability, fast convergence, and low delay.  Contributions in this project are three-fold. The present study propose a new second-order joint congestion control and routing framework based on a primal-dual interior-point approach and established utility-optimality and queue-stability of the proposed second-order method. The results of present study showed that how to implement the proposed second-order method in a distributed fashion.

Sign in / Sign up

Export Citation Format

Share Document