Cart (Loading....) | Create Account
Close category search window
 

Load balanced distributed schedulers for WASPNET Optical packet switches maintaining packet order

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)

Previously the author's (Lopez-Bravo et al., 2007) proposed the Load Balanced WASPNET Scheduler (LBWS), a novel scheduling approach for WASPNET optical packet switching (OPS) nodes. Unlike the original WASPNET description, LBWS is fully distributed and its computational cost is independent from switch size. Since it predicts packet delays at packet ingress based on a deterministic evolution of the switch configuration, it is not necessary to emulate RAM memories. However, LBWS does not maintain the packet sequence. In this paper we present the LBWS algorithm with packet ordering (OLBWS), the first step to prevent mis-sequencing in a LBWS scheduler. We show that despite the algorithm simplicity a reasonable throughput can be achieved.

Published in:

ICTON Mediterranean Winter Conference, 2007. ICTON-MW 2007

Date of Conference:

6-8 Dec. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.