Dynamic bandwidth-allocation and path-restoration in SONETself-healing networks

This paper presents a new scheme for real-time bandwidth allocation and path restoration (BARS) in mesh networks via SONET wideband digital cross-connect systems (WDCSs) in response to demand and load dynamics and link and/or node failure(s). The scheme dynamically maximizes bandwidth allocation while ensuring full service restorability. Since the physical network capacity is limited, sometime not all the demand can be accommodated under the full restorability requirement. This demand in SONET BARS is rejected fairly at the network boundary even if capacity for allocation is available. Bandwidth allocation and fair demand admission are optimized jointly under the full restorability requirements. The implementation of SONET WDCS does not need excessive storage. An efficient parallel algorithm for solving the optimization problem is also presented. The algorithm produces superior spare capacity assignments compared to the results in the literature     

Performance comparison of OBS and SONET in metropolitan ring networks

This paper explores the feasibility of deploying optical burst switching (OBS) in metropolitan area networks (MANs) as an alternative to synchronous optical network (SONET), over wavelength-division multiplexing. We present a comparison between two OBS architectures (with centralized and distributed scheduling schemes), SONET, and next-generation SONET (NG-SONET), respectively. We quantify some of the performance metrics such as end-to-end delay and loss rate when supporting Ethernet traffic in metro ring networks. Our simulation results show that OBS offers significant performance improvement over SONET and NG-SONET. In general, the OBS architecture with distributed scheduling has a superior delay performance, whereas the OBS architecture with centralized scheduling has a better loss metric.     

Virtual fully connected WDM network: A high-performance single-hop architecture for metropolitan area networks

With the widespread use of broadband access technologies and the development of high-speed Internet backbones, the requirement for high-performance metropolitan area networks (MANs) is increasing. Traditional ring- or star-based metro networks are costly to scale up to high speed and cannot recover from multiple failures, while backbone solutions are too expensive to fit into the cost-sensitive metro market. This paper proposes a virtual fully connected (VFC) architecture for metro networks to provide high-performance node-to-node all-optical transportation. The architecture emulates a fully connected network by providing optical channels between node pairs without intermediate buffering, and thus realizes single-hop transportation and avoids expensive packet routers. In addition, a scheduling algorithm is developed for medium access control and dynamic bandwidth allocation, which achieves 100% throughput and provides a fairness guarantee. Simulations show that the VFC network achieves good performance under both uniform and non-uniform loads.     

工作容量约束下光网络p圈空闲容量分配算法

基于网状光网络p圈保护算法,研究了常见简单p圈和空闲容量分配的常见问题,介绍了光网络中局部图概念,针对如何在光网络拓扑中优化配置p圈,提出获得更多性能优良圈的局部图扩展算法和工作容量约束下启发式p圈空闲容量分配算法。通过计算机仿真表明,该算法在考虑工作容量的分布情况下,既实现快速空闲容量配置又保证保护效能高。该算法性能优于基于空闲容量的启发式p圈分配算法,适合在给定空闲容量分布情况下的网状光网络高保护效能p圈的配置。     

Wavelength reuse for efficient packet-switched transport in an AWG-based metro WDM network

Metro wavelength-division multiplexed (WDM) networks play an important role in the emerging Internet hierarchy; they interconnect the backbone WDM networks and the local-access networks. The current circuit-switched SONET/synchronous digital hierarchy (SDH)-over-WDM-ring metro networks are expected to become a serious bottleneck-the so-called metro gap-as they are faced with an increasing amount of bursty packet data traffic and quickly increasing bandwidths in the backbone networks and access networks. Innovative metro WDM networks that are highly efficient and able to handle variable-size packets are needed to alleviate the metro gap. In this paper, we study an arrayed-waveguide grating (AWG)-based single-hop WDM metro network. We analyze the photonic switching of variable-size packets with spatial wavelength reuse. We derive computationally efficient and accurate expressions for the network throughput and delay. Our extensive numerical investigations-based on our analytical results and simulations-reveal that spatial wavelength reuse is crucial for efficient photonic packet switching. In typical scenarios, spatial wavelength reuse increases the throughput by 60% while reducing the delay by 40%. Also, the throughput of our AWG-based network with spatial wavelength reuse is roughly 70% larger than the throughput of a comparable single-hop WDM network based on a passive star coupler (PSC).     

Metropolitan area optical networks

Presented the requirements, architectures, and performance of optical MANs. We outlined our considerations about the evolution of metro area networks from SONET rings to transparent WDM rings. We also described the major transport impairments that the network designer should account for in transparent WDM MANs. A properly engineered network utilizing application-optimized components and fiber will enable the buildup of cost-effective metro/regional WDM optical networks that satisfy all the requirements and demands.     

Effective wavelength assignment algorithms for optimizing designcosts in SONET/WDM rings

In high-speed wavelength-division-multiplexed synchronous optical network (SONET) ring networks, the terminal equipment costs associated with electronic multiplexing can be predominantly high. Placing a wavelength add-drop multiplexer (WADM) at each network node allows certain wavelengths to optically bypass the node without being electronically terminated. This approach can effectively reduce the total equipment cost if connections and channels are appropriately assigned in traffic grooming. In this paper, we present a series of wavelength optimization and wavelength assignment algorithms with the objective to optimize the number of required SONET add-drop multiplexers and yet minimizes the number of wavelengths in both unidirectional and bidirectional rings under an arbitrary grooming factor. In our analysis, we have considered both uniform and general nonuniform all-to-all network traffic. As a simple model for realistic traffic patterns, a special case of nonuniform traffic, distance-dependent traffic, is analyzed in detail. Significant ADM savings are observed for different traffic scenarios using our proposed algorithms     

基于最大流的无线mesh网络负载均衡信道分配算法

针对无线mesh网络中各信道间的干扰情况及流量负载均衡问题,定义了负载均衡的目标优化函数,设计一种基于最大流的负载均衡信道分配算法。该算法优先考虑为负载量比较大的链路分配更多的带宽,使得一些关键链路能够承受较大的流量负载,实现各信道的负载均衡,减少网络拥塞,降低分组丢失率和延迟。实验结果表明,该算法较好地平衡了网络负载,在网络业务较重的情况下还能获得较好的网络性能。     

A Lagrangian-Relaxation Based Network Profit Optimization For Mesh SONET-Over-WDM Networks

In Wavelength Division Multiplexing (WDM) networks, the huge capacity of wavelength channels is generally much larger than the bandwidth requirement of individual traffic streams from network users. Traffic grooming techniques aggregate low-bandwidth traffic streams onto high-bandwidth wavelength channels. In this paper, we study the optimization problem of grooming the static traffic in mesh Synchronous Optical Network (SONET) over WDM networks. The problem is formulated as a constrained integer linear programming problem and an innovative optimization objective is developed as network profit optimization. The routing cost in the SONET and WDM layers as well as the revenue generated by accepting SONET traffic demands are modelled. Through the optimization process, SONET traffic demands will be selectively accepted based on the profit (i.e., the excess of revenue over network cost) they generate. Consiering the complexity of the network optimization problem, a decomposition approach using Lagrangian relaxation is proposed. The overall relaxed dual problem is decomposed into routing and wavelength assignment and SONET traffic routing sub-problems. The subgradient approach is used to optimize the derived dual function by updating the Lagrange multipliers. To generate a feasible network routing scheme, a heuristic algorithm is proposed based on the dual solution. A systematic approach to obtain theoretical performance bounds is presented for an arbitrary topology mesh network. This is the first time that such theoretical performance bounds are obtained for SONET traffic grooming in mesh topology networks. The optimization results of sample networks indicate that the roposed algorithm achieves good sub-optimal solutions. Finally, the influence of various network parameters is studied.     

SONET ring applications for survivable fiber loop networks

Synchronous optical network (SONET) self-healing rings (SHR) are studied in the loop environment. SONET SHR architectures for loop feeder networks are discussed, focusing on three possible dual central office (CO) architectures for fiber loop networks, using SONET SHRs to reduce network costs and provide network service survivability. These architectures reflect an integrated planning concept for SONET networks that eliminates the boundary between the access network and the inter-office network. It is shown that the use of SONET SHRs makes it easy to evolve to a protected dual CO access architecture. Economic and survivability studies are discussed. The economic studies show that using the ring approach yields significant advantages over the traditional diverse protection approach in terms of cost and survivability, especially for the dual CO architectures     

Simple Pre-Provisioning Scheme to Enable Fast Restoration

Supporting fast restoration for general mesh topologies with minimal network over-build is a technically challenging problem. Traditionally, ring-based SONET networks have offered close to 50 ms restoration at the cost of requiring 100% over-build. Recently, fast (local) reroute has gained momentum in the context of MPLS networks. Fast reroute, when combined with pre-provisioning of protection capacities and bypass tunnels, enables faster restoration times in mesh networks. Pre-provisioning has the additional advantage of greatly simplifying network routing and signaling. Thus, even for protected connections, online routing can now be oblivious to the offered protection, and may only involve single shortest path computations. In this paper, we are interested in the problem of reserving the least amount of the network capacity for protection, while guaranteeing fast (local) reroute-based restoration for all the supported connections. We show that the problem is NP-complete, and we present efficient approximation algorithms for the problem. The solution output by our algorithms is guaranteed to use at most twice the protection capacity, compared to any optimal solution. These guarantees are provided even when the protection is for multiple link failures. In addition, the total amount of protection capacity reserved by these algorithms is just a small fraction of the amount reserved by existing ring-based schemes (e.g., SONET), especially on dense networks. The presented algorithms are computationally efficient, and can even be implemented on the network elements. Our simulation, on some standard core networks, show that our algorithms work well in practice as well     

SDH以太共享环在城域网的应用

随着因特网和数据业务的爆炸性增长，城域网的主要业务正在从话音向数据转移。然而过去的城域传送网是为话音业务设计的，所以采用的是TDMM网络(SDH、SONET)。本首先介绍了基于SDH网络传送数据业务的几种新技术，如：POS、GFP、LCAS、RPR、共享以太环等，以及可以实现业务隔离、保证安全的VLAN、VLAN嵌套技术，然后对各种城域网数据传输技术进行了比较，最后分新了薪一代的MSTP设各府该具有的几个特点。     

Effective Traffic Grooming Algorithms in SONET/WDM Ring Networks

Much work has focused on traffic grooming in SONET/WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, considering different traffic models, using different network architectures, incorporating switching capability and so on. In this work, we study traffic grooming in unidirectional ring networks with no switching capability under both uniform traffic and non-uniform traffic models to reduce electronic multiplexing costs. Based on the clustering notion, we derive a general and tighter lower bound for the number of ADMs required in traffic grooming under the uniform all-to-all traffic model. This bound reduces to special cases obtained in previous work. We also derive general, tighter, and closed form lower bounds for the number of ADMs required under two non-uniform traffic models: the distance-dependent traffic model and the non-uniform symmetric traffic model. Cost-effective multi-phase algorithms that exploit traffic characteristics are then designed and studied to efficiently groom traffic streams under different traffic models. Our numerical and simulation results show that the proposed multi-phase algorithms outperform existing traffic grooming algorithms by using a fewer number of ADMs. Our algorithms in several cases also achieve the lower bounds derived.     

WDM网状网中基于共享风险链路组限制的业务量疏导算法

该文研究了业务量疏导WDM网状网中如何建立可靠的业务连接问题,提出一种新的基于共享风险链路组(SRLG)限制的共享通路保护算法。该算法既可以保证用户业务不同的可靠性要求,同时又能够有效提高全网的资源利用率,从而大大降低全网的业务阻塞率。该文还对所提算法进行了仿真研究,并给出了仿真结果。     

Layer 1 Virtual Private Networks in Multidomain Next-Generation Networks

High-capacity e-science and consumer applications require transport networks that are dynamically provisioned. Rapid advances in next-generation SONET/SPH and optical switching along with GMPLS control have enabled many new services' provisioning capabilities. In particular, a key paradigm is the new layer 1 virtual private network framework, which allows clients to directly provision their own services without deploying expensive infrastructures. This article presents an overview of L1-VPN and describes a resource management scheme that will enable transport network virtualization across a multidomain network infrastructure. The scheme is implemented in both centralized and distributed control frameworks, and allows for dynamic sharing of transport resources. A case study of performance analysis results is presented showing a distributed control plane in a multidomain network architecture achieving higher VPN carrying capacity than a centralized control plane     

Fiber network survivability

At the transport layer in interoffice and interexchange networks, shared protection rings (SPRINGS) interconnected at matched nodes can provide 100% restoration in milliseconds after cable cuts and central office failures. The author introduces the SPRING and explains how its capacity advantage over other ring configurations enables it to be the most economical solution in more applications. Transport restoration technologies-1+1 diversity, digital crossconnect systems, and SPRINGS-in interoffice and interexchange environments are compared. A representative network study is presented to justify the choice of SPRINGs and matched nodes for the target architecture. Recommendations on how to evolve today's asynchronous networks in preparation for a fully survivable SONET ring-based network are also provided. Generic ring planning guidelines and network examples are presented to demonstrate how today's networks can be evolved to provide end-to-end survivable SONET transport. An approach to ring-based network design that simplifies the planning process and minimizes network cost is provided     

Convergence of Protection and Restoration in Telecommunication Networks

This paper argues for the need for convergence of protection and restoration schemes in today's telecommunication networks. Such networks are presented both in a layered context and from an end-to-end perspective. Such convergence is both necessary to ensure inter-working amongst a multitude of technologies deployed and desirable to ensure simplified operations. This paper further identifies the issues and inter-working items that need resolution in today's telecommunication and data networks in order to achieve inter working amongst various existing and emerging restoration and protection schemes in a layered and end-to-end context. End-to-end context covers the access, metro, and long haul dimensions of the network. It also encompasses both the services and the transport layers of the network in the context of multi-domain, multi service provider networks. Layering issues arise from the mix of technologies at several layers for example: optical transmission and CWDM/DWDM at physical layer, SONET/SDH framing and management at layer-1, ATM, MPLS, Ethernet, and resilient packet rings at layer-2, and finally IP and routing protocols at layer-3. Given that some degree of routing and signaling intelligence is migrating down to the optical layer equipment, this whole layering concept is currently in transition. This paper shows the need for convergence in the form of a two level protection and restoration scheme. A service independent layer and a mesh restoration capability at the routing layer.     

A passive protected self-healing mesh network architecture andapplications

The self-healing mesh network architecture using digital cross-connect systems (DCSs) is a crucial part of an integrated network restoration system. The conventional DCS self-healing networks using logical channel protection may require a large amount of spare capacity for network components (such as DCSs) and may not restore services fast enough (e.g., within 2 s). The authors propose a passive protected DCS self-healing network (PPDSHN) architecture using a passive protection cross-connect network for network protection. For the PPDSHN architecture, network restoration is performed in the optical domain and is controlled by electronic working DCS systems. Some case studies have suggested that the proposed PPDSHN architecture may restore services within a two-second objective with less equipment cost than the conventional DCS self-healing network architecture in high-demand metropolitan areas for local exchange carrier networks. The proposed PPDSHN architecture may apply to not only the centralized and distributed control DCS network architectures, but also asynchronous, SONET and ATM DCS networks. Transparency of line rates and transmission formats makes the PPDSHN network even more attractive when network evolution is a key concern of network planning     

Load-balancing in MANET shortest-path routing protocols

Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability.     

下一代网络中基于遗传算法的QoS组播路由算法

向用户提供多媒体业务是下一代网络业务最基本、最重要的要求,QoS组播路由技术是网络多媒体信息传输的核心技术之一。该文给出了支持QoS组播的网络模型,对已有的QoS组播路由算法进行了优化,提出了适用于下一代网络的基于遗传算法的QoS组播路由算法。仿真实验表明,这种算法收敛速度快,可靠性高,能够很好地满足下一代网络QoS组播的需求。