One-Hop Path Routing Based on Heuristic-K Method Using ACO

2012 ◽  
Vol 601 ◽  
pp. 312-317
Author(s):  
Zheng He ◽  
Fan Wei ◽  
Xiao Hong Huang ◽  
Yan Ma
Keyword(s):  
Traffic Engineering ◽  
Network Architecture ◽  
Loss Rate ◽  
Overlay Networks ◽  
Routing Algorithm ◽  
Overlay Network ◽  
Content Delivery ◽  
Route Selection ◽  
Application Layer ◽  
Overlay Routing

Overlay networks have emerged as a promising paradigm for providing customizable and reliable services at the application layer, such as fault-resilient routing, multicast, and content delivery. Among the overlay network architecture, overlay routing is an important aspect of the overlay network design. In this paper, we develop a one-hop source routing, called heuristic-K algorithm using Ant Colony Optimization, to allow individual nodes to optimize route selection based on specific metrics like delay, loss rate, or throughput. Moreover, due to the selfish operating manner of overlay routing, we also take the traffic engineering element into consideration in the design process of our proposal. The experimental results demonstrate the effectiveness of the routing algorithm.

scholarly journals A peer-to-peer delivery system for internet short video sharing

2021 ◽  
Author(s):  
Maryam Bashardoust Tajali
Keyword(s):  
Network Architecture ◽  
High Performance ◽  
Overlay Networks ◽  
Content Delivery ◽  
Peer To Peer ◽  
Content Delivery Network ◽  
Indexing Scheme ◽  
Streaming Server ◽  
Video Sharing ◽  
Short Video

In this thesis, we considered the effect of the content delivery network architecture on the popular short video sharing websites such as YouTube. The high number of users demanding videos impacts YouTube scalability which requires a new content delivery structure. Considering the high performance of P2P overlay networks, we propose an efficient peer-to-peer based system for short video sharing in the Internet in which all participant peers are responsible to distribute video replicas they have stored. This system comprises of a BitTorrent like network and a central media streaming server. To proficiently utilize P2P in our system, we propose some important approaches including an efficient and reliable indexing scheme, an efficient downloading strategy, a reliable content distribution mechanism, and a fairness policy. The simulations results demonstrate that the proposed system significantly increases client peers download speed while reduces the server workload and the startup delay for an improved playback quality.

scholarly journals Minimizing Link Utilization in Selfish Overlay Routing

2011 ◽  
pp. 96-100
Author(s):  
S. Prayla Shyry ◽  
V. Ramachandran
Keyword(s):  
Traffic Engineering ◽  
Overlay Networks ◽  
Specific Problem ◽  
Programming Formulation ◽  
Queuing Models ◽  
Link Utilization ◽  
Public Networks ◽  
Overlay Routing ◽  
Dual Programming ◽  
Multi Protocol Label Switching

The rapid growth and increasing requirements for service quality, reliability had made everyone to choose the traffic engineering essential for the large public networks. The multi Protocol label switching is a protocol used when there is interaction between the traffic engineering and the overlay networks. This MultiProtocol Labeled Switching (MPLS) with the help of the nash equilibrium algorithm has given optimized performance better by reducing the latency and increasing the link utilization. But increase in link utilization will gradually increase the congestion in the network as the link is being used by all the nodes. So, to overcome this specific problem we have performed a formulation called dual programming formulation which has set of constraints that have to be satisfied, along with Open Shortest Path First(OSPF) protocol so as to reduce the maximum link utilization. We have simulated the results in five queuing models which includes BPR,PD1,PM1,MM1,MD1 using source, compliant, optimal overlay routing. The results are simulated using Ns2 with linux as platform.Link utilization is reduced based on the parameters such as traffic demands and the distance between the nodes with their respective demands.

Multiple Constrained QoS Routing Algorithm Based on Genetic Algorithm in Overlay Network

2013 ◽  
Vol 347-350 ◽  
pp. 2067-2070
Author(s):  
Jun Wei Ge ◽  
Jin Xin Deng ◽  
Yi Qiu Fang
Keyword(s):  
Genetic Algorithm ◽  
Loss Rate ◽  
Routing Algorithm ◽  
Overlay Network ◽  
Network Routing ◽  
Global Network ◽  
Network Resources ◽  
Network Bandwidth ◽  
Qos Routing Algorithm ◽  
Effective Use

How to depend on different services provide different guarantee of QoS, and to ensure the effective use of network resources will become an important task in overlay network. In this paper, we consider constraints of network bandwidth, delay, loss rate, cost ,and base on the resources of current global network, as well as user-specific QoS metric needs to choose the best QoS route based on genetic algorithm. Experiments show that the algorithm is feasible in overlay network routing,and it has the better global load balancing capabilities.

scholarly journals Traffic engineering friendly request routing in content delivery network

2021 ◽  
Author(s):  
Arun Nanthakumaran
Keyword(s):  
Load Balancing ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Distribution Network ◽  
Content Delivery ◽  
Operational Efficiency ◽  
Content Delivery Network ◽  
Server Selection ◽  
Request Routing ◽  
Bottleneck Paths

Content delivery over Internet is optimized for low use perceived latency by designing specialized Content Distribution Network (CDN). Content servers are connected through a content switch the distributes client requests among them to achieve load balancing across the servers. The content switch is located one-hop away from the servers. Server load balancing is one factor in achieveing low user perceived latency and improving operational efficiency. Traffic engineering is another factor that is generally and integrated with serverload balancing for CDN optimization. In this thesis we propose a request routing algorithm for a CDN that was designed to integrate server selection and traffic engineering functions in the request routing system. The CDN employs MPLS in the network for traffic engineering. The proposed algorithm optimizes content delivery for user perceived latency by achieving server load balancing and network traffic loan manaement among alternative paths. It also improves operational efficiency of the CDN by eliminating bottleneck paths and increasing utilization of underutilized servers and paths.

scholarly journals A peer-to-peer delivery system for internet short video sharing

2021 ◽  
Author(s):  
Maryam Bashardoust Tajali
Keyword(s):  
Network Architecture ◽  
High Performance ◽  
Overlay Networks ◽  
Content Delivery ◽  
Peer To Peer ◽  
Content Delivery Network ◽  
Indexing Scheme ◽  
Streaming Server ◽  
Video Sharing ◽  
Short Video

In this thesis, we considered the effect of the content delivery network architecture on the popular short video sharing websites such as YouTube. The high number of users demanding videos impacts YouTube scalability which requires a new content delivery structure. Considering the high performance of P2P overlay networks, we propose an efficient peer-to-peer based system for short video sharing in the Internet in which all participant peers are responsible to distribute video replicas they have stored. This system comprises of a BitTorrent like network and a central media streaming server. To proficiently utilize P2P in our system, we propose some important approaches including an efficient and reliable indexing scheme, an efficient downloading strategy, a reliable content distribution mechanism, and a fairness policy. The simulations results demonstrate that the proposed system significantly increases client peers download speed while reduces the server workload and the startup delay for an improved playback quality.

scholarly journals Traffic engineering friendly request routing in content delivery network

2021 ◽  
Author(s):  
Arun Nanthakumaran
Keyword(s):  
Load Balancing ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Distribution Network ◽  
Content Delivery ◽  
Operational Efficiency ◽  
Content Delivery Network ◽  
Server Selection ◽  
Request Routing ◽  
Bottleneck Paths

Content delivery over Internet is optimized for low use perceived latency by designing specialized Content Distribution Network (CDN). Content servers are connected through a content switch the distributes client requests among them to achieve load balancing across the servers. The content switch is located one-hop away from the servers. Server load balancing is one factor in achieveing low user perceived latency and improving operational efficiency. Traffic engineering is another factor that is generally and integrated with serverload balancing for CDN optimization. In this thesis we propose a request routing algorithm for a CDN that was designed to integrate server selection and traffic engineering functions in the request routing system. The CDN employs MPLS in the network for traffic engineering. The proposed algorithm optimizes content delivery for user perceived latency by achieving server load balancing and network traffic loan manaement among alternative paths. It also improves operational efficiency of the CDN by eliminating bottleneck paths and increasing utilization of underutilized servers and paths.

Sign in / Sign up

Export Citation Format

Share Document