Delay Analysis of All-Optical Packet-Switching Ring and Bus Communications Networks

We study the delay performance of all-optical packet communication networks configured as ring and bus topologies employing cross-connect switches (or wavelength routers). Under a cross-connect network implementation, a packet experiences no (or minimal) internal queueing delays. Thus, the network can be implemented by high speed all-optical components. We further assume a packet-switched network operation, such as that using a slotted ring or bus access methods. In this case, a packet's delay is known before it is fed into the network. This can be used to determine if a packet must be dropped (when its end-to-end delay requirement is not met) at the time it accesses the network. It also leads to better utilization of network capacity resources. We also derive the delay performance for networks under a store-and-forward network operation. We show these implementations to yield very close average end-to-end packet queueing delay performance. We note that a cross-connect network operation can yield a somewhat higher queueing delay variance levels. However, the mean queueing delay for all traffic flows are the same for a cross-connect network operation (under equal nodal traffic loading), while that in a store-and-forward network increases as the path length increases. For a ring network loaded by a uniform traffic matrix, the queueing delay incurred by 90% of the packets in a cross-connect network may be lower than that experienced in a store-and-forward network. We also study a store-and-forward network operation under a nodal round robin (fair queueing) scheduling policy. We show the variance performance of the packet queueing delay for such a network to be close to that exhibited by a cross-connect (all-optical) network.     

Efficient routing and wavelength assignment for reconfigurable WDMnetworks

Through the use of configurable wavelength-division-multiplexing (WDM) technology including tunable optical transceivers and frequency selective switches, next-generation WDM networks will allow multiple virtual topologies to be dynamically established on a given physical topology. For N node P port networks, we determine the number of wavelengths required to support all possible virtual topologies (PN lightpaths) on a bidirectional ring physical topology. We show that if shortest path routing is used, approximately N wavelengths are needed to map N lightpaths. We then present novel adaptive lightpath routing and wavelength assignment strategies that reduce the wavelength requirements to [(N/2)] working wavelengths per port for protected networks and [(N/3)] wavelengths in each direction per port for unprotected networks. We show that this reduced wavelength requirement is optimal in the sense that it is the minimum required to support the worst case logical topology. Furthermore, we prove that a significant number of logical topologies require this minimum number of wavelengths. We also develop joint routing and wavelength assignment strategies that not only minimize the number of wavelengths required to implement the worst case logical topologies but also reduce average wavelength requirements. Finally, methods for extending these routing and wavelength assignment results to general two-connected and three-connected physical topologies are presented     

Dynamic Routing and Wavelength Assignment in Survivable WDM Networks

Dense wavelength division multiplexing (DWDM) networks are very attractive candidates for next generation optical Internet and intelligent long-haul core networks. In this paper we consider DWDM networks with wavelength routing switches enabling the dynamic establishment of lightpaths between each pair of nodes. The dynamic routing and wavelength assignment (RWA) problem is studied in multifiber networks, assuming both protection strategies: dedicated and shared. We solve the two subproblems of RWA simultaneously, in a combined way using joint methods for the wavelength selection (WS) and wavelength routing (WR) tasks. For the WS problem in contrast to existing strategies we propose a new, network state based selection method, which tries to route the demand on each wavelength, and selects the best one according to different network metrics (such as available channels, wavelengths per fiber and network load). For the WR problem we propose several weight functions for using in routing algorithms (Dijkstra or Suurballe), adapting dynamically to the load of the links and to the length of the path. The combination of different wavelength selection and routing (WS&WR) methods enables wide configuration opportunities of our proposed algorithm allowing good adaptation to any network state. We also propose the extension of the RWA algorithm for dedicated and shared protection and a new method for applying shared protection in dynamic WDM environment. The detailed analysis of the strategies demonstrate that our RWA algorithm provides significantly better performance than previous methods in terms of blocking probability whether with or without protection methods.     

Lightpath routing for intelligent optical networks

An overview of current issues and challenges in lightpath routing for optical networks is given. An architecture is presented in which optical switches are deployed, usually in the core, to interconnect IP routers at the edges. Lightpath routing within this architecture follows the framework of generalized multiprotocol label switching. Our discussion pays particular attention to the aspects of optical routing that differ from routing in irrational IP networks. Such aspects include physical layer constraints, wavelength continuity, the decoupling of the control network topology from the data network topology, explicit routing with wavelength assignment, and diversity routing for fast protection. We also present an algorithmic framework for lightpath computation, highlighting the issue of wavelength continuity and the differences between lightpath computation and traditional IP route computation     

Design of Translucent Optical Networks: Partitioning and Restoration

We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected. A greedy heuristic partitioning algorithm is proposed for planar network topologies. We use section restoration for translucent networks where failed connections are rerouted within the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that fiber costs with section restoration are close to those with path restoration for mesh topologies used in this study. It is also shown that the number of transponders with the translucent network architecture is substantially reduced compared to opaque networks.     

Highly reliable wavelength‐reuse wavelength‐division multiplexing semipassive optical access network architecture with double cover area and high network capacity

We propose a wavelength‐reuse wavelength‐division multiplexing semipassive optical access network architecture with ring topology. Two access rings are controlled by one central office. The system capacity, as well as the network cover area, can be doubled with this proposal. When fiber failure occurs, the corresponding switches in remote nodes change to protection state to restore the network communication. Copyright © 2014 John Wiley & Sons, Ltd.     

All-Optical Wavelength-Bypassing Ring Communications Networks

We introduce an all-optical WDM packet communication network that performs wavelength bypassing at the routers. Packets that arrive at a wavelength (optical cross-connect) router at designated wavelengths are switched by the router without having their headers examined. Thus, the processing element of the router is bypassed by such packets. For packet traffic that uses wavelengths that do not bypass a switch, the headers of such packets are examined to determine if this switch is the destination for the flow. If latter is the case, the packet is removed. Otherwise, the packet is switched to a pre-determined output without incurring (network internal) queueing delays. We study a ring network with routers that employ such a WDM bypassing scheme. We present methods to construct wavelength graphs that define the bypassing pattern employed by the routers to guide the traffic flows distributed at each given wavelength. Performance is measured in terms of the network throughput and the average processing path length (i.e., the average number of switches not being bypassed). For a fixed total processing capacity, we show that a WDM bypassing ring network provides a higher throughput level than that exhibited by a non-bypassing ring network, using the same value of total link capacity. By using WDM bypassing, the average processing path length (and thus the packet latency) is reduced. We study a multitude of network loading configurations, corresponding to distinct traffic matrices and client-server scenarios. Higher throughput levels are obtained for network configurations driven by non-uniform traffic matrices. The demonstrated advantages of WDM bypassing methods shown here for WDM ring networks are also applicable to more general network topological layouts.     

一体化OADM/OXC节点降低串扰结构研究

提出并分析了一体化光分插复用 /光交叉连接 (OADM/OXC)的降低串扰节点结构。在波分复用 (WDM )光传送网络中 ,一体化节点可以同时完成对光通道的上下路与交叉连接功能。与传统结构节点相比 ,该结构中使用一组 1× 2和 2× 1光开关与小规模的光交叉连接阵列实现光通道的上下路与交叉连接。仿真结果证明 ,该结构中由于同频串扰造成的功率代价显著下降。     

Analysis and design of resilient multifiber wavelength-routedoptical transport networks

Wavelength-routed optical networks (WRONs) are attracting significant attention for future high-capacity transport applications. This paper studies resilient multifiber WRONs, investigating the influence on the network performance of the maximum number of wavelengths per fiber W restoration strategies, node functionality, and physical topology. Fiber requirements are analyzed for numerous network topologies both without and with link failure restoration, considering different optical cross-connect (OXC) configurations and terminal functionalities. An integer linear program (ILP) formulation is presented for the exact solution of the routing and wavelength allocation (RWA) problem, with minimal total number of fibers, F_T (W). Lower bounds on F_T(W) are discussed, and heuristic algorithms proposed. Three restoration strategies are considered and compared in terms of capacity requirement. Different network topologies are analyzed, to evaluate the influence of physical connectivity and network size on the restoration capacity. Network evolution in terms of growth in traffic demand is investigated to study the importance of wavelength conversion within the OXC's as a function of network size and connectivity, traffic demand, and wavelength multiplicity W     

Sequential capacity determination of subnetworks in network performance analysis

In the process of performance evaluation for a stochastic network whose links are subject to failure, subnetworks are repeatedly generated to reflect various states of the network, and the capacity of each subnetwork is to be determined upon generation. The capacity of a network is the maximum amount of flow which can be transmitted through the network. Although there are existing algorithms for network capacity computation, it would create a great number of repetitions to compute the capacity of each subnetwork anew upon generation in the process. This is true because subnetworks are generated by combining certain links to the current one, and hence each current subnetwork is embedded in those new subnetworks. Recently, a number of methods have been proposed in the context of searching a method which efficiently computes the capacity of subnetworks by utilizing the given information of minimal paths, and preferably without many repetitions in sequential computations. But, most of the methods still have drawbacks of either failing to give correct results in certain situations, or computing the capacity of each subnetwork anew whenever the subnetwork is generated. In this paper, we propose a method based on the concepts of signed minimal path, and unilateral link, as defined in the text. Our method not only computes the capacity of each subnetwork correctly, but also eliminates the repetitive steps in sequential computations, and thereby efficiently reduces the number of subnetworks to consider for capacity computation as well. Numerical examples are presented to illustrate the method. The drawbacks of other methods are also discussed with counter examples.     

Lightwave networks based on de Bruijn graphs

Proposes de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput and delay performance of any logical topology, the authors compute the throughput and delay performance of de Bruijn graphs for two different routing schemes and compare it with their bounds and the performance of shufflenets. For a given maximum nodal in- and out-degree and average number of hops between stations, a logical topology based on a de Bruijn graph can support a larger number of stations than a shufflenet and this number is close to the maximum that can be supported by any topology. The authors also propose de Bruijn graphs as good physical topologies for wavelength routing lightwave networks consisting of all-optical routing nodes interconnected by point-to-point fiber links. The worst-case loss experienced by a transmission is proportional to the maximum number of hops (diameter). For a given maximum nodal in- and out-degree and diameter, a physical topology based on a de Bruijn graph can support a large number of stations using a relatively small number of wavelengths     

Optical cross-connect system in broad-band networks: system conceptand demonstrators description

A network robust to future evolution in network topologies or transmission formats and bit rates, which would be achieved by introducing an all-optical transparent layer in the transport network hierarchy is considered. The transparency would permit use of physically common fiber lines and nodes for different transmission hierarchies and/or formats. A transparent network could be achieved by combining photonic switching with electronic switching technology in the network nodes. A combination of wavelength routing and space-division switching in the optical layer would increase the capacity, as well as the flexibility in a network, allowing routing with higher granularity within the optical layer. Two optical cross-connect demonstrators have been set up. One demonstrates protection switching and restoration of traffic in a future transport network, and the other demonstrates routing of subscriber signals to different service switches in a local exchange. Space switches, tunable lasers and filters are the key technologies used to obtain enhanced flexibility     

光网络中的波带交换技术

波分复用光网络已成为广域骨干网最可行的体系解决方案.波带交换(WBS)因其能减小光交叉连接器的端口数、控制复杂性和连接费用等,引起了广泛的关注.文章指出了WBS和传统波长路由的不同之处,对WBS的两种多粒度光交叉连接器结构进行了分析.文中还提出了基于WBS的各种方案和光路成组策略,讨论了WBS网络中的波带转换和故障恢复问题.     

Transmitting time‐critical data over heterogeneous subnetworks using standardized protocols

Current communication networks consist of subnetworks of different types. Therefore a common network protocol has to be used for the transmission of data in such a heterogeneous network. Since some time the requirement of mobility in communication networks is showing up. For that reason wireless networks are playing an increasing role as subnetworks. On the other hand there is the need for multiplexed transmission of time-critical and non time-critical (normal) data within a heterogeneous network. In this paper we discuss the problem of multiplexed transmission of time-critical and of non time-critical data over a wireless type subnetwork using a common standardized network protocol. Many of the available wireless subnetworks are of low or medium transmission speed and guarantee a fixed transmission bandwidth at the access point. We describe a mechanism to transmit time-critical data in such a type of subnetwork using a connectionless transport and a connectionless network protocol. The concurrent transmission of non time-critical data using a connection oriented transport and the same connectionless network protocol is assumed to be of lower priority; it is scheduled in a way to fill the remaining capacity, which has not been reserved for the transmission of time-critical data. In our discussion we concentrate on the standardized ISO/OSI protocools CLNP as connectionless network protocol, CLTP as connectionless transport protocol and TP4 as connection oriented transport protocol. We propose a header compression protocol and a fragmentation protocol for use on low bandwidth subnetworks. This revised version was published online in June 2006 with corrections to the Cover Date.     

Optimized partitioning of a wavelength distributed data interfacering network

A fiber optic ring network, such as fiber distributed data interface (FDDI), can be operated over multiple wavelengths on its existing fiber plant consisting of point-to-point fiber links. Using wavelength division multiplexing (WDM) technology, FDDI nodes can be partitioned to operate over multiple subnetworks, with each subnetwork operating independently on a different wavelength, and inter-subnetwork traffic forwarding performed by a bridge. For this multiwavelength version of FDDI, which we refer to as wavelength distributed data interface (WDDI), we examine the necessary upgrades to the architecture of a FDDI node, including its possibility to serve as a bridge. The main motivation behind this study is that, as network traffic scales beyond (the single-wavelength) FDDI's information-carrying capacity, its multiwavelength version, WDDI, can gracefully accommodate such traffic growth. A number of design choices exist in constructing a good WDDI network. Specifically, we investigate algorithms using which, based on prevailing traffic conditions, partitioning of nodes into subnetworks can be performed in an optimized fashion. Our algorithms partition the nodes into subrings, such that the total traffic flow in the network and/or the network-wide average packet delay is minimized     

An analysis of oblivious and adaptive routing in optical networkswith wavelength translation

We present an analysis for both oblivious and adaptive routing in regular, all-optical networks with wavelength translation. Our approach is simple, computationally inexpensive, accurate for both low and high network loads, and the first to analyze adaptive routing with wavelength translation in wavelength division multiplexed (WDM) networks while also providing a simpler formulation of oblivious routing with wavelength translation. Unlike some previous analyses which use the link independence blocking assumption and the call dropping (loss) model (where blocked calls are cleared), we account for the dependence between the acquisition of wavelengths on successive links of a session's path and use a lossless model (where blocked calls are retried at a later time). We show that the throughput per wavelength increases superlinearly (as expected) as we increase the number of wavelengths per link, due both to additional capacity and more efficient use of this capacity; however, the extent of this superlinear increase in throughput saturates rather quickly to a linear increase. We also examine the effect that adaptive routing can have on performance. The analytical methodology that we develop can be applied to any vertex and edge symmetric topology, and with modifications, to any vertex symmetric (but not necessarily edge symmetric) topology. We find that, for the topologies we examine, providing at most one alternate link at every hop gives a per wavelength throughput that is close to that achieved by oblivious routing with twice the number of wavelengths per link. This suggests some interesting possibilities for network provisioning in an all-optical network. We verify the accuracy of our analysis for both oblivious and adaptive routing via simulations for the torus and hypercube networks     

一种新的WDM光传送网保护设计算法

在WDM网络中,由于光路之间存在的依赖性,物理网络的单链路失效可能会造成虚拓扑不连通而使上层网络(SDH、ATM或IP)无法使用自身的恢复机制来恢复受影响的业务,因此虚拓扑在嵌入物理拓扑时必须避免发生这种情况.已有的分离备用路径(Disjoint Alternate Path,DAP)算法总是假设网络所有波长路由节点都具有全波长转换能力.本文提出的LG_-VTMDP保护设计算法利用分层图同时解决路由和波长分配两个子问题,并考虑了负载均衡和物理链路的容量限制.实验结果表明LG_-VTMDP算法优于DAP算法和已有波长分配算法组合后的性能.本文还在此基础上提出了一种有效的波长转换器放置算法WCP算法.     

The layout of virtual paths in ATM networks

We study the problem of designing a layout of virtual paths (VPs) on a given ATM network. We first define a mathematical model that captures the characteristics of virtual paths. In this model, we define the general VP layout problem, and a more restricted case; while the general case layout should cater connections between any pair of nodes in the network, the restricted case layout should only cater connections between a specific node to the other nodes. For the latter case, we present an algorithm that finds a layout by decomposing the network into subnetworks and operating on each subnetwork, recursively; we prove an upper bound on the optimality of the resulting layout and a matching lower bound for the problem, that are tight under certain realistic assumptions. Finally, we show how the solution for the restricted case is used as a building block in various solutions to more general cases (trees, meshes, K-separable networks, and general topology networks) and prove a lower bound for some of our results. The results exhibit a tradeoff between the efficiency of the call setup and both the utilization of the VP routing tables and the overhead during recovery from link disconnections     

"黑箱"子网络的子网络转移阻抗矩阵的计算

本文讨论了基于子网络CCCS模型的子网络转移阻抗的计算公式,它仅依赖于子网络端口伏安关系和子网络CCCS模型及子网络端口与撕裂端的拓朴结构参数,而与子网络内的结构和参数无关,因此,可以实现“黑箱”子网络的子网络转移阻抗的计算,对于完成“黑箱”子网络故障的诊断具有实际意义。     

Dynamic wavelength assignment for multicast in all-optical WDM networks to maximize the network capacity

We study the problem of wavelength assignment for multicast in order to maximize the network capacity in all-optical wavelength-division multiplexing networks. The motivation behind this work is to minimize the call blocking probability by maximizing the remaining network capacity after each wavelength assignment. While all previous studies on the same objective concentrate only on the unicast case, we study the problem for the multicast case. For a general multicast tree, we prove that the multicast wavelength assignment problem of maximizing the network capacity is NP-hard and propose two efficient greedy algorithms. We also study the same problem for a special network topology, a bidirectional ring network, which is practically the most important topology for optical networks. For bidirectional ring networks, a special multicast tree with at most two leaf nodes is constructed. Polynomial time algorithms for multicast wavelength assignment to maximize the network capacity exist under such a special multicast tree with regard to different splitting capabilities. Our work is the first effort to study the multicast wavelength assignment problem under the objective of maximizing network capacity.