Demand aware network function placement

•

0 gefällt mir•53 views

Demand aware network function placement +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 ieee projects, ieee projects chennai, ieee projects 2016,ieee projects 2017,

Bildung

Demand-Aware Network Function Placement
Abstract:
Network function virtualization is an emerging network resource utilization
approach which decouples network functions from proprietary hardware and
enables adaptive services to end-user requests. To accommodate the network
function requests, network function instances are created and deployed at
runtime. In this paper, we study a network virtualization scheme to orchestrate
and manage networking and network function services. We propose an
integrated design for network function instance allocation and end-to-end
demand realization sharing the same physical substrate network and
demonstrate that the corresponding network design problem is NP complete. A
mixed-integer programming formulation is proposed first to find its optimal
solution, followed by a two-player pure-strategy game model which captures the
competition on physical resources between network function instance allocation
and routing. We then design an algorithm based on iterative weakly dominated
elimination in Game Theory. Computational results demonstrate the value of the
integrated approach and its ability to allocate network function instances
supporting end-to-end requests with limited physical resources in optical
networks.

Weitere ähnliche Inhalte

Was ist angesagt?

In Wireless Sensor Network, a large number of sensor nodes are deployed and they mainly consume energy in transmitting data over long distances. Sensor nodes are battery powered and their energy is restricted. Since the location of the sink is remote, considerable energy would be consumed if each node directly transmits data to the base station. Aggregating data at the intermediate nodes and transmitting using multihops aids in reducing energy consumption to a great extent. This paper proposes a hybrid protocol “Energy efficient Grid and Tree based routing protocol” (EGT) in which the sensing area is divided into grids. The nodes in the grid relay data to the cell leader which aggregates the data and transmits to the sink using the constructed hop tree. Simulation results show that EGT performs better than LEACH.

ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOL

ijwmn

4 Sw 2009 Ieee Abstracts Dot Net, Ncct Chennai

ncct

Dotnet distributed processing of probabilistic top-k queries in wireless sen...

Ecway Technologies

Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes. Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP). Title: Energy Efficient Optimal Paths Using PDORP-LC Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Paper Publications

Energy Efficient Optimal Paths Using PDORP-LC

paperpublications3

In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.

Energy Conservation in Wireless Sensor Networks Using Cluster-Based Approach

IJRES Journal

Energy saving to prolong the network life is an important design issue while developing a new routing protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a homogeneous network architecture, in which all sensors have the same capabilities in terms of battery power, communication, sensing, storage, and processing. Recently, there has been an interest in heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal nodes are elected with the help of a probability scheme based on residual and average energy of the normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a round. Advanced nodes use a separate probability based scheme for cluster head election and they will further act as a gateway for normal cluster heads and transmit their data load to base station when they are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during cluster formation phase to save network energy. The performance of EACP is compared with SEP and simulation result shows the better result for stability period, network life and energy saving than SEP.

Energy aware clustering protocol (eacp)

IJCNCJournal

Was ist angesagt? (6)

ENERGY EFFICIENT GRID AND TREE BASED ROUTING PROTOCOL

4 Sw 2009 Ieee Abstracts Dot Net, Ncct Chennai

Dotnet distributed processing of probabilistic top-k queries in wireless sen...

Energy Efficient Optimal Paths Using PDORP-LC

Energy Conservation in Wireless Sensor Networks Using Cluster-Based Approach

Energy aware clustering protocol (eacp)

Ähnlich wie Demand aware network function placement

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

ENERGY CONSUMPTION REDUCTION IN WIRELESS SENSOR NETWORK BASED ON CLUSTERING

IJCNCJournal

In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of Network Functions Virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select any capabilities and locations of network functions without any physical constraints. This paper focuses on the deployment of NFV-based routing functions which are one of critical virtual network functions, and present the algorithm of virtual routing function allocation that minimize the total network cost. In addition, this paper presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the cost of a routing function to that of a circuit and traffic distribution in the network into consideration. Furthermore, this paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total network cost dramatically, in comparison to a conventional network, in which it is not economically viable to distribute smallcapacity routing functions

FLEXIBLE VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORK WITH MINIMU...

IJCNCJournal

With the rapid increase in demand for high performance computing, there is also a significant growth of data communication that leads to leverage the significance of network on chip. This paper proposes a reconfigurable fault tolerant on chip architecture with hierarchical agent based monitoring system for enhancing the performance of network based multiprocessor system on chip against faulty links and nodes. These distributed agents provide healthy status and congestion information of the network. This status information is used for further packet routing in the network with the help of XY routing algorithm. The functionality of Agent is enhanced not only to work as information provider but also to take decision for packet to either pass or stop to the processing element by setting the firewall in order to provide security. Proposed design provides a better performance and area optimization by avoiding deadlock and live lock as compared to existing approaches over network design.

Reconfigurable High Performance Secured NoC Design Using Hierarchical Agent-b...

IJECEIAES

An optimization framework for mobile data collection in energy harvesting wir...

Finalyearprojects Toall

Dynamic composition of virtual network functions in a cloud environment

Francesco Foresta

NFV-based network implements a variety of network functions with software on general-purpose servers and this allows the network operator to select any capacity and location of network functions without any physical constraints. The authors proposed an algorithm of virtual routing function allocation in the NFVbased network for minimizing the total power consumption or the total network cost, and developed effective allocation guidelines for virtual routing functions. This paper evaluates the effect of the maximum tolerable network delay on the guidelines for the allocation of virtual routing functions, which minimizes the total network cost. The following points are clear from quantitative evaluations: (1) The shorter the maximum tolerable network delay, the greater the number of areas where the routing function must be allocated, resulting in an increase in the total network cost. (2) The greater the routing function cost relative to the circuit bandwidth cost, the greater the increase in the total network cost caused by the maximum tolerable network delay. This paper also provides the possible guideline how to decide the value of maximum tolerable network delay when the condition of allowable increase in network cost is given.

VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORKS UNDER NETWORK DELAY...

IJCNC Journal

NFV-based network implements a variety of network functions with software on general-purpose servers and this allows the network operator to select any capacity and location of network functions without any physical constraints. The authors proposed an algorithm of virtual routing function allocation in the NFVbased network for minimizing the total power consumption or the total network cost, and developed effective allocation guidelines for virtual routing functions. This paper evaluates the effect of the maximum tolerable network delay on the guidelines for the allocation of virtual routing functions, which minimizes the total network cost. The following points are clear from quantitative evaluations: (1) The shorter the maximum tolerable network delay, the greater the number of areas where the routing function must be allocated, resulting in an increase in the total network cost. (2) The greater the routing function cost relative to the circuit bandwidth cost, the greater the increase in thetotal network cost caused by the maximum tolerable network delay. This paper also provides the possible guideline how to decide the value of maximum tolerable network delay when the condition of allowable increase in network cost is given.

VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORKS UNDER NETWORK DELAY...

IJCNCJournal

International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.

C046022025

IJERA Editor

Energy efficient cooperative transmission for simultaneous wireless informati...

LogicMindtech Nologies

A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.

A smart clustering based approach to

IJCNCJournal

Cu3210381040

IJMER

The Internet of Things (IoT) is a dispersed network system that connects the world through the Internet. The architecture of IoT consists of more gateways and resources which cannot be allocated in a manual process. The allocation of resources in IoT is a challenging process due to the higher consumption of energy and high latency rate. To overcome the challenges in existing works, this research introduced an Improved Reptile Search Algorithm (IRSA) to solve the optimization problem which occurs during the time of allocation resources among IoT networks. IRSA employs the methodology of levy flight and cross-over to update the candidate position and enhance the search speed in a single iteration. The proposed method consumes less energy and has low latency during data transmission from User equipment (UE) to the base station.IRSA has been compared with the existing Scalable Resource Allocation Framework (SRAF) and Improved Chaotic Firefly Algorithm (ICFA). The obtained experimental results show that the proposed IRSA attained better performance with an allocation rate of 96.40% which is comparatively higher than SRAF and ICFA with 92.40% and 91.67% respectively.

IoT Resource Allocation and Optimization Using Improved Reptile Search Algorithm

IJCNCJournal

IoT Resource Allocation and Optimization Using Improved Reptile Search Algorithm

IJCNCJournal

Wired and Wireless Computer Network Performance Evaluation Using OMNeT++ Simu...

Jaipal Dhobale

New generations of applications call for new demands that are totally different from previous uses of the Internet (e.g., cross-layer and network function virtualization), and the existing networks are not optimized for these new demands due to being overwhelmed by enormous numbers of external network protocols. Overlay network technologies aim to respond to such future network demands. Systems on overlay networks mitigate this protocol overload by exploiting the unlimited programmability of the overlay nodes comprising the system. This paper proposes an overlay node that works as a transparent proxy server and router for encrypted communication over overlay networks. This overlay node acts as a virtual switch over multiple layers of the OSI reference model (the datalink, network, transport, and session layers) using general-purpose components (a personal computer, physical network interface card, and virtual network interface card, developed using the C language). The ideas behind this proposal derive from the effectiveness of software-defined networks and network function virtualization. Finally, we examine the performance of the overlay node experimentally and suggest possible designs for future overlay networks.

Proposal of a Transparent Relay System with vNIC for Encrypted Overlay Networks

IJCSIS Research Publications

Transmission power has a major impact on link and communication reliability and network lifetime in Wireless Sensor Networks. We study power control in a multi-hop Wireless Sensor Network where nodes' communication interfere with each other. Our objective is to determine each node's transmission power level that will reduce the communication interference and keep energy consumption to a minimum. We propose a potential game approach to obtain the unique equilibrium of the network transmission power allocation. The unique equilibrium is located in a continuous domain. However, radio transceivers accept only discrete values for transmission power level setting. We study the viability and performance of mapping the continuous solution from the potential game to the discrete domain required by the radio. We demonstrate the success of our approach through TOSSIM simulation when nodes use the Collection Tree Protocol for routing the data. Also, we show results of our method from the Indriya testbed. We compare it with the case where the motes use Collection Tree Protocol with the maximum transmission power.

APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNS

IJCNCJournal

The internet of things (IoT) environment prerequisite seamless connectivity for meeting real-time application requirements; thus, required efficient resource management techniques. Heterogeneous wireless networks (HWNs) have been emphasized for providing seamless connectivity with high quality of service (QoS) performance to provision IoT applications. However, the existing resource allocation scheme suffers from interference and fails to provide a quality experience for low-priority users. As a result, induce bandwidth wastage and increase handover failure. In addressing the research issues this paper presented the resource-optimized network selection (RONS) method for HWNs. The RONS method employs better load balancing to reduce handover failure and maximizes resource utilization through dynamic slot optimization. The RONS method assures tradeoffs between high performance to high priority users and quality of experience (QoE) for low priority users. The experiment outcome shows the RONS achieves very good performance in terms of throughput, packet loss, and handover failures in comparison with existing resource selection methods.

Resource optimization-based network selection model for heterogeneous wireles...

IAESIJAI

This work shows how the performance of a network function can be estimated with an error margin that is small enough to properly support orchestration of network functions virtualization (NFV) platforms. Being able to estimate the performance of a virtualized network function (VNF) on execution hardware of various types enables its optimal placement, while efficiently utilizing available resources. Network functions are modeled using a methodology focused on the identification of recurring execution patterns and aimed at providing a platform independent representation. By mapping the model on specific hardware, the performance of the network function can be estimated in terms of maximum throughput that the network function can achieve on the specific execution platform. The approach is such that once the basic modeling building blocks have been mapped, the estimate can be computed automatically. This work presents the model of an Ethernet switch and evaluates its accuracy by comparing the performance estimation it provides with experimental results. in IEEE Xplore, DOI: 10.1109/EWSDN.2015.64 Authors Gergely Pongrácz, Ericsson Research; Mario Baldi and Amedeo Sapio, Politecnico di Torino, Torino, Italy. Published 2015-09-30 © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Conference Paper: Cross-platform estimation of Network Function Performance

Ericsson

The research on various issues in Mobile ad hoc networks is getting popular because of its challenging nature and all time connectivity to communicate. Network simulators provide the platform to analyse and imitate the working of the nodes in the networks along with the traffic and other entities. The current work proposes the design of a simulator for the mobile ad hoc networks that provides a test bed for the energy efficient clustering in the dynamic network. Node parameters like degree of connectivity and average transmission power are considered for calculating the energy consumption of the mobile devices. Nodes that consume minimum energy among their 1-hop neighbours are selected as the cluster heads.

Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks

cscpconf

Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Nagar, Chennai-83. Landmark: Next to Kotak Mahendra Bank/Bharath Scans Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry - 9 Landmark: Opp. to Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690

Optimal configuration of network

jpstudcorner

Ähnlich wie Demand aware network function placement (20)

ENERGY CONSUMPTION REDUCTION IN WIRELESS SENSOR NETWORK BASED ON CLUSTERING

FLEXIBLE VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORK WITH MINIMU...

Reconfigurable High Performance Secured NoC Design Using Hierarchical Agent-b...

An optimization framework for mobile data collection in energy harvesting wir...

Dynamic composition of virtual network functions in a cloud environment

VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORKS UNDER NETWORK DELAY...

C046022025

Energy efficient cooperative transmission for simultaneous wireless informati...

A smart clustering based approach to

Cu3210381040

IoT Resource Allocation and Optimization Using Improved Reptile Search Algorithm

Wired and Wireless Computer Network Performance Evaluation Using OMNeT++ Simu...

Proposal of a Transparent Relay System with vNIC for Encrypted Overlay Networks

APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNS

Resource optimization-based network selection model for heterogeneous wireles...

Conference Paper: Cross-platform estimation of Network Function Performance

Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks

Optimal configuration of network

Mehr von ieeepondy

Service description in the nfv revolution trends, challenges and a way forward

ieeepondy

Secure optimization computation outsourcing in cloud computing a case study o...

ieeepondy

Spatial related traffic sign inspection for inventory purposes using mobile l...

ieeepondy

Standards for hybrid clouds

ieeepondy

Rfhoc a random forest approach to auto-tuning hadoop's configuration

ieeepondy

Resource and instance hour minimization for deadline constrained dag applicat...

ieeepondy

Reliable and confidential cloud storage with efficient data forwarding functi...

ieeepondy

Rebuttal to “comments on ‘control cloud data access privilege and anonymity w...

ieeepondy

Scalable cloud–sensor architecture for the internet of things

ieeepondy

Scalable algorithms for nearest neighbor joins on big trajectory data

ieeepondy

Robust workload and energy management for sustainable data centers

ieeepondy

Privacy preserving deep computation model on cloud for big data feature learning

ieeepondy

Pricing the cloud ieee projects, ieee projects chennai, ieee projects 2016,ie...

ieeepondy

Protection of big data privacy

ieeepondy

Power optimization with bler constraint for wireless fronthauls in c ran

ieeepondy

Performance aware cloud resource allocation via fitness-enabled auction

ieeepondy

Performance limitations of a text search application running in cloud instances

ieeepondy

Performance analysis and optimal cooperative cluster size for randomly distri...

ieeepondy

Predictive control for energy aware consolidation in cloud datacenters

ieeepondy

Over flow multi site aware big data management for scientific workflows on cl...

ieeepondy

Mehr von ieeepondy (20)