Optical packet assembly algorithms considering switching time

Junjie Yang; Jie Li

doi:10.1117/12.743122

19 November 2007 Optical packet assembly algorithms considering switching time

Junjie Yang, Jie Li

Proceedings Volume 6784, Network Architectures, Management, and Applications V; 67843F (2007) https://doi.org/10.1117/12.743122
Event: Asia-Pacific Optical Communications, 2007, Wuhan, China

Abstract

Optical packet assembly algorithms have great effects on the performances of optical packet switching network. When the granularity of an optical packet is almost the same as the switching time of an optical switch, optical packet assembly algorithms have to be modified. For this purpose, in this paper, two improved assembly algorithms, i.e., Threshold- Based-ST and Timer-Based-ST are proposed. The performances of the optical packet switch are evaluated by simulation experiments.

Citation Download Citation

Junjie Yang and Jie Li "Optical packet assembly algorithms considering switching time", Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67843F (19 November 2007); https://doi.org/10.1117/12.743122

ACCESS THE FULL ARTICLE

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