Heuristic Solution to Protect Communications in WDM Networks using P-cycles

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Optical WDM mesh networks are able to transport huge amount of information. The use of such technology however poses the problem of protection against failures such as fibre cuts. One of the principal methods for link protection used in optical WDM networks is pre-configured protection cycle (p-cycle). The major problem of this method of protection resides in finding the optimal set of p-cycles which protect the network for a given distribution of working capacity. Existing heuristics generate a large set of p-cycle candidates which are entirely independent of the network state, and from then the good sub-set of p-cycles which will protect the network is selected. In this paper, we propose a new algorithm of generation of p-cycles based on the incremental aggregation of the shortest cycles. Our generation of p-cycles depends on the state of the network. This enables us to choose an efficient set of p-cycles which will protect the network. The set of p-cycles that we generate is the final set which will protect the network, in other words our heuristic does not go through the additional step of p-cycle selection

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Heuristic Solution to Protect Communications in WDM Networks using P-cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Heuristic Solution to Protect Communications in WDM Networks using P-cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristic Solution to Protect Communications in WDM Networks using P-cycles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-210434

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.