We study the optimal control of communication networks in the presence of heterogeneous traffic requirements. Specifically, we distinguish the flows into two crucial classes: inelastic for modeling high-priority, delay-sensitive, and fixed-throughput applications; and elastic for modeling low-priority, delay-tolerant, and throughput-greedy applications. We note that the coexistence of such diverse flows creates complex interactions at multiple levels (e.g., flow and packet levels), which prevent the use of earlier design approaches that dominantly assume homogeneous traffic.
In this work, we develop the mathematical framework and novel design methodologies needed to support such heterogeneous requirements and propose provably optimal network algorithms that account for the multilevel interactions between the flows. To that end, we first formulate a network optimization problem that incorporates the above throughput and service prioritization requirements of the two traffic types.
We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed throughput and prioritization requirements of the inelastic flows. Next, we extend our joint algorithm in two ways to further improve its performance: in delay through a virtual queue implementation with minimal throughput degradation and in utilization by allowing for dynamic multi-path routing for elastic flows. A unique characteristic of our proposed dynamic routing solution is the novel two-stage queuing architecture it introduces to satisfy the service prioritization requirement.
Existing System diverse flows creates complex interactions at multiple levels (e.g., flow and packet levels), which prevent the use of earlier design approaches that dominantly assume homogeneous traffic. The central design goal is very complex. Problems occur when receive all data packets from transmissions and retransmissions.
For Serving Heterogeneous Flows, Realistic Broadcast Protocol Handler (RBPH) has been proposed here for having a Unified Approach to Optimizing Performance in Networks.
Realistic Broadcast Protocol Handler (RBPH) is a reliable multicast transport protocol mainly aimed for applications that require ordered, duplicate-free, multicast data delivery from multiple sources to multiple receivers.
The advantage of RBPH over traditional multicast protocols is that it guarantees that a receiver in the group either receives all data packets from transmissions and retransmissions, or is able to detect unrecoverable data packet loss.
RBPH is specifically intended as a workable solution for multicast applications with basic reliability requirements. Its central design goal is simplicity of operation with due regard for scalability and network efficiency.
- Data Transmission (ODATA)
- Data Retransmission (RDATA)
- Source Path State (SPMs)
- NACK Reliability (NAK/NCFs)
- Transmit Window Advance