This paper analyzes the connection availability of a protection paradigm, termed permanent dedicated path protection (PDPP),
in WDM mesh networks. Numerical results on COST239 European network show that P-DPP reduces the average
connection unavailability compared with the traditional dedicated path protection (DPP) at the cost of higher capacity
utilization.
An incremental capacity allocation with topology augmentation problem is investigated in this paper to maximize
the backup path provisioned services in WDM mesh networks. To tackle the optimal design problem, an
integer linear programming (ILP) formulation is presented. Numerical results show that all the services can be
provisioned a backup path with little number of new links added to the existing topology.
A post path calculation process considering the flexibility of rerouting backup paths is proposed in this paper to
achieve blocking-differentiated path provisioning for two classes of connection requests in semi-dynamic sharedpath-
protected optical networks. Numerical results show that with the proposed post routing process, the
blocking gap between two request classes is over 90% under all network load cases without increasing the overall
blocking probability.
Backup path reprovisioning and activation planning (RAP) scheme is investigated in survivable WDM mesh
networks providing shared path protection under scheduled traffic. Results show that over 70% dual-failure
restorability benefits are achieved when the RAP is applied.
Service differentiated survivable WDM mesh networks providing dedicated path protection and shared path
protection are investigated under scheduled traffic. Scheduled routing with holding-time aware and unaware
are studied for comparison. To tackle the service provisioning problem, an integer linear programming(ILP)
formulation is presented for either situation to find the optimal service provisioning solution for a given set of
traffic demands. Numerical results show that over 48% capacity savings are achieved when the holding-time
knowledge is exploited.
Performance of a resource-efficient provisioning framework (RPF) is evaluated in this paper in wavelength-continuous optical networks under static traffic. The structure of the survivable routing problem is unraveled by an integer linear programming (ILP) model. Numerical results from direct ILP approaches show that the RPF still achieves more than 10% capacity savings over the traditional provisioning framework when subject to the wavelength-continuity constraint. Next, Resource-Efficient Two-stEp Routing subject to Wavelength-ConTinuity constraint (RETER-WCT) algorithm is developed to overcome the drawback of the ILP approach.
Capacity allocation(CA) problem modelled by a new method for time-varying traffic is formulated and solved.
An upper bound of the capacity saving is given by theoretical analysis. The numerical results show that approximately
25% of the total required capacity can be saved which corresponds to the theoretical analysis.
A differentiated survivable service provisioning (DSSP) framework is investigated in this paper for optical networks
providing dedicated path protection (DPP) and shared path protection (SPP) services. To tackle the service provisioning
problem under the framework, spare capacity allocation (SCA) problem is studied first. The structure of the problem is
captured by a set of matrices. Then, based on the matrix model, a path-flow integer linear programming (ILP)
formulation is presented to find the optimal service provisioning solution for a given set of traffic demands. The
objective is to minimize total capacities consumed by working and backup paths of all demands. Furthermore, network
performance under the dynamic DSSP framework is illustrated in terms of blocking probability, resource overbuild and
average hop distance.
Considering the economic and technical aspects of wavelength converters, full wavelength conversion capability will not be available throughout optical networks in the foreseeable future. This letter investigates the wavelength assignment problem in wavelength-continuous optical burst switching (OBS) networks. First, we develop a novel static approach, termed balanced static wavelength assignment (BSWA), which outperforms all other static strategies, and achieves almost the same performance as dynamic strategies with the advantage that no extra dynamic information is needed. Then, we apply BSWA to a dynamic approach to accelerate network convergence and reduce the initial burst loss. Numerical results show that our approaches make significant improvements in the burst loss probability in OBS networks.
Constraint-based wavelength routing comes with the cost of higher blocking probability to provide Quality of Service (QoS) guarantee in Service-guaranteed optical networks; thus a load balancing method is presented in this paper to improve the performance of constraint-based wavelength routing. Also the Modified Backward-Forward heuristic (MBFH) is proposed, which can be utilized to select an optimal lightpath with one constraint. Simulation results show that with the application of load balancing method, constraint-based wavelength routing based on the MBFH can achieve better performances in terms of blocking probability and resource utilization ability.
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.