Efficient Scheduling for Heterogeneous Fractional Lambda Switching Networks

Truong, Thu-Huong and Baldi, Mario and Ofek, Yoram (2007) Efficient Scheduling for Heterogeneous Fractional Lambda Switching Networks. UNSPECIFIED. (Unpublished)

[img]
Preview
 PDF
Download (733Kb) | Preview

    Abstract

    Efficient scheduling for heterogeneous fractional lambda switching (FLS) networks is required but challenging. A heterogeneous network implies bandwidth mismatch between links of varied bit rates. Moreover, when non-immediate forwarding (NIF) is used in FLS, it increases the scheduling complexity exponentially, while decreasing the blocking probability. Thus, NIF scheduling presents a serious challenge for an algorithm to be used in a large heterogeneous FLS network. In this paper, an efficient scheduling algorithm that is combined with a flexible forwarding scheme is presented. The algorithm provides a full scheduling solution for an end-to-end request in heterogeneous FλS networks. Furthermore, the algorithm has linear complexity in single-channel networks and quadratic complexity in multiple-channel WDM networks.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: scheduling, search algorithms, fractional lambda switching, pipeline forwarding, optical networks
    Report Number: DIT-07-011
    Repository staff approval on: 10 Apr 2007

    Actions (login required)

    		 View Item