Mr. Bartlomiej Klusek Profile

Bartlomiej Klusek

at Dublin City Univ

SPIE Involvement:

Author

Publications (2)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 3 June 2005 Paper

Traffic sources for optical burst switching network simulations

Bartlomiej Klusek, John Murphy, Liam Barry

Proceedings Volume 5825, (2005) https://doi.org/10.1117/12.605049

KEYWORDS: Switching, Optical networks, Computer simulations, Analytical research, Optical simulations, Internet, Electronics engineering, Computer science, Integrated optics, Optical switching

Read Abstract +

Optical Burst Switching (OBS) is a new paradigm for future all-optical networks. OBS networks are difficult to investigate analytically, so most of the current research is based on simulations. This has created a need for accurate traffic sources. In this paper, we present an overview of different traffic sources and make a distinction between simulating burst assembly and generating bursts (where no information about burst contents is carried). The following types of sources are discussed: emulating assembled traffic using exponentially distributed burst length and interarrival time, emulating assembled traffic with burst length and interarrival time distributions and burst assembly simulation with LRD input traffic. We discuss advantages and disadvantages of each approach, mainly in respect to its efficiency. For example, simulating burst assembly with LRD input traffic, while considered perfect in terms of quality of produced traffic, is also the least effective and requires long simulation times. We show the area of applicability of each type of traffic generator, comparing it to a small number of burst assemblers, or to highly aggregated OBS traffic. We also present two new types of traffic sources: one that can generate traffic with LRD properties in a much more efficient way than full burst assembly simulation, and one that uses conditional burts length and interarrival time distributions. Finally, simulation results are presented to confirm our findings.

Proceedings Article | 11 February 2005 Paper

Cost-based wavelength allocation algorithms in optical burst switching networks

Bartlomiej Klusek, John Murphy, Philip Perry

Proceedings Volume 5625, (2005) https://doi.org/10.1117/12.576011

KEYWORDS: Switching, Computer simulations, Optical networks, Electronics engineering, Computer science, Internet, Integrated optics, Optical switching, Optical circuits, Packet switching

Read Abstract +

Optical Burst Switching (OBS) is a new paradigm for future all-optical networks. It has been noted that performance of an OBS node depends on the wavelength assignment algorithm that is used. In this paper we present a new class of wavelength allocation algorithms called cost-based algorithms. We note that bursts compete for more types of resources than wavelengths alone. For example if a given burst is to be allocated successfully, a Fiber Delay Line (FDL) or a wavelength converter may have to be used. It can be expected, however, that the set of available resources will be limited. If at a given time all the converters are used, then any arriving burst will have to be allocated on the same wavelength - if it is available. Similarly, the unavailability of FDLs will decrease the probability of a burst being accepted. In a cost-based algorithm, each resource is assigned a metric (or price). Channels are priced according to their suitability for a particular burst. When a control packet arrives at a core node, all the possible ways of handling the corresponding burst are found (the outgoing channel, with or without a FDL or wavelength converter), and the one with a lowest metric is chosen. To show how the performance of a cost-based algorithm compares to other algorithms we present the results of our simulations for a node with full conversion capability and a shared FDL.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years