• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.394-401
• /
• 2007

High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing(IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a recent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.1
• /
• pp.13-27
• /
• 2014

In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for the SRS problem by implementing Miller-Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and then apply the reformulation-linearization technique (RLT) to enhance the lower bound obtained by the LP relaxation. By exploiting the ring-star structure of underlying network, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2325-2349
• /
• 2014

Network virtualization technology plays a key role in cloud computing, which serves as an effective approach for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications or services. Recently, the problem of mapping a virtual network (VN) onto a substrate network has been addressed by various algorithms. However, these algorithms are typically efficient for unicast service-oriented virtual networks, and generally not applicable to multicast service-oriented virtual networks (MVNs). Furthermore, the survivable MVN mapping (SMVNM) problem that considers the survivability of MVN has not been studied and is also the focus of this work. In this research, we discuss SMVNM problem under regional failures in the substrate network and propose an efficient algorithm for solving this problem. We first propose a framework and formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. Then we design an efficient heuristic to solve this problem and introduce several optimizations to achieve the better mapping solutions. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. Our simulation experiments and results show that our approach outperforms existing solutions.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.568-570
• /
• 2002

With the development of Wavelength Division Multiplexing (WDM) and Optical Cross-Connect (OXC) systems, an efficient integration of IP and WDM has been focused. The Optical Internetworking Forum (OIF) proposes a new model that is called Overlay model for the integration of IP and WDM. In the Overlay model, UNI 1.0 signaling is adopted to establish signaling interface between Optical and IP network. UNI 1.0 signaling consists of a lot of functions; especially, reliability, light traffic, and etc. For that reason, Srefresh and ACK messages in UNI signaling support reliable messaging and reduce the amount of information that must be transmitted and processed in order to maintain RSVP states and processing time. This paper focuses on an implementation of Srefresh and ACK messages based on UNI 1.0 signaling and comparison between before and after implementing. The results show that Srefresh and ACK messages improve intelligence in the control plane of the optical network, which will make them more survivable, flexible, reliable, and controllable.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.329-336
• /
• 2006

This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.