Dynamic Path Scheduling Through Extensions to Generalized Multiprotocol Label Switching (GMPLS)-Implementation & Demonstration

In current networks, service is initiated at the time of service request. Upon receipt of a service request, the network checks to determine if capacity is available to satisfy the needs of the service request. If sufficient capacity is available, service is initiated; if sufficient capacity is not available, the service request is rejected. This mode of operation introduces problems for some types of scientific users who require network service at a specific data rate at a specific future time and for a specific duration, for example, at the occurrence of some scientific phenomenon. This project will develop algorithms to perform path generation for scheduled service and will enhance Generalized Multiprotocol Label Switching (GMPLS) signaling and routing protocols to include time based service. In Phase I, new scheduling algorithms were formulated using min-plus algebra that will efficiently compute the time based schedule paths. GMPLS protocol enhancements to support scheduling were specified with respect to both the signaling and routing objects for all applicable GMPLS protocol messages. Phase II will develop a proof-of-concept prototype that will demonstrate these enhancements in a realistic hardware-software environment. The proposed modifications to the GMPLS protocols and the infrastructure will be standardized by working with telecommunications carriers and the standards community. Commercial Applications and Other Benefits as described by the awardee: A portable implementation of the protocols for the LINUX operating system should be of interest to both government and commercial network operators.