Multicast Congestion Control Protocol Research Articles

Qos Parameters of an Energy Efficient Multicast Congestion Control Protocol (Eemccp) Over Fading Channels

In this paper we propose an energy efficient multicasting congestion control protocol for mobile ad hoc networks (MANETs) over fading channels. Our proposed scheme overcomes the disadvantages of existing multicast congestion control protocols which depend on individual receivers to detect congestion and adjust their receiving rates over fading channels. In the first phase we observe the performance of data transmission over wireless channels is well captured by their bit error rate which is a function of the signal to noise ratio at the receiver. These models are a function of the distance between the sender and the receiver, the path loss exponent, and the channel gain. The channel gain which is a time-variation parameter is modeled by probability distribution functions. So we mainly described the three most important and commonly used distribution functions for this probability distribution, i.e., AWGN, Rayleigh, and Racian models. In the second phase we proposed a protocol on these noise channels, the protocol requires to build a multicast tree routed at the source, by including the nodes with higher residual energy towards the receivers. In the third phase, we propose an admission control scheme in which a multicast flow is admitted or rejected depending upon on the output queue size. In the fourth phase, we propose a scheme which adjusts the multicast traffic rate at each bottleneck of a multicast tree. Because of the on-the-spot information collection and rate control, this scheme has very limited control traffic overhead and delay. Moreover, the proposed scheme does not impose any significant changes on the queuing, scheduling or forwarding policies of existing networks. Simulation results shows that our proposed protocol has better delivery ratio and throughput with less delay and energy consumption when compared with existing protocols.

An Energy Efficient and Cooperative Congestion Control Protocol in MANET

ABSTRAC This paper presents an energy efficient and cooperative congestion control protocol to control the congestion in mobile adhoc networks (MANETs). The proposed scheme overcomes the disadvantages of existing multicast congestion control protocols which depend on individual receivers to detect congestion and adjust their receiving rates. In the first phase of the proposed protocol, it builds a cooperative multicast tree rooted at the source, by including the nodes with higher residual energy towards the receivers. In the second phase of the proposed protocol, it proposes an admission control scheme in which a cooperative multicast flow is admitted or rejected depending upon on the output queue size. In the third phase of the proposed protocol, it proposes a scheme which tests whether the relay node has the potential path to the required destination, if not then choose the another node which has the second most highest residual energy as a new relay node. That is more generally introduction of cooperativeness and making it. In the fourth phase, we propose a scheme which adjusts the multicast traffic rate at each bottleneck of a multicast tree. Because of the on-the-spot information collection and rate control, this scheme has very limited control traffic overhead and delay. Moreover, the proposed scheme does not impose any significant changes on the queuing, scheduling or forwarding policies of existing networks. Simulation results shows that the proposed protocol has better delivery ratio and throughput with less delay and energy consumption when compared with existing protocol.

Robust and fair Multicast Congestion Control (M2C)

Since 1995 and the Receiver-driven Layered Multicast (RLM) protocol, numerous multicast congestion control protocols have been proposed, such as RLC, FLID-SL, FLID-DL and finally the WEBRC protocol. However these protocols suffer from some limitations and have not been extensively experimented on a wide range of network conditions. This article presents the Multicast Congestion Control (M2C) protocol, which is based on a dynamic layer mechanism and a congestion window mechanism for each receiver. M2C is designed to be TCP-friendly and to fairly share the bandwidth when competing with unicast and multicast streams.To reduce simulation approximations and to carry out extensive evaluations over the Internet we implemented M2C and several other multicast congestion control protocols. The experiments reveal interesting network behaviors, such as the join time latency problem, that simulations and local testbeds had not revealed before. We evaluated the impact of this latency on the state of the art protocols. Focusing on WEBRC and M2C, we have then defined and run a validation benchmark to qualify their behavior in terms of fairness and convergence time. These experiments show M2C robustness and good behavior for the mentioned metrics and its improvements compared to WEBRC. Furthermore, we have analyzed the signaling overhead of these protocols.Thus, M2C is an efficient multicast congestion control with an open source implementation which is easily usable by multicast applications, such as file transfer or video streaming.

An Energy Efficient and Cooperative Congestion Control Protocol in MANET

MANET is collection of mobile devices form a self-creating, self-organizing and self-administering wireless networks. Due to mobility of nodes it is not possible to establish fixed paths for message delivery through the network. Hence, congestion is happening and it is the key problem for MANET. Many routing protocols have been proposed to overcome the congestion in MANET. One of the popular routing protocol is AODV, but it depends on individual receivers to detect congestion and adjust their receiving rates. Another common routing protocol is EERCCP, which is better than AODV but sometimes it fails when link failure happens to relay node or if relay node moves from its current group to another group then there is no other mechanism to select an alternative relay nodes i.e. lack of cooperativeness. Consequently, we proposed a routing protocol named as EECCCP, which utilizes user cooperation to reduce congestion. The proposed energy efficient and cooperative congestion control routing protocol (EECCCP), performs well better than both the AODV and EERCCP. The proposed scheme encorporates the benefits of energy efficiency and cooperativeness which in turn reduces the congestion effectively. It also overcomes the disadvantages of existing multicast congestion control protocol. Moreover, the proposed scheme does not impose any significant changes on the queuing, scheduling or forwarding policies of existing network protocols. The simulation results have shown that our proposed protocol EECCCP has the about 95% better delivery ratio and throughput with about 85 % less delay and energy consumption when compared with the existing protocol AODV. It also has the about 65% better delivery ratio and throughput with about 60 % less delay and energy consumption when compared with the existing protocol EERCCP.

Equation-based end-to-end single-rate multicast congestion control

Among the recently proposed single-rate multicast congestion control protocols is transmission control protocol-friendly multicast congestion control (TFMCC; Widmer and Handley 2001; Floyd et al. 2000; Widmer et al. IEEE Netw 15:28–37, 2001), which is an equation-based single-rate protocol that extends the mechanisms of the unicast TCP-friendly rate control (TFRC) protocol into the multicast domain. In TFMCC, each receiver estimates its throughput using an equation that estimates the steady-state throughput of a TCP source. The source then adjusts its sending rate according to the slowest receiver within the session (a.k.a., current-limiting receiver, CLR). TFMCC is a relatively simple, scalable, and TCP-friendly multicast congestion control protocol. However, TFMCC is hindering its throughput performance by adopting an equation derived from the unicast TFRC protocol. Further, TFMCC is slow to react to congestion conditions that usually result in a change of the CLR. This paper is motivated by these two observations and proposes an improved version of TFMCC, which we refer to as hybrid-TFMCC (or H-TFMCC for short). First, each receiver estimates its throughput using an equation that models the steady-state throughput of a multicast source controlled according to the additive increase multiplicative decrease (AIMD) approach. The second modification consists of adopting a hybrid sender/receiver-based rate control strategy, where the sending rate can be adjusted by the source or initiated by the current or a new CLR. The source monitors RTT variations on the CLR path, in order to rapidly adjust the sending rate to network conditions. Simulation results show that these modifications result in remarkable performance improvement with respect to throughput, time to react, and magnitude of oscillations. We also show that H-TFMCC remains TCP-friendly and achieves a higher fairness index than that achieved by TFMCC.

DAMCC: Improved multi-rate multicast congestion control protocol

A new Dynamic Allocation bandwidth strategy for Multicast Congestion Control(DAMCC) was put forward.Concerning the current problems of adjusting the rate of granularity roughly and inadequate application about the Receiver-driven Layered Congestion control(RLC),this strategy designed an algorithm,which can calculate the rate of the enhancement layer dynamically and separately.The receiver of the strategy of DAMCC can calculate the value of the Round-Trip Time(RTT) according to the feedback response information,then calculate its own TCP friendly rate and receive the multicast data at the corresponding rate to achieve sharing the network resources with TCP flow fairly.The simulation results show DAMCC strategy can use network bandwidth more effectively than the RLC strategy,and it also solves the problem of network bandwidth heterogeneity.Besides,it can calculate the TCP friendly rate at the receiver to achieve sharing the network resources with the TCP flow fairly.

Pragmatic general multicast congestion control protocol for wireless networks

AbstractAccompanied by the widespread deployment of wireless networks, content and service providers are increasingly interested in supporting multicast communications over wireless network. The reliable multicast protocol can provide (assure) efficiency in data delivery carried by the new generation e‐services, such as news, advertisement, guiding messages, etc. Its congestion control function enables the transmissions to adapt the sending rate to the available bandwidth and fairly share bandwidth with the widely used transmission control protocol (TCP) traffic in the networks. Many e‐services can be brought and built on the reliable multicast congestion control protocols to the roaming mobile subscribers. However, the reliable multicast congestion control protocols are affected by the wireless packet losses, resulting in degraded multicast performance. This article presents PGMCCW, a pragmatic general multicast congestion control protocol for wireless networks. PGMCCW can differentiate the wireless losses as well as the congestion losses on multicast and can also elect the proper group representative from the multiple receivers in the different wireless sub‐networks. The simulation results validate that this scheme is effective to alleviate the influence of the wireless losses and improve the performance over wireless networks. Copyright © 2005 John Wiley & Sons, Ltd.

A Framework for Systematic Evaluation of Multicast Congestion Control Protocols

Congestion control is a major requirement for multicast to be deployed in the current Internet. Due to the complexity and conflicting tradeoffs, the design and testing of multicast congestion control protocols is difficult. In this paper, we present a novel framework for systematic testing of multicast congestion control protocols. In our framework, we first design an appropriate model for the studied protocols based on the protocols specifications and correctness conditions, and then we develop an automated search engine to generate all possible error scenarios and filter these errors to come up with a selected set of scenarios that we evaluate in more detailed simulations. Our methodology helps in identifying the potential problems of the studied protocols and points to possible improvements. We hope that this will provide a valuable tool to expedite the development and standardization of such protocols.

Tracetree: A Scalable Mechanism to Discover Multicast Tree Topologies in the Internet

The successful deployment of multicast in the Internet requires the availability of good network management solutions. Discovering multicast tree topologies is an important component of this task. Network managers can use topology information to monitor and debug potential multicast forwarding problems. In addition, the collected topology has several other uses, for example, in reliable multicast transport protocols, in multicast congestion control protocols, and in discovering network characteristics. We present a mechanism for discovering multicast tree topologies using the forwarding state in the network. We call our approach tracetree. First, we present the basic operation of tracetree. Then, we explore various issues related to its functionality (e.g., scalability, security, etc.). Next, we provide a detailed evaluation by comparing it to the currently available alternatives. Finally, we discuss a number of deployment issues. We believe that tracetree provides an efficient and scalable mechanism for discovering multicast tree topologies and therefore fills an important void in the area of multicast network management.

Revisiting the fair queuing paradigm for end-to-end congestion control

Today, the dominant paradigm for congestion control in the Internet is based on the notion of TCP friendliness. To be TCP-friendly, a source must behave in such a way as to achieve a bandwidth that is similar to the bandwidth obtained by a TCP flow that would observe the same round-trip time (RTT) and the same loss rate. However, with the success of the Internet comes the deployment of an increasing number of applications that do not use TCP as a transport protocol. These applications can often improve their own performance by not being TCP-friendly, which severely penalizes TCP flows. To design new applications to be TCP-friendly is often a difficult task. The idea of the fair queuing (FQ) paradigm as a means to improve congestion control was first introduced by Keshav (1991). While Keshav made a fundamental step toward a new paradigm for the design of congestion control protocols, he did not formalize his results so that his findings could be extended for the design of new congestion control protocols. We make this step and formally define the FQ paradigm as a paradigm for the design of new end-to-end congestion control protocols. This paradigm relies on FQ scheduling with per-flow scheduling and longest queue drop buffer management in each router. We assume only selfish and noncollaborative end users. Our main contribution is the formal statement of the congestion control problem as a whole, which enables us to demonstrate the validity of the FQ paradigm. We also demonstrate that the FQ paradigm does not adversely impact the throughput of TCP flows and explain how to apply the FQ paradigm for the design of new congestion control protocols. As a pragmatic validation of the FQ paradigm, we discuss a new multicast congestion control protocol called packet pair receiver-driven layered multicast (PLM).

Optimization-based congestion control for multicast communications

This article outlines an approach for multicast congestion control based on an economic model that has been successfully applied to unicast congestion control. In this model, congestion signals are interpreted as prices and congestion-controlled sessions as utility maximizing agents. A naive extension of the unicast model fails to achieve a reasonable balance between providing the incentives necessary to promote the use of multicast and ensuring that multicast sessions do not interact too aggressively with unicast sessions. We extend the model by introducing a rational definition of multicast utility. The revised model provides a basis for multicast congestion control protocols that provide incentives to use multicast but are necessarily unfair to unicast traffic. We show, however, that the degree of unfairness can be controlled by appropriately setting a design parameter with a limiting case of strict fairness.

Wave and equation based rate control using multicast round trip time

This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multicast congestion control protocol to be equation based. The equation-based approach enforces fairness to TCP with the benefit that fluctuations in the flow rate are small in comparison to TCP.This paper also introduces the multicast round trip time (MRTT), a multicast analogue of the unicast round trip time (RTT). The MRTT is fundamental to the equation-based protocol that each receiver uses to adjust its reception rate. Each receiver independently measures its own MRTT without placing any added messaging burden on the receiver, the sender or the intermediate network elements. Benefits provided by the MRTT include those that the RTT provides to TCP, e.g., reduced reception rates in reaction to buffer filling and fair sharing of bottleneck links. In addition, the use of MRTT is shown to synchronize and equalize the reception rates of proximate receivers and to cause reception rates to increase as the density of receivers increases.Another innovation of WEBRC is the idea of transmitting data with waves: the transmission rate on a channel is periodic, with an exponentially decreasing form during an active period followed by a quiescent period. Benefits of using waves include insensitivity to large IGMP leave latency; a frequency of joins and leaves by each receiver that is small and independent of the receiver reception rate; the use of a small number of multicast channels; fine-grained control over the receiver reception rate; and minimal, at times nonexistent, losses due to buffer overflow.

A survey on TCP-friendly congestion control

New trends in communication, in particular the deployment of multicast and real-time audio/video streaming applications, are likely to increase the percentage of non-TCP traffic in the Internet. These applications rarely perform congestion control in a TCP-friendly manner; they do not share the available bandwidth fairly with applications built on TCP, such as Web browsers, FTP, or e-mail clients. The Internet community strongly fears that the current evolution could lead to congestion collapse and starvation of TCP traffic. For this reason, TCP-friendly protocols are being developed that behave fairly with respect to coexistent TCP flows. We present a survey of current approaches to TCP friendliness and discuss their characteristics. Both unicast and multicast congestion control protocols are examined, and an evaluation of the different approaches is presented.

PLM

A major challenge in the Internet is to deliver live audio/video content with a good quality and to transfer files to large number of heterogeneous receivers. Multicast and cumulative layered transmission are two mechanisms of interest to accomplish this task efficiently. However, protocols using these mechanisms suffer from slow convergence time, lack of inter-protocol fairness or TCP-fairness, and loss induced by the join experiments. In this paper we define and investigate the properties of a new multicast congestion control protocol (called PLM) for audio/video and file transfer applications based on a cumulative layered multicast transmission. A fundamental contribution of this paper is the introduction and evaluation of a new and efficient technique based on packet pair to infer which layers to join. We evaluated PLM for a large variety of scenarios and show that it converges fast to the optimal link utilization, induces no loss to track the available bandwidth, has inter-protocol fairness and TCP-fairness, and scales with the number of receivers and the number of sessions. Moreover, all these properties hold in self similar and multifractal environment.

On max-min fair congestion control for multicast ABR service in ATM

In the ATM Forum activities, considerable efforts have focused on the congestion control of point-to-point available bit rate (ABR) service. We present a novel approach that extends existing point-to-point (unicast) congestion control protocols to a point-to-multipoint (multicast) environment. In particular, we establish a unified framework to derive a multicast congestion control protocol for an ABR service from a given rate-based unicast protocol. We generalize a known necessary and sufficient condition on the max-min fairness of unicast rate allocation for a multicast service. Using this condition, we show that the resulting multicast protocol derived using our framework preserves the fairness characteristics of the underlying unicast protocol. The practical significance of our approach is illustrated by extending a standard congestion control mechanism for an ABR service to a multicast environment. The performance of the resulting multicast protocol is examined using benchmark network configurations suggested by the traffic management subworking group at the ATM Forum, and simulation results are presented to substantiate our claims.