Fair admission control scheme based on conditional preemption in traffic-groomed optical networks

Authors:
Chuan-Ching Sue;Yuan-Bin Hsu;Pey-Jiuan Ho
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC
Venue:
Photonic Network Communications
Year:
2010

Citing 8
Cited 0

An Analysis of Trunk Reservation and Grade of Service Balancing Mechanisms in Multiservice Broadband Networks

Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Call Admission Control for Multimedia Services in Mobile Cellular Networks: A Markov Decision Approach

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A Call Admission Control for Service Differentiation and Fairness Management in WDM Grooming Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Survivability and Traffic Grooming in WDM Optical Networks

Survivability and Traffic Grooming in WDM Optical Networks
A call admission control for service differentiation and fairness management in WDM grooming networks

Optical Switching and Networking
A comprehensive study on next-generation optical grooming switches

IEEE Journal on Selected Areas in Communications
Optimal Resource Allocation and Fairness Control in All-Optical WDM Networks

IEEE Journal on Selected Areas in Communications
Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In optical-grooming networks, the capacity fairness issue can be resolved by utilizing a call admission control mechanism. Existing call admission control schemes are generally based on one of the four different techniques, namely static bandwidth reservation (SBR), static threshold setting (STS), mathematical statistics (MS), and Markov decision processing without buffer implementation (NB). However, irrespective of the technique used, a tradeoff exists between the network fairness and the network throughput. Accordingly, this article presents a conditional-preemption call admission control (CP-CAC) scheme designed to increase the network throughput while simultaneously maintaining the fairness. The CP-CAC method is based on a dynamic threshold setting concept and is implemented using a single connection buffer (C-Buf) and a set of virtual buffers (V-Bufs). In general CAC mechanisms, if the residual bandwidth is sufficient to satisfy a new request but some requests are already buffered, the new request can be treated in two different modes, i.e. with-preemption (WP) or without-preemption (NP). In contrast, in the CP-CAC scheme proposed in this study, a conditional-preemption (CP) mode is proposed in which statistical information about the blocking probability is used to determine the preempt (or not) decision. The simulation results show that compared to the NB call admission control mechanism, the proposed CP-CAC scheme improves the network throughput without sacrificing the fairness. In addition, the average waiting time induced by the buffer implementation is just 0.25 time units. Finally, it is shown that the proposed method ensures fairness in a variety of common network topologies, including 6 脳 6 mesh-torus, NSF, and Cost 239.