Ms. Dieu Linh T. Truong Profile

Dieu Linh T. Truong

at Univ McGill

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 28 September 2006 Paper

Overlapped segment shared protection in multi-domain networks

D. Truong, B. Jaumard

Proceedings Volume 6354, 63541K (2006) https://doi.org/10.1117/12.691764

KEYWORDS: Optical networks, Head, Surface plasmons, Computer science, Scientific research, Systems engineering, Network architectures, Chromium

Read Abstract +

Segment protection is an intermediate protection scheme between path and link protection. The major advantage of segment protection comes from its limited rerouting scope. It then leads to faster recovery over path protection and greater resource utilization efficiency over link protection. Overlapped Segment Shared Protection allows a protection of all nodes and links in addition to bandwidth savings. Routing for Overlapped Segment Shared Protection consists of finding, for each user request, a working path and a set of backup segments to protect it while minimizing the total required bandwidth. The problem in multi-domain optical mesh networks has not received a lot of interest so far although it is more difficult than in single-domain network. The main difficulty lies in the lack of the complete and global knowledge of the network topology as well as the bandwidth allocation meanwhile this knowledge are assumed to be easily available in single-domain networks. To overcome this difficulty, we propose a two-step routing heuristic using aggregate routing information. In the first step, a rough routing solution is sketched out on a compact virtual network which relies on an aggregate topology of the multi-domain network. Then the routing is refined within the different domains using the original domain networks. The comparison of the proposed heuristic with the optimal single-domain solution1 shows that our heuristic leads to resource efficient solutions that are close to the optimal ones while it requires a quite small computational effort. We also find that long overlapping does not necessarily leads to waste of resources and more segments in comparison with short overlapping.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

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.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years