dc.contributor.advisor | Akar, Nail | |
dc.contributor.author | Doğan, Kaan | |
dc.date.accessioned | 2016-07-01T11:04:45Z | |
dc.date.available | 2016-07-01T11:04:45Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/11693/29772 | |
dc.description | Cataloged from PDF version of article. | en_US |
dc.description.abstract | Wavelength conversion is known to be one of the most effective methods for
contention resolution in optical packet/burst switching networks. In this thesis,
we study various optical switch architectures that employ partial wavelength
conversion, as opposed to full wavelength conversion, in which a number of converters
are statistically shared per input or output link. Blocking is inevitable
in case contention cannot be resolved and the probability of packet blocking is
key to performance studies surrounding optical packet switching systems. For
asynchronous switching systems with per output link converter sharing, a robust
and scalable Markovian queueing model has recently been proposed by Akar and
Karasan for calculating blocking probabilities in case of Poisson traffic. One of
the main contributions of this thesis is that this existing model has been extended
to cover the more general case of a Markovian arrival process through
which one can study the impact of traffic parameters on system performance.
We further study the same problem but with the converters being of limited range type. Although an analytical model is hard to build for this problem, we
show through simulations that the so-called far conversion policy in which the
optical packet is switched onto the farthest available wavelength in the tuning
range, outperforms the other policies we studied. We point out the clustering
effect in the use of wavelengths to explain this phenomenon. Finally, we study a
synchronous optical packet switching architecture employing partial wavelength
conversion at the input using the per input line converter sharing. For this architecture,
we first obtain the optimal wavelength scheduler using integer linear
programming and then we propose a number of heuristical scheduling algorithms.
These algorithms are tested using simulations under symmetric and asymmetric
traffic scenarios. Our results demonstrate that one can substantially reduce the
costs of converters used in optical switching systems by using share per input
link converter sharing without having to sacrifice much from the low blocking
probabilities provided by full input wavelength conversion. Moreover, we show
that the heuristic algorithm that we propose in this paper provides packet loss
probabilities very close to those achievable using integer linear programming and
is also easy to implement. | en_US |
dc.description.statementofresponsibility | Doğan, Kaan | en_US |
dc.format.extent | xii, 58 leaves, illustrations | en_US |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Optical packet switching | en_US |
dc.subject | Optical burst switching | en_US |
dc.subject | Wavelength conversion | en_US |
dc.subject | Converter sharing | en_US |
dc.subject | Block-tridiagonal LU factorization | en_US |
dc.subject | Markovian arrival process | en_US |
dc.subject | Wavelength scheduling | en_US |
dc.subject.lcc | TK5105.3 .D64 2006 | en_US |
dc.subject.lcsh | Packet switching. | en_US |
dc.title | Performance study of asynchronous/ synchronous optical burst/ packet switching with partial wavelength conversion | en_US |
dc.type | Thesis | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.publisher | Bilkent University | en_US |
dc.description.degree | M.S. | en_US |
dc.identifier.itemid | BILKUTUPB096225 | |