Variable Path With Variable Bandwidth

Essay, Pages 6 (1445 words)

Views

Abstract

Bandwidth Scheduling is more important in high-performance networks because to minimize energy consumption in the network and to save the energy in the real life network environments. Most commonly existing bandwidth Scheduling algorithms consider only data transfer time minimization, and especially limited efforts have been dedicated to energy efficiency in HPN. Power-down & speed-scaling are the two widely adopted power models that we are going to consider.

Use an approximation algorithm and an analytical approach that considers the back and forth between objective optimality and time cost in practice to the problem using the speed-scaling patterns.

Don't use plagiarized sources. Get your custom paper on

“ Variable Path With Variable Bandwidth ”

Get high-quality paper

NEW! smart matching with writer

By comparing the existing methods, we can prove this result in both simulated and real-life networks.

Introduction

An end-to-end energy cost model that considers the topography and the traffic to estimate the consumption of energy by every networks. The bandwidths link in such networks is typically shared by multiple users through advance reservation and it is mainly for transmitting the signals, resulting in alternate bandwidth availability in future time.

There have been substantial research efforts on various aspects of energy efficiency or power awareness for high-performance computing systems.

However, energy consideration in high-performance network for bandwidth scheduling is still very limited. Most existing bandwidth scheduling algorithms only concern traditional optimization objectives such as minimizing data transfer end time. Particularly, design a polynomial-time optimal solution for a simplified version of the static energy consumption saving problem and provide its rigorous correctness proof.

Network Protocol:

Network protocols organize all these requirements, processes and constraints of starting and accomplishing conversation between servers, routers, computers and all other network-permitted devices.

Network protocols must be accepted and installed by the sender and receiver to provide network/data communication and apply to software and hardware nodes that connect on a network.

The types of networking protocols are:

Network-communication protocols: Basic data conversation protocols, such as HTTP and TCP/IP.
Network security protocols: Implement security over network connections and include HTTPS(Hyper Text Transfer Protocol Secure), SSL(Secure Socket Layer) and SFTP(Secure File Transfer Protocol).
Network management protocols: Give network governance and maintenance and include ICMP and SNMP.

Energy efficiency in wireless network:

With the fast increment of wireless networking in the world, the energy efficiency of wireless networking protocols becomes a firm of many wireless networking stakeholders. They have passion on the energy efficiency in wireless networking protocols for several logics such as architecture problem, green technology policy, cost and last user satisfaction.

There are many capacities for saving the energy in wireless network protocols. Some are concentrating on saving the energy in several modes such as effective/sleep modes. Some are concerned about reducing interference and receiving higher signal-noise ratio with the same transmission radio power. Some are exercised about increasing the speed according to the application and environment to save the time working under active modes.

Router:

A router is a corporeal or essential appliance that travels information between two or more packet-switched computer networks - analyzing a given data packet's destination IP address, calculating the suitable way for it to attain that destination and then moving it accordingly.

Literature Review

In this paper [1] the author describes as, Modern data-intensive applications require the transfer of big data over high-performance networks (HPNs) through bandwidth reservation for various purposes such as data storage and analysis. The crucial performance metrics for bandwidth scheduling include the effective usage of network resources and the satisfaction of user needs. For a particular batch of Deadline-Constrained, Bandwidth Reservation petitions attempt to maximize the many number of satisfied needs with flexible scheduling options over link-disjoint paths in an HPN while achieving the best average Earliest Completion Time or Shortest Duration of scheduled requests.

In this paper [2] the author describes as, an increasing number of high-performance networks are built over the existing IP network infrastructure to provision dedicated channels for big data transfer. The links in these overlay networks correspond to underlying paths and may share lower-level link segments. We consider a model of overlay networks that incorporates correlated link capacities and linear capacity constraints (LCCs) to formulate such shared bottleneck components. Therefore, efficient bandwidth scheduling algorithms are needed to improve the network resource utilization and also meet the user’s transport requirements.

In this paper [3] the author describes as, consider the problem of minimizing the power consumption of IP core networks by means of power aware configuration of the Points of Presence, given general traffic demands on the links. Although the error is in general NP-complete, it gives an optimal algorithm for a more variant where the many number of ports on each line-card. When the traffic demands are correlated, it proves that algorithms are optimal. Large simulations reveal that Points of Presence configuration algorithms crucially outperform existing design solutions over a wide range of traffic instances.

In this paper [4] the author describes as, the energy consumed by data centers hosting cloud services is increasing enormously. This gets the need to decrease energy consumption of different parts in data centers. In this work, focus on energy efficiency of the networking component. However, how several kind of networking solutions smash energy consumption is still an open question. The study the historical tendency in the investigated answers and conclude that the emerging and most widely adopted one is the Decision framework.

In this paper [5] the author describes as, a set of bandwidth reservation algorithms with optimality proof to achieve the earliest completion time (ECT) and the shortest duration.

In this paper [6] the author describes as, the power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Notwithstanding traffic-engineering-based answers, very below attention has been paid on performance-guaranteed energy saving schemes. The author propose a novel energy saving model for data center networks by scheduling and routing “deadline-constrained flows” where the transmission of every flow has to be accomplished before a meticulous deadline, being the most censorious requirement in production data center networks.

Problem Definition

Most commonly existing bandwidth scheduling algorithms consider data transfer time minimization, and especially limited efforts have been dedicated to energy efficiency.
Existing system proposed sleeping mode technique. Whenever the network equipment’s are not used it goes to sleep mode. This raises several problems like connectivity loss, long re-synchronization time. Again constant wake-up cost is required to transition back to the active state.
Polynomial time approximation scheme Present in previous study which leads knapsack problem which means where there is a need for an optimal object or finite solution where an exhaustive search is not possible.

VPVB MODEL

This chapter entirely discusses the proposed research methodology and the absolute steps concerned in that proposed research work. The system effectively proposes new model approach is called Variable Path with Variable Bandwidth (VPVB), which computes highest bandwidth path in each time slot. Along with our proposed research effectively discuss how to implement VPVB model more efficiently with the help of a Dijkstra’s algorithms. Proposed, Dijkstra’s algorithm has been presented to searching the shortest path from one source to one destination easy and effective manner.

Contribution of the VPVB model

The followings are the important contributions of the proposed system.

The proposed new model approach is called Variable Path with Variable Bandwidth (VPVB), which computes highest bandwidth path in each time slot.
A Dijkstra’s algorithms process has been applied to searching the shortest path effective manner.
VPVB has been applied which guarantees the global minimization of the data transfer end time.
Our proposed model effectively monitors and selects their large bandwidth for effective data transfer which leads minimize data transfer time.
Proposed VPVB model approach this significantly improves and Achieving Energy Efficiency.

Results and Analysis

The Variable Path with Variable Bandwidth algorithm is compared with existing polynomial time approximation scheme to investigate the performance of the proposed method. The work of this proposed system was evaluated with the previous algorithms based on the following parameters: Packet delivery ratio, End-to-end delay; Energy efficiency is used to estimate the performance of the proposed method.

Conclusion

The goal of this proposed work is designed to minimize energy consumption in the network and to save the energy in the real life network environments. Proposed Variable Path with Variable Bandwidth (VPVB),which computes highest bandwidth path in each time slot. Dijkstra’s algorithm is proposed to find the shortest path from one source to one destination effectively. The experimental results are evaluated by using the simulation environmental area.

In this experimental result shows that an integrated and extended proposed algorithm defines better quality assessment compared to the traditional switching/routing models. The result of the execution time is calculated it is almost reduced than the previous system. Finally, it can increase network performance.