Energy‐aware traffic allocation to optical lightpaths in multilayer core networks

The amount of traffic that is generated by users and high‐demanding services is expected to rise dramatically in the forthcoming years. This will unavoidably deteriorate the performance and increase the consumed energy of core networks, thus constraining the growth of Internet. To this effect, multilayer traffic engineering schemes in IP/multiprotocol label switching over dense wavelength division multiplexing networks have been proposed for achieving improved performance and increased energy savings by flexibly allocating traffic to optical lightpaths. In particular, the consumed energy in a router can be minimized if the lightpaths are established so as to traverse a router without electronic processing and conversion of their signal between optical and electrical layer. Accordingly, this paper aims at providing an energy‐aware solution to the problem of traffic allocation to optical lightpaths in multilayer core networks. The problem is first formulated and then a solution based on a heuristic algorithm, called energy‐aware traffic allocation to optical lightpaths (ETAL) is proposed. The efficiency and worthiness of ETAL is validated through numerous scenarios and simulations. The derived results indicate that the proposed algorithm is an efficient traffic engineering solution that exhibits better performance in terms of consumed energy (up to 44%), when compared to other similar traffic allocation schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

On spatially disjoint lightpaths in optical networks

Within the communication networks, a delayed constrained data packet is the one that will be dropped if not being served before a certain deadline time, which causes data packet loss affecting the quality of service (QoS). In this paper, we study the blocking probability and the mean delay of such delay constrained packets in an asynchronous single-wavelength optical buffer in optical packet switching networks, where the packet arrival process follows the Poisson process and the packet-length distribution is assumed to be general. We obtain the integral equations of the modeled system and the exact expressions of blocking probabilities and the mean delays. Numerical examples are provided to validate the results with interesting observations being highlighted.     

Customer‐managed end‐to‐end lightpath provisioning

Customer‐owned and managed optical networks bring new cost‐saving benefits. Two types of such networks are becoming widely used: metro dark fiber networks and long‐haul leased wavelength networks. Customers may invoke a special QoS mechanism where end‐to‐end (E2E) lightpaths are dynamically established across multiple independently managed customer domains. The cost of bandwidth is substantially reduced since it largely becomes a capital cost rather than an ongoing service charge. Customers can optimize the overall resource consumption by utilizing resources from different suppliers. Remote peering and transit reduce the Internet connectivity cost. Bandwidth and quality of service are guaranteed because customers directly peer with each other using transport networks. An architecture for a customer‐managed E2E lightpath provisioning system is presented. Integration with Grid applications is discussed and a prototype demonstration is described. Copyright © 2005 Crown in the right of Canada. Published by John Wiley & Sons, Ltd.     

光网络中保护光路的快速激活信令机制

针对通过用多协议标签交换(GMPLS)光网络中工作光路出现故障时保护光路的激活过程可能导致较长的故障恢复时间,成为限制应用的一个关键因素.本文从信令机制的角度研究缩短故障恢复时间的方法,扩展了现有的GMPSL信令协议,提出了一种保护光路的快速双向激活信令机制,分别从首尾两个方向同时激活一条保护光路,从而缩短了故障恢复时...     

Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks

Given a sparse‐splitting wavelength‐division multiplexing network with no wavelength converter, we study a group multicast problem that is how to transmit a number of multicast streams from the video server to multiple destinations simultaneously. To avoid the situation that the wavelengths are used up by the first few requests, one wavelength is available for each multicast request. Hence, some of destinations may not be included in the multicast trees because of the lack of wavelengths. Our goal is to construct a number of light trees with conflict‐free wavelengths for multiple requests so that the number of served clients is maximized. This problem is named as the revenue‐maximized and delay‐constrained group multicast routing problem. We first determine a set of multicast trees with the maximum number of served clients, then followed by the wavelength assignment to allocate the minimum number of wavelengths to the resulting trees. In this study, we propose two Integer Linear Programming ILP‐based algorithms for determining the optimal solutions for the light‐tree construction problem and the wavelength assignment problem, respectively. For large‐scale networks, two heuristics are introduced to solve the light‐tree construction problem approximately. A set of simulations are also provided for comparing performances of our algorithms against the other published methods. Copyright © 2016 John Wiley & Sons, Ltd.     

Design of low‐power all‐optical networks under the constraint of four‐wave mixing

In this paper, we propose a static lightpath establishment method to design low‐power all‐optical networks under the constraint of four‐wave mixing (FWM). Since the FWM causes nonlinear interchannel crosstalk, it degrades the communication quality of optical signals. The FWM crosstalk effect becomes strong in a fiber as the number of passing optical signals increases. Therefore, we should reduce the number of optical signals passing through the same fiber from the perspective of the FWM. Meanwhile, in order to enhance the power efficiency of optical amplifiers, which are deployed at each optical fiber, it is preferred that multiple optical signals are transmitted in the same fiber. In order to decrease the power consumption while keeping high communication quality, the proposed method statically selects routes, wavelengths, and fibers for each traffic demand, considering the FWM crosstalk effect and the usage efficiency of the optical amplifiers. We show the performance of the proposed method through numerical experiments.     

A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networks

Peer‐to‐peer (P2P) overlay networks were developed initially for file sharing such as Napster and Gnutella; but later, they have become popular for content sharing, media streaming, telephony applications, etc. Underlay‐unawareness in P2P systems can result in suboptimal peer selection for overlay routing and hence poor performance. In this paper, we present a comprehensive survey of the research work carried out to solve the overlay‐underlay mapping problems up till now. The majority of underlay‐aware proposals for peer selection focus on finding the shortest overlay routes by selecting nearest nodes according to proximity information. Another class of approaches is based on passive or active probing for provision of underlay information to P2P applications. Some other optimizations propose use of P2P middleware to extract, process, and refine underlay information and provide it to P2P overlay applications. Another class of approaches strive to use ISPs or third parties to provide underlay information to P2P overlay applications according to their requirements. We have made a state‐of‐the‐art review and comparison for addressing the overlay‐underlay mismatch in terms of their operation, merits, limitations, and future directions.     

Capacity performance of dynamic provisioning in optical networks

This paper describes an architecture and analyzes the performance of dynamic provisioning of lightpaths in an optical network. In dynamic provisioning, a lightpath is set up in real-time without rearranging the working and protection routes of existing lightpaths, and without the knowledge of future lightpath provisioning events. This paper develops a general model of the physical topology of the optical network, and outlines routing approaches for dynamic provisioning of lightpaths. It analyzes via simulations the performance of dynamically provisioned unprotected, 1+1 protected and mesh-restored lightpaths. The analysis of the efficiency of network utilization of dynamic provisioning focuses on the spare capacity needed for protection, and in particular focuses on the impact of sharing of wavelength channels for mesh-restored lightpaths. The main conclusion from the performance studies is that significant capacity gains are achieved with sharing of wavelength-channels for mesh-restored lightpaths with dynamic provisioning even for sparse topologies, and even at moderate loads     

Service level agreement and provisioning in optical networks

This article proposes a service level agreement applied to the optical domain (O-SLA), which is expected to be the near- and long-term network technology of the great bandwidth capacity offered by optical devices. After an exposition of the rationale behind an optical SLA, parameters that could be included in this O-SLA, as well as their values for four classes of services are proposed. Different client (wavelength or subwavelength) and service types (from leased wavelength to bandwidth on demand) are distinguished when necessary. The last part of this article presents issues related to the provisioning of services emanating from this O-SLA.     

Investigation of multicast‐based mobility support in all‐IP cellular networks

To solve the IP mobility problem, the use of multicast has been proposed in a number of different approaches, applying multicast in different characteristic ways. We provide a systematic discussion of fundamental options for multicast‐based mobility support and the definition and experimental performance evaluation of selected schemes. The discussion is based on an analysis of the architectural, performance‐related, and functional requirements. By using these requirements and selecting options regarding network architecture and multicast protocols, we identify promising combinations and derive four case studies for multicast‐based mobility in IP‐based cellular networks. These case studies include both the standard any‐source IP multicast model as well as non‐standard multicast models, which optimally utilize the underlying multicast. We describe network architecture and protocols as well as a flexible software environment that allows to easily implement these and other classes of mobility‐supporting multicast protocols. Multicast schemes enable a high degree of flexibility for mobility mechanisms in order to meet the service quality required by the applications with minimal protocol overhead. We evaluate this overhead using our software environment by implementing prototypes and quantifying handoff‐specific metrics, namely, handoff and paging latency, packet loss and duplication rates, as well as TCP goodput. The measurement results show that these multicast‐based schemes improve handoff performance for high mobility in comparison to the reference cases: basic and hierarchical Mobile IP. Comparing the multicast‐schemes among each other the performance for the evaluated metrics is very similar. As a result of the conceptual framework classification and our performance evaluations, we justify specific protocol mechanisms that utilize specific features of the multicast. Based on this justification, we advocate the usage of a source‐specific multicast service model for multicast‐based mobility support that adverts the weaknesses of the classical Internet any‐source multicast service model. Copyright © 2006 John Wiley & Sons, Ltd.     

Data replication mechanisms in the peer‐to‐peer networks

Peer‐to‐peer (P2P) network is a distributed network in which nodes with similar capabilities exchange information with each other. Due to the nature of the P2P network distribution, numerous network message transformation is required to exchange the data between nodes over the network, which may increase access latency. Because of the high amount of the stored data in the P2P networks, the replication of data is very important. A large amount of data is handled using data replication to increase data access, reduce access latency, and increase data availability. This issue has an important role in the P2P networks, but there is no complete and systematic research in this field. Therefore, this paper aims to provide a comprehensive study of data replication mechanisms in the P2P networks. The 1027 papers have been identified and have been reduced to 213 main studies using the paper selection process. Moreover, in this paper, the major advances are reviewed in four main groups (structured, unstructured, super‐peer, and hybrid networks), and the new challenges are also highlighted. Moreover, the open issues and guidelines for future studies are presented.     

End‐to‐end mobility support in content centric networks

Content‐centric networking (CCN) has been recently proposed as an alternative to traditional IP‐based networking. In CCN, content is accessed by content name instead of a host identifier (locational identifier). This new type of access methodology rapidly and efficiently disseminates content in combination with the in‐network caching mechanism. For practical use of CCN, many network properties studied in IP‐based networking are being revisited, and new types of CCN architecture components are being designed. Although mobility is an essential aspect of the future networking system, it has not been sufficiently studied. We therefore address fundamental mobility issues, such as seamless handover, optimal access point selection, network mobility, and handling of persistent interests. In addition, for each issue, we propose practical solutions that efficiently align to a CCN environment. To ensure seamless handoff, we propose various handoff schemes and compare their performance in terms of handoff latency using packet‐level simulation. Because our proposed schemes are consistent with the characteristics and rules of CCN, we believe that they can easily be integrated as a part of CCN. Copyright © 2014 John Wiley & Sons, Ltd.     

Power-aware virtual optical network provisioning in flexible bandwidth optical networks [Invited]

Considering the virtual network infrastructure as a service, optical network virtualization can facilitate the physical infrastructure sharing among different clients and applications that require optical network resources. Obviously, mapping multiple virtual network infrastructures onto the same physical network infrastructure is one of the greatest challenges related to optical network virtualization in flexible bandwidth optical networks. In order to efficiently address the virtual optical network (VON) provisioning problem, we can first obtain the virtual links’ order and the virtual nodes’ order based on their characteristics, such as the bandwidth requirement on virtual links and computing resources on virtual nodes. We then preconfigure the primary and backup paths for all node-pairs in the physical optical network, and the auxiliary graph is constructed by preconfiguring primary and backup paths. Two VON mapping approaches that include the power-aware virtual-links mapping (PVLM) approach and the power-aware virtual-nodes mapping (PVNM) approach are developed to reduce power consumption for a given set of VONs in flexible bandwidth optical networks with the distributed data centers. Simulation results show that our proposed PVLM approach can greatly reduce power consumption and save spectrum resources compared to the PVNM approach for the single-line rate and the mixed-line rate in flexible bandwidth optical networks with the distributed data centers.     

Efficient resource provisioning using traffic balancing in multidomain optical networks

In multidomain optical networks (MDONs) the emerging multimedia, multivendor applications–based scheduled traffic (ST) is periodic and repeated day by day. The traffic is heavy during the working hours and slack during the non‐office hours. This results in the scarcity of network resources during the working hours, leading to the increased blocking of requests, even though there remains relatively large underused capacity during the non‐office hours. To use the network resources uniformly and efficiently, the demands may be slided within or shifted along the time zones/windows. In this paper, we first propose a heuristic algorithm, time‐aware routing and wavelength assignment (TA‐RWA), which allocates resources without traffic balancing (TB) for the ST in MDON. Time‐aware routing and wavelength assignment policy is then used as a benchmark for comparison with the 3 different TB solutions (named as P1‐TB, P2‐TB, and P3‐TB), in which the network load is redistributed by rescheduling the intradomain and interdomain demands. We performed extensive simulation experiments in MATLAB environment and compared the proposed policies with the existing ordering policies. From the results, it can be inferred that the proposed TB policies outperform the TA‐RWA, and the existing strategies of the blocking probability, resource utilization ratio (RUR), and percentage of intradomain and interdomain connections established. The best performance is achieved using P3‐TB strategy, in which requests are slided within, and shifted, along different time windows. The strategy shows about 70% reduction in the percentage blocking probability with respect to the TA‐RWA and the existing strategies.     

Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks

As multicast applications become more and more popular, implementing multicast in the optical domain has attracted increased attention due to its more efficient bandwidth usage. And also these services have quality-of-service requirements. In this article, the problem of cost-effective optical multicast provisioning to satisfy the differentiated leaf availability requirements is formally stated. A Mixed Integer Linear Program formulation is proposed for provisioning dedicated light-tree protection with differentiated leaf availability guarantee. The algorithm is so complex and infeasible that we also propose a feasible two-step approximate approach to solve the problem. Different from the previous schemes, our scheme finds out the primary light-trees and backup paths for destination nodes whose availability is not satisfied. Because of taking the different leaf availability requirements into account, the proposed algorithm obtains a more efficient feasible solution requiring less network resources.     

QoS provisioning for multiple non‐real‐time services in cellular wireless networks

Future mobile services are expected to include various non‐voice oriented services. One important category of non‐voice oriented mobile services is non‐real‐time services. When a mobile user establishes a connection to access non‐real‐time service, the mobile user usually cares about whether the total time to complete its data transfer is within its time tolerance. In addition, different mobile users may have different bandwidth requirements and different tolerances in the total completion time. It is essential for wireless systems to provide various mobile users with different total completion times. In this paper, two quality‐of‐service (QoS) metrics, called stretch ratio and eligibility percentage, are employed at a connection level to present the degree of the length of the total completion time. We devise a measurement based call admission control scheme that provides multiple QoSs for various mobile users which have different requirements of stretch ratios, eligibility percentages, and bandwidths. Extensive simulation results show that the measurement based call admission control scheme not only provides various satisfactory QoSs for mobile users but also produces high throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

Model for autonomous agents in machine‐to‐machine navigation networks

Machine‐to‐machine (M2M) is an evolving architecture and tends to provide enormous services through the swarm presence of the networked devices. Localization is one of those services. Previous localization techniques require complex computation that is not suitable and affordable in such architecture. Moreover, integrating intelligent multiagents on these ubiquitous devices makes the network more independent and reactive requiring for a less complex localization model. This paper reviews the present localization techniques and discusses their infeasibility for M2M communication while proposing a mathematical model that is derived from Anderson model for the distributed structure of machine‐type‐communication network involving autonomous agents. This paper has made an attempt to use the property of Anderson model that structures the distributed objects. This paper also classifies autonomous agents according to their functionalities in a navigational network. Recently, Anderson model have been customized for implication of optical communication; in this paper, the proposed mathematical model involves intelligent agents for localization that aim to reduce complexity of positioning computations for nodes having restricted computational resources and battery life, which are the main characteristics of M2M communication.     

Online connection provisioning in metro optical WDM networks using reconfigurable OADMs

Optical add/drop multiplexers (OADMs) can significantly reduce the cost of metro optical wavelength-division multiplexing (WDM) ring networks by allowing traffic to bypass intermediate nodes without expensive opto-electro-opto (O-E-O) conversion. Some traditional OADMs, called fixed OADMs (FOADMs), can only add/drop traffic on a specific wavelength. Reconfigurable OADMs (ROADMs) are emerging, which can add/drop traffic onto/from different wavelengths at different time. ROADMs provide desirable flexibility, enable fast provisioning of dynamic traffic, and save capital expenditure (CapEx) and operational expenditure (OpEx). In order to be cost effective, some ROADMs employ architectures that tune the ROADM continuously from one wavelength to another, crossing through all the wavelengths in between, which may cause interference to the connections, if any, on those wavelengths being crossed. In order to prevent existing connections from being interrupted, a constraint needs to be imposed that ROADMs cannot cross working wavelengths when tuning. In this paper, the design and the benefits of metro optical WDM network architectures using ROADMs and the impact of this tuning constraint on the performance of the network are investigated. The dynamic traffic provisioning problem is analyzed and divided into two subproblems: 1) a traditional one on resource allocation; and 2) a new subproblem on tuning-head positioning (TP). Several heuristics for each subproblem are developed to combat the tuning constraint. Results from our simulation experiments show that the tuning constraint can significantly affect the network performance in terms of overall connection blocking probability, and good heuristics for network control and management are needed to overcome this tuning constraint.     

Dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes

The wavelength selective switch-based reconfigurable optical add/drop multiplexers is a promising switching equipment for future reconfigurable wavelength-division multiplexing (WDM) mesh networks. However, its asymmetric switching property complicates the optimal routing and wavelength assignment problem. In an asymmetric switching scenario, using the classic Dijkstra’s algorithm can lead to invalid paths traversing unconnected ports of an asymmetric node. To solve this problem, we propose both link-state (LS) and distance vector (DV) schemes for dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes. The proposed LS schemes include the asymmetric switching-aware (ASA) Dijkstra’s algorithm, the $K$ -shortest path-based algorithm, and the entire path searching (EPS) algorithm. Simulation results show that the ASA-Dijkstra’s algorithm will bring notable improvement of the blocking performance with low computational complexity, while the EPS algorithm has much higher complexity and is not suitable to be employed in large-scale networks. On the other hand, our proposed DV solution, i.e., the information diffusion-based routing (IDBR), can achieve the lowest blocking probability with the lowest computational complexity. Moreover, IDBR does not require the distribution of local asymmetric switching information like the LS schemes, thus having a high level of topology confidentiality.