This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model
October 1995 (vol. 6 no. 10)
pp. 1068-1084
ASCII Text
x 
 
Nageswara S.V. Rao, Kurt J. Maly, Stephan Olariu, Sudheer Dharanikota, Liping Zhang, David E. Game, "Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 1068-1084, October, 1995.
 
 
BibTex
x
 
@article{ 10.1109/71.473516,
author = {Nageswara S.V. Rao and Kurt J. Maly and Stephan Olariu and Sudheer Dharanikota and Liping Zhang and David E. Game},
title = {Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {6},
number = {10},
issn = {1045-9219},
year = {1995},
pages = {1068-1084},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.473516},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model
IS - 10
SN - 1045-9219
SP1068
EP1084
EPD - 1068-1084
A1 - Nageswara S.V. Rao,
A1 - Kurt J. Maly,
A1 - Stephan Olariu,
A1 - Sudheer Dharanikota,
A1 - Liping Zhang,
A1 - David E. Game,
PY - 1995
KW - Network protocols
KW - DQDB
KW - working window
KW - distributed queue
KW - performance analysis.
VL - 6
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—The Distributed Queue Dual Bus (DQDB) system consists of a linear arrangement of N nodes that communicate with each other using two contra-flowing buses. The nodes use an extremely simple protocol to send messages on these buses. This simple, but elegant, system has been found to be very challenging to analyze. We consider a simple and uniform abstraction of this model to highlight the fairness issues in terms of average waiting time. We introduce a new approximation method to analyze the performance of DQDB system in terms of the average waiting time of a node expressed as a function of its position. Our approach abstracts the intimate relationship between the load of the system and its fairness characteristics, and explains all basic behavior profiles of DQDB observed in previous simulation. For the uniform DQDB with equal distance between adjacent nodes, we show that the system operates under three basic behavior profiles and a finite number of their combinations that depend on the load of the network. Consequently, the system is not fair at any load in terms of the average waiting times. We also show that the main theme of the analysis carries over to the general (nonuniform) DQDB. By suitably choosing the inter-node distances, the DQDB can be made fair around some loads, but such system will become unfair as the load changes. In the vicinity of a critical load, the uniform network runs into a state of instability, where its behavior fluctuates from one extreme to the other with small load variations. Our analysis is supported by simulation results.

[1] American National Standard, Fiber Distributed Data Interface(FDDI) token ring media access control, ANSI X3.139-1987, Nov.5, 1987.
[2] “IEEE Standards for Local and Metropolitan Area Networks: Distributed Queue Dual Bus (DQDB) Subnetwork of a Metropolitan Area Network (MAN),” IEEE802.6, July 1991.
[3] M. Abramowitz and I.A. Stegun (Eds.), , Handbook of Mathematical Functions.New York: Dover Pub., 1965.
[4] A. Benveniste,M. Metivier,, and P. Priouret,Adaptive Algorithms and Stochastic Approximation.New York: Springer-Verlag, 1990.
[5] C. Bisdikian,“Waiting time analysis in a single buffer DQDB (802.6)network, IEEE J. Selected Areas in Comm., vol. 8, no.8, pp. 1,565-1,573, 1990.
[6] C. Bisdikian,“A queueing model with applications to bridges and the DQDB (IEEE802.6) MAN, Computer Networks and ISDN Systems, vol. 25, pp. 1,279-1,289, 1993.
[7] H.-F. Chen,Recusrsive Estimation and Control of Stochastic Systems.New York: John Wiley, 1985.
[8] M. Conti,E. Gregori,, and L. Lenzini,“DQDB media access control protocol: Performance evaluation andunfairness analysis, Proc. 3rd IEEE Workshop Metropolitan Area Networks,San Diego, Calif., Mar.28-30, 1989, pp. 7.3.1-7.3.33.
[9] P. Davids and P. Martini,“Performance analysis of DQDB, 9th Ann. Int’l Phoenix Conf. Computers and Comm., Mar.21-23, 1990,Scottsdale, Arizona, pp. 548-555.
[10] P. Davids and T. Welzel,“Performance analysis of DQDB based on simulation, 3rd IEEE Workshop on Metropolitan Area Networks, Mar. 1989.
[11] P.J. Denning,“The working set model for program behavior,” Comm. ACM, vol. 11, pp. 323-333, May 1968.
[12] P.J. Denning,“Working sets past and present,” IEEE Trans. Software Engineering, vol. 6, no.1, pp. 64-84, 1980.
[13] S. Fdida and H. Santoso,“Performance issues of DQDB, 4th Int’l Conf. Data Comm. Sys and Their Performance,Barcelona, June20-22, 1990.
[14] S. Fdida and H. Santoso,“Approximate performance model and fairness condition of the DQDBprotocol, NATO Advanced Research Workshop Architecture and Performance Issues ofHigh-Capacity Lans and Mans,Sophia-Antipolis, June 1990.
[15] J. Filipiak,“Access protection for fairness in a DQDB MAN, Proc. IEEE Int’l. Conf. Comm.,Boston, Mass., pp. 635-639, 1989.
[16] M.W. Garrett, and S. Li, A Study of slot reuse in dual bus multiple access networks, Proc. IEEE INFOCOM’90, pp. 617-629, 1990.
[17] L. Gerencser,“, Strong approximation results in estimation and adaptivecontrol,” Topics in Stochastic Systems: Modelling, Estimation and Adaptive Control.New York: Springer-Verlag, 1992.
[18] P.T-. Gia and T. Stock,“Approximate performance analysis of the DQDB access protocol, Computer Networks and ISDN Systems, vol. 20, pp. 231-240, 1990.
[19] E.L. Hahne, A.K. Choudhury, and N.F. Maxemchuk, "Improving the Fairness of Distributed-Queue-Dual-Bus Networks," Proc. IEEE INFOCOM '90, pp. 175-184, June 1990.
[20] E. Huang and L. Merakos, "On the Access Fairness If the DQDB MAN Protocol," Proc. IEEE 1990 Phoenix Conf., pp. 556-559, Mar. 1990.
[21] H. Kaur and G. Campbell,“DQDB-An access delay analysis,” Proc. IEEE INFOCOM’90, pp. 630-635, 1990.
[22] H.J. Kushner and D.S. Clark,Stochastic Approximation Methods for Constrained and UnconstrainedSystems.New York: Springer Verlag, 1979.
[23] A. Lombardo,S. Palazzo,D. Panno,R. Pingnatelli,, and L. Susanna,“An adaptive policing mechanism for a DQDB MAN,” Computer Networks and ISDN Systems, vol. 25, pp. 1,119-1,126, 1993.
[24] Y.S. Leu and D.H.C. Du,“Cycle compensation DQDB: A completely fair multiple priority classprotocol for the uni-directional twin-bus architecture,” Tech. Rep. TR 90-32, Computer Science Dept., Univ. Minn., May 1990.
[25] J.F. Mollenauer,“Standards for metropolitan area networks,” IEEE Comm. Magazine, vol. 26, pp. 15-19, 1988.
[26] B. Mukherjee and S. Banerjee,“Alternative strategies for improving the fairness in and ananalytical model of the DQDB network,” IEEE Trans. Computers, vol. 42, no. 2, pp. 151-167, 1993.
[27] B. Mukherjee and C. Bisdikian,“A journey through the DQDB network literature,” Performance Evaluation, vol. 16, no. 1-3, pp. 129-158, 1992.
[28] A. Myles, DQDB simulation and MAC protocol analysis, Electronic Letters, Apr.27, 1989, vol. 25, no. 9, pp. 616-618.
[29] R.M. Newman and J.L. Hullet,“Distributed queueing: A fast and efficient packet access protocolfor QPSX,” New Comm. Services: A Challenge to Computer Technology, P.Kuhn (Ed.), North-Holland 1986, pp. 294-299.
[30] R.M. Newman,Z.L. Budrikis,, and J.L. Hullet,“The QPSX MAN,” IEEE Comm. Magazine, vol. 26, no. 4, 1988, pp. 20-28.
[31] S.N. Rasband,Chaotic Dynamics of Nonlinear Systems.New York: John Wiley, 1990.
[32] N.S.V. Rao,K. Maly,S. Olariu,S. Dharanikota,L. Zhang,, and D. Game,“Average waiting time profiles of uniform DQDB model,” Proc. IEEE INFOCOM’94: The Conf. Computer Comm., IEEE Computer Society Press, 1994, pp. 1,326-1,333.
[33] N.S.V. Rao,K. Maly,S. Olariu,L. Zhang,, and D. Game,“Average waiting time profiles of DQDB,” Proc. 1991 Int. Conf. Parallel Processing, CRC Press, vol. II, pp. 278-279.
[34] M.A. Roddrigues,“Erasure node: Performance improvements for the IEEE 802.6MAN,” Proc. IEEE INFOCOM’90, pp. 636-643, 1990.
[35] K. Sauer, and W. Schodl,“Performance aspects of the DQDB protocol, Computer Networks and ISDNSystems,” vol. 20, pp. 253-260, 1990.
[36] J.W. Wong,“Throughput of DQDB networks under heavy load,” Proc. 7th Europ. Fibre Optic Comm. Local Area Networks Expo,Amsterdam, The Netherlands, June 1989, pp. 146-151.
[37] T. Yokotani,H.S. Sato,, and Nakatsuka,“A study on a performance improvement algorithm in DQDBMAN,” Computer Networks and ISDN Systems, vol. 25, pp. 1,107-1,117, 1993.
[38] M. Zuckerman,“On packet switching capacity in QPSX,” Proc. IEEE/IEICE Global Telecomm. Conf., 1987, pp. 15-18.
[39] M. Zuckerman,“Queueing performance of QPSX,” Proc. 12th Int. Teletraffic Congress, 1988, pp. 2.2B6.1-2.2B6.7.
[40] M. Zuckerman, Overload control of isochronous traffic in QPSX, Proc. IEEE Global Telecommunications Conf., 1988, pp. 38.3.1-38.3.5.
[41] M. Zuckerman, and P.G. Potter,“The DQDB protocol and its performance under overload trafficconditions,” Computer Networks and ISDN Systems, vol. 20, pp. 261-270, 1990.

Index Terms:
Network protocols, DQDB, working window, distributed queue, performance analysis.
Citation:
Nageswara S.V. Rao, Kurt J. Maly, Stephan Olariu, Sudheer Dharanikota, Liping Zhang, David E. Game, "Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 1068-1084, Oct. 1995, doi:10.1109/71.473516
Usage of this product signifies your acceptance of the Terms of Use.