This paper describes the Task Scheduling problem over Ethernet Virtual Connections which provides multiple-granularity
and the problem of scheduling tasks over two user network interfaces is considered. Three approximate
models, 2SP, 2LSP and BWS are proposed with algorithms respectively. Numerical simulation results and comparisons
are also presented.
This paper introduces a novel notion of multi-granularity and multi-connectivity circuit
switched network. Based on this notion, four routing schemes - Fixed Routing (FR), Maximum
Remain (MR), Secured Maximum Remain (SMR) and Premium/Punishment Modification (PPM)
are proposed. Numerical simulation results about the performance of these four schemes are also
presented in this paper.
Because SONET/SDH technology which includes contiguous concatenation and virtual concatenation is used in
GMPLS-Controlled Multi-services Transport Platform (MSTP) Network, it is more complex when we consider the label
assignment when setting up a Label Switch Path (LSP). It is very imperative to use a method which could use the
limited labels effectively. In this paper, we study the structure of the label space and different label algorithm to allocate
SONET/SDH labels, which include virtual concatenation labels and contiguous concatenation labels in GMPLS-Controlled
MSTP Network. We proposed a minimum Contiguous Labels Algorithm (min-CLA) to solve the problem of
using the limited label space on each interface at the most degree. Different from the previous schemes worked on
Route Wavelength Assignment (RWA) in the Wavelength-Division-Multiplex (WDM) networks, our scheme finds out
the primary and easy method based on SONET/SDH label which has virtual concatenation labels and contiguous
concatenation labels used for different kinds of needs. Because of taking the multiple services requirements into
account, the proposed algorithm finds out more efficient feasible solution requiring less network resources and even find
a feasible solution which will enable some label assignment failed in other label assignment algorithm and we will
compare our scheme and the Fist Fit Scheme.
Because any link failure on the multicast session may disrupt the signal transmission to several downstream nodes, it is imperative to effectively protect the multicast sessions against link failure. In this paper, we study schemes for establishing primary and backup multicast trees for multicast sessions in a optical mesh network against link failure, e.g., fiber or conduit cut, with taking the different leaf availability requirement and availability guarantee into account. We propose an Mixed Integer Linear Program (MILP) approach to solve the problem of provisioning survivable multicast sessions with differentiated leaf availability guaranteed. Different from the previous schemes, our scheme finds out the complete (the tree spans the root and all the leaf nodes) primary and complete or incomplete (the tree spans the root and part of the leaf nodes) backup trees for multicast sessions guarantees the availability requirement. Because of taking the different leaf availability requirements into ccount, the proposed algorithm finds out more efficient feasible solution requiring less network resources, and even find a feasible solution where the previous algorithms fail.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.