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

Scheduling Algorithms in LiTPiC - Digital Optical Networks Using Light-Trails and Photonic Integrated Circuits

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gumaste, A. ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Somani, A.

LiTPiCs were proposed as a marriage of two innovative technologies - light-trails and photonic integrated circuits - as a solution to extend metro networks in regional domains and provide dynamism in bandwidth allocation for emerging services. Light-trails which are a generalized lightpath, essentially formed by an optical bus provide sub-wavelength optical grooming and facilitate dynamic bandwidth allocation amongst constituent nodes. Communication within a light-trail is all-optical thereby limiting their reach to a few node-spans. In parallel, photonic integrated circuits were developed that proposed the system on a chip concept enabling 3R regeneration of optical signal using embedded lasers and receivers on a single Indium Phosphide substrate. PIC technology has given rise to the concept of digital optical networks which have the capability to increase reach and commoditize metro networks. By conjoining the light-trail and PIC technologies we proposed LiTPiC which is essentially preserves light-trail properties while enhancing their reach. In this paper we study algorithms for scheduling traffic in a LiTPiC. We consider both the static case and the dynamic case - when traffic is known and not known apriori. Further we will establish a lower and upper bound that would facilitate an evaluation procedure of our algorithms.

Published in:

Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE

Date of Conference:

Nov. 30 2009-Dec. 4 2009

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.