Dear all,
You are cordially invited to attend the Work Completion Seminar for one of our Master of Computer Science candidates, Mr Andrew Tan Khin Huat. The details of the event are:
Date: 13 March 2009 (Friday)
Time: 9.00am - 10.00am
Venue: PD006, FICT, UTAR.
Speaker: Andrew Tan Khin Huat
Synopsis:
All-optical switching has been studied intensively in the literature to address the high cost of opto-electro-optical (OEO) conversion in traditional optical networks. However, most of the existing all-optical packet switching schemes assume optical packets must be of fixed size, and must also be perfectly aligned to the slot boundaries before switching. Such inflexibility has in turn become an obstacle to a realistic implementation of all-optical packet networks.
In this dissertation, we propose a model for all-optical switching that can efficiently process variable- and fixed-length packets. As the model adopts a time-slotted structure, it is called Variable-length-Packet Fixed-length-Slot (VPFS) Switching. We then study the theoretical requirements and constraints of VPFS. To resolve the contention issue in the VPFS model, we also propose a Variable-length-Packet Fiber-delay-line Assignment (VAPFA) Algorithm. We compare the VAPFA algorithm with other similar solutions by simulation to benchmark and determine its superiority. It is shown through simulation that VAPFA is capable of near 0 packet loss up to a data load of 0.8.
Through our research, we also found that most slot-based algorithms, including VAPFA assume perfect packet alignment in order to achieve good throughput. To relieve such a rigid constraint, we therefore propose a compromise scheme called Partial Alignment that can achieve higher throughput than non-aligned schemes, yet without incurring much detrimental effects to the scheme in general. Optimized with the switch architecture, the partial alignment scheme nearly achieves the results of full alignment in simulation.
No comments:
Post a Comment