Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kaan Dogan

dblp:13/3879 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Optical networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Optical networks › routing and wavelength assignment
blocking probability analysis
0.112006
Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals · IEEE J. Sel. Areas Commun. 2006
Optical networks
optical switching
0.112006
Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals · IEEE J. Sel. Areas Commun. 2006
Optical networks
wavelength converter sharing
0.112006
Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals · IEEE J. Sel. Areas Commun. 2006
Performance modeling and evaluation › queueing models
markovian arrival process
0.112006
Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals · IEEE J. Sel. Areas Commun. 2006
Performance modeling and evaluation
queueing models
0.112006
Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals · IEEE J. Sel. Areas Commun. 2006

Methods — techniques the papers use, named apart from their topics

continuous-time markov chain · 0.1block tridiagonal LU factorization · 0.1
YearPublicationVenuePosition
2006 A Performance Study of Limited Range Partial Wavelength Conversion for Asynchronous Optical Packet/Burst Switching
abstract
In this work, we study an asynchronous optical packet/burst switching node equipped with a number of limited range wavelength converters shared per output link. A wave-length conversion policy is one by which the outgoing wavelength for an optical packet is selected if its incoming wavelength is in use. Through simulations, we show 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.
Kaan Dogan, Nail Akar
ICC1
2006 Wavelength Converter Sharing in Asynchronous Optical Packet/Burst Switching: An Exact Blocking Analysis for Markovian Arrivals
abstract
In this paper, we study the blocking probabilities in a wavelength division multiplexing-based asynchronous bufferless optical packet/burst switch equipped with a bank of tuneable wavelength converters dedicated to each output fiber line. Wavelength converter sharing, also referred to as partial wavelength conversion, corresponds to the case of a number of converters shared amongst a larger number of wavelength channels. In this study, we present a probabilistic framework for exactly calculating the packet blocking probabilities for optical packet/burst switching systems utilizing wavelength converter sharing. In our model, packet arrivals at the optical switch are first assumed to be Poisson and later generalized to the more general Markovian arrival process to cope with very general traffic patterns whereas packet lengths are assumed to be exponentially distributed. As opposed to the existing literature based on approximations and/or simulations, we formulate the problem as one of finding the steady-state solution of a continuous-time Markov chain with a block tridiagonal infinitesimal generator. To find such solutions, we propose a numerically efficient and stable algorithm based on block tridiagonal LU factorizations. We show that exact blocking probabilities can be efficiently calculated even for very large systems and rare blocking probabilities, e.g., systems with 256 wavelengths per fiber and blocking probabilities in the order of 10-40. Relying on the stability and speed of the proposed algorithm, we also provide a means of provisioning wavelength channels and converters in optical packet/burst switching systems.
Nail Akar, Ezhan Karasan, Kaan Dogan
IEEE J. Sel. Areas Commun.3