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

Content Provider	Springer Nature Link
Author	Sue, Chuan Ching Hsu, Yuan Bin Ho, Pey Jiuan
Copyright Year	2010
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.
Starting Page	257
Ending Page	267
Page Count	11
File Format	PDF
ISSN	1387974X
Journal	Photonic Network Communications
Volume Number	20
Issue Number	3
e-ISSN	15728188
Language	English
Publisher	Springer US
Publisher Date	2010-08-05
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Traffic grooming Call admission control Markov decision process Fairness Conditional preemption Characterization and Evaluation of Materials Electrical Engineering Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Atomic and Molecular Physics, and Optics Computer Networks and Communications Electrical and Electronic Engineering Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Dynamic Preemption Call Admission Control Scheme Based on Markov Decision Process in Traffic Groomed Optical Networks

On Factors Affecting the Performance of Dynamically Groomed Optical WDM Mesh Networks

Simultaneous effect of connection admission control in distance and bandwidth capacity on WDM network performance

Hop constraint based admission and fairness control in IP-over-WDM networks

An efficient dynamic multicast traffic-grooming algorithm for WDM networks

Strategies for optimal logical topology design and traffic grooming

Hop constraint-based capacity fairness control in IP-over-WDM networks

Configuring Traffic Grooming VPλNs

Dynamic Virtual Topology Reconfiguration Algorithms for Groomed WDM Networks

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

Similar Documents

Dynamic Preemption Call Admission Control Scheme Based on Markov Decision Process in Traffic Groomed Optical Networks

On Factors Affecting the Performance of Dynamically Groomed Optical WDM Mesh Networks

Simultaneous effect of connection admission control in distance and bandwidth capacity on WDM network performance

Hop constraint based admission and fairness control in IP-over-WDM networks

An efficient dynamic multicast traffic-grooming algorithm for WDM networks

Strategies for optimal logical topology design and traffic grooming

Hop constraint-based capacity fairness control in IP-over-WDM networks

Configuring Traffic Grooming VPλNs

Dynamic Virtual Topology Reconfiguration Algorithms for Groomed WDM Networks

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