ACM Home Page
Please provide us with feedback. Feedback
Queueing-based analysis of broadcast optical networks
Full text PdfPdf (1.26 MB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 26 ,  Issue 1  (June 1998) table of contents
Pages: 121 - 130  
Year of Publication: 1998
ISSN:0163-5999
Also published in ...
Authors
Martin W. McKinnon  Georgia Tech Research Institute, Atlanta, GA
George N. Rouskas  Department of Computer Science, North Carolina State University, Raleigh, NC
Harry G. Perros  Department of Computer Science, North Carolina State University, Raleigh, NC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/277858.277888
What is a DOI?

ABSTRACT

We consider broadcast WDM networks operating with schedules that mask the transceiver tuning latency. We develop and analyze a queueing model of the network in order to obtain the queue-length distribution and the packet loss probability at the transmitting and receiving side of the nodes. The analysis is carried out assuming finite buffer sizes, non-uniform destination probabilities and two-state MMBP traffic sources; the latter naturally capture the notion of burstiness and correlation, two important characteristics of traffic in high-speed networks. We present results which establish that the performance of the network is a complex function of a number of system parameters, including the load balancing and scheduling algorithms, the number of available channels, and the buffer capacity. We also show that the behavior of the network in terms of packet loss probability as these parameters are varied cannot be predicted without an accurate analysis. Our work makes it possible to study the interactions among the system parameters, and to predict, explain and fine tune the performance of the network.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Azizoglu, R. A. Barry, and A. Mokhtar. Impa#ct of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic. IEEE .}SAC, 14(5):935-944, June 1996.
 
2
M.S. Borella and B. Mukherjee. Efficient scheduling of nonuniform packet tram(: in a WDM/TDM local lightwave network with arbitrary transceiver tuning Iatencies. IEEE JSAC, 14(5):923-934, June 1996.
 
3
Mon-Song Chen, N. R. Dono, and R. Ramaswami. A nmdia-acc(.'ss protocol for packet-switched wav(:I(',,gtlL division multiaccess metropolitan area networks. It'_:EE JSAC, 8(6):1048-1057, August 1990.
 
4
R. Cruz, G. Hill, A. Kellner, R. Ramaswami, G. Sasa.ki, and Y. Yamabayashi (Eds.). Special issue on optical networks. {EEE JSAC, 14(5), June 1996.
 
5
J. Jue, M. Borella, and B. Mukherjee. Performance analysis of the Rainbow WDM optical network prol, otype. It6'EE .lEA C, 14(5):945-951, .l#ll#e 11996.
6
 
7
H.G. Perros attd K. M. Elsayed. Call admission control schemes: A review. IEEE Communications Magazine, 34(11):82-91, 1996.
 
8
 
9
 
10
D. Park, H. G. Perros, and H. Yamashita. Approximate analysis of discrete-time tandem queueing networks with bursty and correleated input traffic and customer loss. Operations Research Letters, 15:95-104, 1994.
 
11
 
12
 
13
 
14
 
15
W. Stewart. Numerical Solutions of Markov Chains. Princeton University Press, Princeton, New Jersey, 1994.
 
16
S. Tridandapani, J. Meditch, and A. Somani. The MaTPi protocol: Masking tuning times through pipelining in WDM optical networks. In INFOCOM '95, pp. 1528-1535, June 1994.
 
17
R. W. Wolff. Stochastic Modeling and the Theory oJ' Queues. Prentice-Hall, Englewood Cliffs, N J, 1989.
 
18

Collaborative Colleagues:
Martin W. McKinnon: colleagues
George N. Rouskas: colleagues
Harry G. Perros: colleagues

Peer to Peer - Readers of this Article have also read: