Cart (Loading....) | Create Account
Close category search window
 

Doubly Finite Queues (DFQ) supporting for ABR traffic load in ATM networks using MSVDR algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Subramani, A. ; Dept. of MCA, K.S.R. Coll. of Eng., Namakkal ; Krishnan, A.

ATM, an ultimate solution of broadband-integrated service digital network (B-ISDN) to provide integrated multimedia services including voice, video, and data, has entered into the limelight with increased demand for such services. Hence, ATM is to be capable of supporting a variety of service classes and providing appropriate QoS according to classes. This may force us to sacrifice low priority traffic classes for high priority traffic classes to satisfy QoS requirements for the high priority traffic classes in case of congestion. There have been many possibilities suggested for traffic control in terms of QoS and 'Cell Loss Priority (CLP) control', which was originally introduced in ATM networks for the purpose of congestion control, must be one of them. The capability of CLP control can apply to Doubly Finite Queue buffer priority scheme. This scheme based only priority queuing disciplines that are used to secure the Cell Loss Ratio (CLR) of higher priority cells at the cost of loss of low priority cells by examining the CLP bit of each incoming cell set to '0' or '1'. The cell CLP value equal to '0' assign high priority cell and CLP value equal to '1' assign low priority cell. Priority queuing is especially appropriate in cases where WAN (Wide Area Network) links are congested from time to time. Doubly finite queues (DFQ) and multi-source virtual dynamic routing algorithm (MSVDR) use an adaptive and iterative path search approach and taken advantage of the PNNI hierarchical structure. It consists of the following six major components.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.