A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization

Authors:
Joke Lambert;Wouter Rogiest;Benny Houdt;Dieter Fiems;Chris Blondia;Herwig Bruneel
Affiliations:
PATS Research Group, IBBT & University of Antwerp, Antwerp, Belgium B-2020;SMACS Research Group, TELIN Department, Ghent University, Gent, Belgium B-9000;PATS Research Group, IBBT & University of Antwerp, Antwerp, Belgium B-2020;SMACS Research Group, TELIN Department, Ghent University, Gent, Belgium B-9000;PATS Research Group, IBBT & University of Antwerp, Antwerp, Belgium B-2020;SMACS Research Group, TELIN Department, Ghent University, Gent, Belgium B-9000
Venue:
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Year:
2008

Citing 6
Cited 1

Terabit burst switching

Journal of High Speed Networks - Special issue on optical networking
Optical burst switching (OBS) - a new paradigm for an optical Internet

Journal of High Speed Networks - Special issue on optical networking
Tracing an optical buffer's performance: an effective approach

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Approaches to optical Internet packet switching

IEEE Communications Magazine
CORD: contention resolution by delay lines

IEEE Journal on Selected Areas in Communications
Control architecture in optical burst-switched WDM networks

IEEE Journal on Selected Areas in Communications

Performance analysis of FDL buffers: a heuristic approach with impatience and quantization

Proceedings of the 5th International Conference on Queueing Theory and Network Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an approach to compute the invariant vector of the N+ 1 state Markov chain Ppresented in (Rogiest et al., Lecture Notes in Computer Science, NET-COOP 2007 Special Issue, pp. 4465:185-194) to determine the loss rate of an FDL buffer consisting of Nlines, by solving a related Hessenberg system (i.e., a Markov chain skip-free in one direction). This system is obtained by inserting additional time instants in the sample paths of Pand allows us to compute the loss rate for various FDL lengths by solving a single system. This is shown to be especially effective in reducing the computation time of the heuristic LRA algorithm presented in (Lambert et al., Proc. NAEC 2005, pp. 545-555) to optimize the FDL lengths, where improvements of several orders of magnitude can be realized.