Resource allocation for broadband networks

The major benefit of a broadband integrated ATM (asynchronous transfer mode) network is flexible and efficient allocation of communications bandwidth for communications services. However, methods are needed for evaluating congestion for integrated traffic. The author suggests evaluating congestion at different levels, namely the packet level, the burst level, and the call level. Congestion is measured by the probabilities of packet blocking, burst blocking, and call blocking. He outlines the methodologies for comparing these blocking probabilities. The author uses the congestion measures for a multilayer bandwidth-allocation algorithm, emulating some function of virtual circuit setup, fast circuit switching, and fast packet switching at these levels. The analysis also sheds insight on traffic engineering issues such as appropriate link load, traffic integration, trunk group and switch sizing, and bandwidth reservation criteria for two bursty services     

Study of LSP arrangement schemes in label switch networks

Label switch paths (LSP) are regarded as the routing components of an end‐to‐end connection in label switching network from the traffic engineering point of view. Thus, an end‐to‐end connection may travel more than one LSP. The QoS of this end‐to‐end connection relies on the performance of each LSP it travels. Therefore, to carefully arrange LSP is an essential step towards QoS networks. Generally speaking, the capacity of a specific link is not allocated for high‐priority LSP because it will cause inflexibility in the scheduling process. In this paper, the best‐fit shortest path (BSP) assignment and the worst shortest path (WSP) assignment schemes are proposed for the arrangement of label switch paths. In order to provide flexibility in packet scheduling, we propose that the BSP scheme to be applied for allocation of low‐priority LSP and the WSP scheme is used for the arrangement of LSP with high priority. Based on these two schemes, we extend them with elastic bandwidth allocation to prevent the bandwidth of the link from being occupied by the higher priority LSP. The experimental results indicate that, compared to the BSP‐only scheme, the proposed hybrid scheme demonstrates a more efficient way of arranging prioritized LSP. Moreover, the proposed elastic constrained bandwidth allocation scheme also illustrates a rather good performance in smoothing the link utilization of high‐priority LSP. Copyright © 2005 John Wiley & Sons, Ltd.     

A dynamic bandwidth allocation scheme for differentiated services in EPONs

Passive optical networks bring high-speed broadband access via fiber to the business, curb and home. Among various types of PONs, Ethernet PONs are gaining more and more attention since they are built on widely used Ethernet technology and can offer high bandwidth, low cost and broad services. EPONs use a point-to-multipoint topology, in which multiple optical network units share one uplink channel to transmit multimedia traffic to a control element, the optical line terminal. To avoid data collision on the shared uplink channel, a key issue in EPONs is a contention-free MAC protocol for the OLT to schedule the transmission order of different ONUs. In this article we first review some DBA schemes available in the literature, then propose a two-layer bandwidth allocation scheme that implements weight based priority for this need. To maximally satisfy the requests of all ONUs and provide differentiated services, an ONU is allowed to request bandwidth for all its available traffic, and all traffic classes proportionally share the bandwidth based on their instantaneous demands. The weight set for each class not only prevents high-priority traffic from monopolizing the bandwidth under heavy load but also ensures a minimum bandwidth allocated to each traffic class.     

Efficient Uplink Bandwidth Request with Delay Regulation for Real-Time Service in Mobile WiMAX Networks

The emerging broadband wireless access technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband service at low cost. This paper proposes an efficient uplink bandwidth request-allocation algorithm for real-time services in Mobile WiMAX networks based on IEEE 802.16e. In order to minimize bandwidth wastage without degrading quality of service (QoS), we introduce a notion of target delay and propose dual feedback architecture. The proposed algorithm calculates the amount of bandwidth request such that the delay is regulated around the desired level to minimize delay violation and delay jitter for real-time services. Also, it can increase utilization of wireless channel by making use of dual feedback, where the bandwidth request is adjusted based on the information about the backlogged amount of traffic in the queue and the rate mismatch between packet arrival and service rates. Due to the target delay and dual feedback, the proposed scheme can control delay and allocate bandwidth efficiently while satisfying QoS requirement. The stability of the proposed algorithm is analyzed from a control-theoretic viewpoint, and a simple design guideline is derived based on this analysis. By implementing the algorithm in OPNET simulator, its performance is evaluated in terms of queue regulation, optimal bandwidth allocation, delay controllability, and robustness to traffic characteristics.     

A Time-Slot Assignment Strategy for ATM Broadband Indoor Wireless Networks

The rapid development of wireless in-building communication systems, has widened the scope of supported applications. Remote terminals may be capable of producing broadband real-time traffic such as variable bit-rate (VBR) video or bursty data transfers. Consequently one of the important issues in indoor broadband wireless networks (IBWN) is employment of an efficient bandwidth management protocol. In such a protocol, both the effects of radio channel behavior and the traffic heterogeneity have to be considered. In this paper we present a bandwidth allocation scheme based on the interplay of the radio channel characteristics and the traffic parameters and requirements. In the proposed scheme the base station visits the terminals in a non-uniform cyclic fashion. The inter-visit interval and the amount of service which is provided to each user during a visit, is determined using the channel and traffic parameters based on an analytical approach. This system is evaluated by simulations and is found to provide improved performance in fulfilling the requirements of multimedia services in IBWN.     

Radio resource management for cellular CDMA systems supporting heterogeneous services

A novel radio resource management (RRM) scheme for the support of packet-switched transmission in cellular CDMA systems is proposed by jointly considering the physical, link, and network layer characteristics. The proposed resource management scheme is comprised of a combination of power distribution, rate allocation, service scheduling, and connection admission control. Power distribution allows individual connections to achieve their required signal-to-interference-plus-noise ratio, while rate allocation guarantees the required delay/jitter for real-time traffic and the minimum transmission rate requirement for non-real-time traffic. Efficient rate allocation is achieved by making use of the randomness and burstiness; of the packet generation process. At the link layer, a packet scheduling scheme is developed based on information derived from power distribution and rate allocation to achieve quality of service (QoS) guarantee. Packet scheduling efficiently utilizes the system resources in every time slot and improves the packet throughput for non-real-time traffic. At the network layer, a connection admission control (CAC) scheme based on the lower layer resource allocation information is proposed. The CAC scheme makes use of user mobility information to reduce handoff connection dropping probability (HCDP). Theoretical analysis of the grade of service performance, in terms of new connection blocking probability, HCDP, and resource utilization, is given. Numerical results show that the proposed RRM scheme can achieve both effective QoS guarantee and efficient resource utilization.     

Congestion-free communication in high-speed packet networks

The process of packet clustering in a network with well-regulated input traffic is studied and a strategy for congestion-free communication in packet networks is proposed. The strategy provides guaranteed services per connection with no packet loss and an end-to-end delay which is a constant plus a small bounded jitter term. It is composed of an admission policy imposed per connection at the source node, and a particular queuing scheme practiced at the switching nodes, which is called stop-and-go queuing. The admission policy requires the packet stream of each connection to possess a certain smoothness property upon arrival at the network. This is equivalent to a peak bandwidth allocation per connection. The queuing scheme eliminates the process of packet clustering and thereby preserves the smoothness property as packets travel inside the network. Implementation is simple     

A new satellite communication bandwidth allocation combined services model and network performance optimization

With the rapid development of online to offline economy, new services compositions would take up a great part in the satellite communication. More and more new services compositions request more bandwidth and network resources, which lead to serious traffic congestion and low channel utilization. Suffering from isolated link connection and changeable delay under the satellite environment, current bandwidth allocation schemes could not satisfy with the demand of low delay and high assess rate for new satellite services. This paper focuses on bandwidth allocation method for satellite communication services compositions. The novel models of services compositions with single‐hop Poisson distribution are designed to simulate original traffic arrival. Isolated independent coefficients take an original distribution to adapt to isolated disconnections. Services queue waiting time would be judged by acceptable delay threshold. Models provide new services compositions with more precise arrival distributions. In order to improve traffic congestion, the method combined services models, and a network performance is proposed. Optimal reserved bandwidth is set according to the priority and arrival distribution of different services compositions, which classify services with feedback transmission performance. We design minimum fuzzy delay tolerant intervals to calculate delay tolerant threshold, which adapt random delay changes in the services network with delay tolerant features. The simulation in OPNET demonstrates that the proposed method has a better performance of queuing delay by 16.3%, end‐to‐end delay by 18.7%, and bandwidth utilization by 13.2%. Copyright © 2016 John Wiley & Sons, Ltd.     

Dynamic bandwidth allocation with fair scheduling for WCDMA systems

Dynamic bandwidth allocation (DBA) will play an important role in future broadband wireless networks, including the 3G and 4G WCDMA systems. A code-division generalized processor sharing (CDGPS) fair scheduling DBA scheme is proposed for WCDMA systems. The scheme exploits the capability of the WCDMA physical layer, reduces the computational complexity in the link layer, and allows channel rates to be dynamically and fairly scheduled in response to the variation of traffic rates. Deterministic delay bounds for heterogeneous packet traffic are derived. Simulation results show that the proposed CDGPS scheme is effective in supporting differentiated QoS, while achieving efficient utilization of radio resources.     

A fast packet switch for the integrated services backbone network

With the projected growth in demand for bandwidth and telecommunication services will come the requirement for a multiservice backbone network of far greater efficiency, capacity, and flexibility than ISDN (integrated-services digital network) is able to satisfy. This class of network has been termed the broadband ISDN, and the design of the switching nodes of such a network is the subject of much research. The author investigates one possible solution. The design and performance, for multiservice traffic, is presented for a fast packet switch based on a nonbuffered, multistage interconnection network. It is shown that for an implementation in current CMOS technology, operating at 50 MHz, switches with a total traffic capacity of up to 150 Gb/s can be constructed. Furthermore, if the reserved service traffic load is limited on each input port to a maximum of 80% of switch port saturation, then a maximum delay across the switch of on the order of 100 μs can be guaranteed, for 99% of the reserved service traffic, regardless of the unreserved service traffic load     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

Inter‐ONU Bandwidth Scheduling by Using Threshold Reporting and Adaptive Polling for QoS in EPONs

I dynamic bandwidth allocation (DBA) scheme, an inter–optical network unit (ONU) bandwidth scheduling, is presented to provide quality of service (QoS) to different classes of packets in Ethernet passive optical networks (EPONs). This scheme, referred to as TADBA, is based on efficient threshold reporting from, and adaptive polling order rearranging of, ONUs. It has been shown that the network resources are efficiently allocated among the three traffic classes by guaranteeing the requested QoS, adaptively rearranging the polling orders, and avoiding nearly all fragmentation losses. Simulation results using an OPNET network simulator show that TADBA performs well in comparison to the available allocation scheme for the given parameters, such as packet delay and channel utilization.     

The performance analysis and implementation of an input accessscheme in a high-speed packet switch

The performance analysis of an input access scheme in a high-speed packet switch for broadband ISDN is presented. In this switch, each input port maintains a separate queue for each of the outputs, thus n ² input queues in an (n×n) switch. Using synchronous operation, at most one packet per input and output will be transferred in any slot. We derive lower and upper bounds for the throughput which show close to optimal performance. The bounds are very tight and approach to unity for switch sizes on the order of a hundred under any traffic load, which is a significant result by itself. Then the mean packet delay is derived and its variance is bounded. A neural network implementation of this input access scheme is given. The energy function of the network, its optimized parameters and the connection matrix are determined. Simulation results of the neural network fall between the theoretical throughput bounds     

Bandwidth allocation and connection admission control in ATMnetworks

Asynchronous transfer mode (ATM) is the transmission format for almost all future communication networks, including broadband integrated services digital networks (B-ISDN). The key feature of ATM is its high flexibility in bandwidth allocation. Instead of reserving capacity for each connection, the bandwidth is allocated on demand. As a consequence, packets (called cells in ATM terminology) might be lost. To guarantee a given quality of service (QoS), some kind of control is needed to decide whether to accept or to reject an incoming connection. A connection is accepted only if the network has sufficient resources to achieve the QoS required by the user without affecting the QoS of the existing connections. In ATM networks, connection admission control (CAC) is responsible for this decision. It is a very complex function because the traffic may vary greatly and have poorly known characteristics. This paper describes CAC procedures proposed in the literature and discusses issues related to bandwidth allocation in ATM networks. It shows that CAC and statistical multiplexing are only needed for certain connections     

Sunshine: a high performance self-routing broadband packet switcharchitecture

The authors present a high-performance self-routing packet switch architecture, called Sunshine, that can support a wide range of services having diverse performance objectives and traffic characteristics. Sunshine is based on Batcher-banyan networks and achieves high performance by utilizing both internal and output queuing techniques within a single architecture. This queuing strategy results in an extremely robust and efficient architecture suitable for a wide range of services. An enhanced architecture allowing the bandwidth from an arbitrary set of transmission links to be aggregated into trunk groups to create high bandwidth pipes is also presented. Trunk groups appear as a single logical port on the switch and can be used to increase the efficiency of the switch in an extremely bursty environment or to increase the access bandwidth for selected high-bandwidth terminations. Simulation results are presented