Cost effective survivable virtual optical network mapping in flexible bandwidth optical networks

•

0 likes•39 views

Cost effective survivable virtual optical network mapping in flexible bandwidth optical networks +91-9994232214,7806844441, ieeeprojectchennai@gmail.com, www.projectsieee.com, www.ieee-projects-chennai.com IEEE PROJECTS 2016-2017 ----------------------------------- Contact:+91-9994232214,+91-7806844441 Email: ieeeprojectchennai@gmail.com

Engineering

Cost-Effective Survivable Virtual Optical Network Mapping in Flexible
Bandwidth Optical Networks
Abstract:
This paper addresses the minimum network cost problem for survivable virtual
optical network mapping in flexible bandwidth optical networks. For each virtual
link, we provide dedicated-path protection, i.e., primary path and backup path, to
guarantee high survivability on the physical network. To simplify the virtual links
mapping, an extended auxiliary graph is constructed by coordinating the virtual
optical network and the physical network. We develop an integer linear program
(ILP) model, the LBSD (the largest bandwidth requirement (LB) of virtual links
versus the shortest distance (SD)) mapping approach, the LCSD (the
largest computing (LC) resources requirement versus the shortest distance)
mapping approach to minimize the network cost for a given set of VONs. For
comparison, we also introduce one baseline mapping approach, named LCLC (the
largest computing resources requirement versus the largest computing resources
(LC) provisioning), and the lower bound. Simulation results show that, comparing
to the LCLC mapping approach, the ILP model, the LBSD and LCSD mapping
approaches not only solve the problem of minimizing the total network cost but
also guarantee that the spectrum usage and the number of regenerators are
minimum. The ILP model and the LBSD mapping approach are greatly close to a
lower bound of network cost and perform the same results as a lower bound of
spectrum usage in both the 6-node network and the 14-node network. As a
result, our proposed LBSD mapping approach can efficiently reduce the network

cost, spectrum usage, and the number of regenerators, which is near the optimal
solutions of the ILP model.

What's hot

Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with infrastructure less environment to establish a data transmission between nodes within the network. A routing protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the cooperative transmission. In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination. Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are available at the transmitters. The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n) where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET (O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in the network use the components proactive routing protocol, forwarder list update and local re-transmission. We evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).

Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...

IJERA Editor

Handling selfishness in replica allocation

ambitlick

Opportunistic routing algorithm for relay node selection in wireless sensor n...

LogicMindtech Nologies

HEAD OFFICE (CHENNAI): JP INFOTECH, Old No. 31, New No: 86, 1st Floor, 1st Avenue, Ashok Nagar (Ashok Pillar), Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans MOBILE: (0)9952649690 LANDLINE: (044) 43012642 E-MAIL: jpinfotechprojects@gmail.com PUDUCHERRY / PONDICHERRY OFFICE: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Pondy-Tindivanam High Road, Puducherry/Pondicherry – 605009. Landmark: Opp. To Thattanchavady Industrial Estate and Next to VVP Nagar Arch. MOBILE: (0)9952649690 / (0) 8608600246 LANDLINE: (0413)4300535 E-MAIL: jpinfotechprojects@gmail.com

Opportunistic routing algorithm for relay node

jpstudcorner

Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies. We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation. ? TSYS Research and Development. 20/9 Sardar Patel Road, Janaki Complex, 4th Floor, Adyar, Chennai - 20? Tel : 91 44 42607879, 98411 03123. Website : http://www.tsysglobalsolutions.com/ http://tsysphdsupport.com/

Ieee transactions 2018 on wireless communications Title and Abstract

tsysglobalsolutions

Opportunistic routing algorithm for relay node selection in wireless sensor n...

redpel dot com

Energy efficient wireless sensor networks using linear programming optimizati...

LogicMindtech Nologies

dynamic traffic grooming in elastic optical network made from a reserch paper

Hamdard University

Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...

IOSR Journals

A network topology is a K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N X N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.

k fault tolerance Mobile Adhoc Network under Cost Constraint

sugandhasinghhooda

AN OVERLAY ARCHITECTURE FOR THROUGHPUTOPTIMAL MULTIPATH ROUTING

nexgentechnology

ABSTRACT One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm. KEYWORDS Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm Abstract Link : http://aircconline.com/abstract/ijcnc/v11n2/11219cnc03.html Full Details : http://aircconline.com/ijcnc/V11N2/11219cnc03.pdf

Energy Consumption Reduction in Wireless Sensor Network Based on Clustering

IJCNCJournal

Demand aware network function placement

ieeepondy

This paper deals with the discussion of an innovative and a design for the efficient power management and power failure diagnosis in the area of wireless sensors networks. A Wireless Network consists of a web of networks where hundreds of pairs are connected to each other wirelessly. A critical issue in the wireless sensor networks in the present scenario is the limited availability of energy within network nodes. Therefore, making good use of energy is necessary in modeling a sensor network. In this paper we have tried to propose a new model of wireless sensors networks on a three-dimensional plane using the percolation model, a kind of random graph in which edges are formed between the neighbouring nodes. An algorithm has been described in which the power failure diagnosis is made and solved. The concepts of Electromagnetics, Wave Duality, Energy model of an atom is linked with wireless networks. A model is prepared in which the positioning of nodes of sensors are decided. Also the model is made more efficient regarding the energy consumption, power delivery etc. using the concepts of graph theory concepts, probability distribution.

Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theory

idescitation

IMPULSE_TECHNOLOGY

What's hot (15)