getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

Sparsely Placement of Electronic Switching Nodes for Low Blocking in Translucent Optical Networks

Post a Comment
CONTRIBUTORS:
  Author Shen, Gangxiang (University of Alberta)
  Author Grover, Wayne D.
  Author Cheng, Tee Hiang
  Author Sanjay K. Bose
JOURNAL:
  OSA Journal of Optical Networking, 1(12), 424 - 441.
YEAR: 2002
PUB TYPE: Journal Article
SUBJECT(S): None
DISCIPLINE: Computer Science
HTTP: http://feynman.ee.ualberta.ca/~egxshen/pdf/Journal/JON-ES.pdf
LANGUAGE: English
PUB ID: 103-397-682 (Last edited on 2003/12/05 16:52:44 US/Mountain)
SPONSOR(S):
 
ABSTRACT:
We evaluate the performance of optical network designs using relatively few switch nodes at which wavelength conversion and electronic regeneration is possible. A simple heuristic for placing the fewest such nodes to reach a given blocking probability is based on the ranked frequency of shortest-path routes transiting each node. This strategy is found to be efficient in designing a “translucent” optical network with sparse electronic switch placement that performs very close in blocking to that of an “opaque” optical network. In addition, we apply a new 2-D Dijkstra’s algorithm for routing and wavelength assignment in the resultant translucent optical network. Simulation results indicate that a translucent optical network with sparse electronic switch placement based on the heuristic has much lower blocking than a fully transparent optical network when the constraint of the maximum transparent distance before regeneration is also considered. Moreover by placing the switches according to the heuristic, lightpath blocking can approach that of a fully opaque network with significantly fewer electronic switches in total. In our results, lightpath blocking as low as the fully opaque network case was obtained with electronic switches selectively placed at approximately 1 node in 3 on average. The heuristic also performs well against random searching for an effective subset of electronic switch nodes and performs better than a prior optimal method based on combinatorially exhaustive search, and which is limited to assuming fixed shortest path routing.
STATISTICS
Click on # to view
 Citations  
 References  
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/170 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2006 getCITED Inc. All Rights Reserved.