skip to main content
10.1145/1626553.1626571acmconferencesArticle/Chapter ViewAbstractPublication PagesqtnaConference Proceedingsconference-collections
research-article

Performance analysis of a finite capacity optical buffer with arrival correlation

Published: 29 July 2009 Publication History

Abstract

Providing a photonic alternative to the current electronic switching in the backbone, optical packet switching (OPS) and optical burst switching (OBS) require optical buffering. Optical buffering exploits delays in long optical fibres; an optical buffer is implemented by routing packets through a set of fibre delay lines (FDLs). Previous studies pointed out that, in comparison with electronic buffers, optical buffering suffers from an additional performance degradation. This contribution builds on this observation by studying optical buffer performance under more general traffic assumptions. Features of the optical buffer model under consideration include a Markovian arrival process, general burst sizes and a finite set of fibre delay lines of arbitrary length. Our algorithmic approach yields important performance measures such as the packet loss rate and the mean delay with a reasonable amount of computational time.

References

[1]
R. Almeida, J. Pelegrini, and H. Waldman. A generic-traffic optical buffer modeling for asynchronous optical switching networks. IEEE Communications Letters, 9(2):175--177, 2005.
[2]
F. Callegati. On the design of optical buffers for variable length packet traffic. In Proceedings of the Ninth International Conference on Computer Communication and Networks, pages 448--452, Las Vegas, 2000.
[3]
F. Callegati. Optical buffers for variable length packets. IEEE Communications Letters, 4(9):292--294, 2000.
[4]
F. Callegati. Approximate modeling of optical buffers for variable length packets. Photonic Network Communications, 3:383--390, 2001.
[5]
T. El-Bawab and J. Shin. Optical packet switching in core networks: Between vision and reality. IEEE Communications Magazine, 40(9):60--65, 2002.
[6]
K. Laevens and H. Bruneel. Analysis of a single-wavelength optical buffer. In Proceedings of IEEE Infocom 2003, San Francisco, 2003.
[7]
J. Lambert, W. Rogiest, B. Van Houdt, D. Fiems, C. Blondia, and H. Bruneel. A Hessenberg Markov chain for fast fibre delay line length optimization. In Proceedings of ASMTA 2008, Lecture Notes in Computer Science 5005, pages 101--113, 2008.
[8]
J. Lambert, B. Van Houdt, and C. Blondia. Single-wavelength optical buffers: non-equidistant structures and preventive drop mechanisms. In Proceedings of NAEC 2005, pages 545--555, Riva del Garda, Italy, 2005.
[9]
J. Lambert, B. Van Houdt, and C. Blondia. Queues with correlated service and inter-arrival times and their application to optical buffers. Stochastic Models, 22(2):233--251, 2006.
[10]
C. Qiao and M. Yoo. Optical burst switching (OBS) - a new paradigm for an optical internet. Journal of High Speed Networks, 8(1):69--84, 1999.
[11]
W. Rogiest, D. Fiems. K. Laevens, and H. Bruneel. Tracing an optical buffer's performance: an effective approach. In Proceedings of Net-COOP 2007. Lecture Notes in Computer Science 4465, Avignon, France, June 2007.
[12]
W. Rogiest, K. Laevens, D. Fiems, and H. Bruneel. A performance model for an asynchronous optical buffer. Performance Evaluation, 62(1--4):313--330, 2005. al).
[13]
W. Rogiest, K. Laevens, J. Walraevens, and H. Bruneel. Analyzing a degenerate buffer with general inter-arrival and service times in discrete time. Queueing Systems, 56(3--4):203--212, 2007.
[14]
W. Rogiest, J. Lambert, D. Fiems, B. V. Houdt, H. Bruneel, and C. Blondia. A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution. Performance Evaluation, 66(7): 343--355, 2009.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
QTNA '09: Proceedings of the 4th International Conference on Queueing Theory and Network Applications
July 2009
143 pages
ISBN:9781605585628
DOI:10.1145/1626553
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 July 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

QTNA '09
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 70
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media