cut saturation for p cycle design l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Cut Saturation for p -cycle Design PowerPoint Presentation
Download Presentation
Cut Saturation for p -cycle Design

Loading in 2 Seconds...

play fullscreen
1 / 24

Cut Saturation for p -cycle Design - PowerPoint PPT Presentation


  • 109 Views
  • Uploaded on

Cut Saturation for p -cycle Design. Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer Science & Computer Engineering (CSCE) University of Arkansas. Ring vs. Mesh. Two Enemies of Fiber.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Cut Saturation for p -cycle Design' - love


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
cut saturation for p cycle design

Cut Saturation for p-cycle Design

Khalid Al-Snaie

Electronics Dept., College of Technology

Riyadh, Saudi Arabia

Dale R. Thompson*

Department of Computer Science & Computer Engineering (CSCE)

University of Arkansas

wavelength path 1
Wavelength Path #1

S1

D1

2

S2

D3

1

D2

S3

1

wavelength path 2
Wavelength Path #2

S1

D1

2

S2

D3

1

D2

S3

2

slide10

Virtual Wavelength Path (VWP)

S1

D1

2

S2

D3

1

D2

S3

2

scp vs jcp in p cycles
SCP vs JCP in p-cycles
  • Spare capacity placement (SCP)
    • Route demand using shortest paths
    • Apply capacity algorithm to find set of p-cycles that minimize spare capacity cost
  • Joint capacity placement (JCP)
    • Apply capacity algorithm to find working routes and set of p-cycles that minimize spare capacity cost.
p cycle cut saturation pcut
p-cycle Cut Saturation (PCUT)

Load topology and traffic demand.

do {

Route traffic with JCP or with shortest path

algorithm if using SCP.

Sort spans by load in descending order.

Remove spans one at a time until the network

separates into two disconnected components N1 and N2.

Add a new span between one of the lowest degree nodes in N1

and one of the lowest degree nodes in N2.

Replace deleted spans.

Find p-cycles with SCP or JCP.

Calculate spare-to-working capacity ratio.

} while (spare-to-working capacity ratio is greater than a threshold)

contact information
Contact Information

Dale R. Thompson, P.E., Ph.D.

Department of Computer Science and Computer Engineering

University of Arkansas

311 Engineering Hall

Fayetteville, Arkansas 72701

Phone: +1 (479) 575-5090

FAX: +1 (479) 575-5339

E-mail: d.r.thompson@ieee.org

WWW: http://csce.uark.edu/~drt/