COMPUTER NETWORKS RESEARCH LAB

Department of Electrical and Computer Engineering, McGill University

NAVIGATION Home People Photos     RESEARCH Projects Publications     LINKS AAPN MITACS McGill TSP McGill ECE     LOCAL ACCESS Local Info

Project Descriptions Return to AAPN Projects Bandwidth Allocation in Agile All-Photonic Networks   Student: Nahid Saberi, Ph.D. Student Supervisor: Prof. Mark Coates Abstract: Click here Paper: Click here Research Problem: Design the bandwidth control algorithm of the AAPN core switch Algorithm must allocate switch bandwidth to source-destination pairs to match the traffic demand Attempt to ensure fair and efficient allocation Potential approaches: burst switching or fixed time-slot switching Time Slot Reservation Approach Long-term bandwidth requests allocated using Synchronous Time-Division Multiplexing (STDM) reduces the complexity of the scheduling algorithm gives priority to existing connections Use fixed-length frames and process requests for bandwidth adjustments upon arrival Strive to minimize the probability of demand rejection Scheduling algorithm evaluates a reward function on the space of all possible assignments for each request Assigns the slot that maximizes the reward associated with the remaining requests Bandwidth Allocation A single star network including 4 nodes and 2 wavelengths Each node incorporates two individual transmitter and receivers Two available wavelengths, and A New Request: From Source 1 to Destination 3, (S1,D3 ) = 1 time slot The scheduling algorithm must assess whether allocation is possible, whether it is fair, and then determine the optimal allocation.