The Optimal Admission Fee Based Congestion Control Scheme in Space Information Networks

2015 ◽  
Vol 12 (6) ◽  
pp. 2295-2303 ◽  
Author(s):  
Chao Guo
2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Chao Guo ◽  
Cheng Gong ◽  
Haitao Xu ◽  
Zhiyong Yao

An optimal routing scheme in space information networks was presented to balance network loads for heterogeneous users. According to the competition among the nodes, the model was built based on queuing game theory. The virtual routing platform was in charge of resources allocation and route selection. It got user’s gain to decide which node the user joined in. Owning to the existing of heterogeneous users, an optimal admission fee needed to be obtained to avoid congestion. In our model, firstly, the whole welfare of the system was formulated. Then the optimal admission fee was calculated through maximizing the whole welfare. Meanwhile, the average maximum queue length was generated to set the buffer space of the node. At last, a routing factor was introduced into the route algorithm in order that the optimal routing could be selected by heterogeneous users. As a result, the system welfare reaches the maximum.


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

2019 ◽  
Vol 14 ◽  
Author(s):  
Tayyab Khan ◽  
Karan Singh ◽  
Kamlesh C. Purohit

Background: With the growing popularity of various group communication applications such as file transfer, multimedia events, distance learning, email distribution, multiparty video conferencing and teleconferencing, multicasting seems to be a useful tool for efficient multipoint data distribution. An efficient communication technique depends on the various parameters like processing speed, buffer storage, and amount of data flow between the nodes. If data exceeds beyond the capacity of a link or node, then it introduces congestion in the network. A series of multicast congestion control algorithms have been developed, but due to the heterogeneous network environment, these approaches do not respond nor reduce congestion quickly whenever network behavior changes. Objective: Multicasting is a robust and efficient one-to-many (1: M) group transmission (communication) technique to reduced communication cost, bandwidth consumption, processing time and delays with similar reliability (dependability) as of regular unicast. This patent presents a novel and comprehensive congestion control method known as integrated multicast congestion control approach (ICMA) to reduce packet loss. Methods: The proposed mechanism is based on leave-join and flow control mechanism along with proportional integrated and derivate (PID) controller to reduce packet loss, depending on the congestion status. In the proposed approach, Proportional integrated and derivate controller computes expected incoming rate at each router and feedback this rate to upstream routers of the multicast network to stabilize their local buffer occupancy. Results: Simulation results on NS-2 exhibit the immense performance of the proposed approach in terms of delay, throughput, bandwidth utilization, and packet loss than other existing methods. Conclusion: The proposed congestion control scheme provides better bandwidth utilization and throughput than other existing approaches. Moreover, we have discussed existing congestion control schemes with their research gaps. In the future, we are planning to explore the fairness and quality of service issue in multicast communication.


Sign in / Sign up

Export Citation Format

Share Document