scholarly journals An Optimal Routing Algorithm in Service Customized 5G Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Haipeng Yao ◽  
Chao Fang ◽  
Yiru Guo ◽  
Chenglin Zhao

With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN), Content-Centric Networking (CCN), and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio networks face. Moreover, we design an optimal routing algorithm for this architecture, which can minimize average response hops in the network. Simulation results reveal that, by introducing the cache, the network performance can be obviously improved in different network conditions compared to the scenario without a cache. In addition, we explore the change of cache hit rate and average response hops under different cache replacement policies, cache sizes, content popularity, and network topologies, respectively.

Electronics ◽  
2018 ◽  
Vol 7 (10) ◽  
pp. 251 ◽  
Author(s):  
Kai-Sheng Chen

Multi-protocol label switching (MPLS) is a promising solution to implement high-speed internet protocol (IP) networks by reducing the layer number. To meet the increasing demand for data traffic, optical packet switching (OPS) is integrated under IP to provide high bandwidth to end users. Generalized MPLS (GMPLS) is perfectly compatible with the routing algorithm in IP/MPLS as it supports packet-switching functions. In this paper, we investigate the label stacking scenarios in GMPLS networks. In GMPLS, label stacking is done to reduce the node complexity by appending multiple labels to a single packet. Wavelength-division multiplexing (WDM) and optical code-division multiplexing (OCDM) signals have been widely used as identifying labels. As the labels can be permutated among the wavelengths or code dimensions, the structure of a label stack can be varied. However, studies on the relationship between label stacking scenarios and network performance are limited. To investigate this issue, we propose three label stacking models: sequential code distribution; sequential wavelength distribution, and random label distribution. The simulation results show that the sequential wavelength assignment, wherein the labels are uniformly distributed among the wavelengths, exhibits the best system performance in terms of the label-error rate (LER).


2014 ◽  
Vol 11 (3) ◽  
pp. 1113-1126 ◽  
Author(s):  
Hyoung Park ◽  
Il Yeo ◽  
Jongsuk Lee ◽  
Haengjin Jang

The network architecture of typical data centersis characterized bytiered networks and aggregation-based traffic controls. The emergence of big data makes it difficult for these data centers to incorporate big data service. The tier and aggregation based traffic management systems can magnify the seriousness of the traffic congestion and extend the congested region when big data moves around in the data center. As a consequence, big data has been forcing data centers to change their architecture dramatically. In this paper, we first address the important paradigm shifts of network architecture caused by big data traffic. We then show the new network architecture which resulted from our experience of the CERN LHC data service. Finally, we illustrate the effect of the throughput improvements of the proposed network architecture using a NS2 simulation.


Author(s):  
XI LUO ◽  
YING AN

Content centric networking (CCN) is a new networking paradigm to meet the growing demand for content access in the future. Because of its important role in accelerating content retrieval and reducing network transmission load, in-network caching has become one of the core technologies in CCN and has attracted wide attention. The existing caching schemes often lack sufficient consideration of node cache status and the temporal validity of user requests, and thus the cache efficiency of the network is greatly reduced. In this paper, a cache pressure-aware caching scheme is proposed, which comprehensively takes into account various factors such as content popularity, cache occupancy rate, cache replacement rate, and the validity period of the Interest packet to achieve reasonable cache placement and replacement. Simulation results show that the proposed scheme effectively improves the cache hit rate and the resource utilization while decreasing the average response hops.


2019 ◽  
Vol 11 (2) ◽  
pp. 28 ◽  
Author(s):  
Swaroopa Korla ◽  
Shanti Chilukuri

Recent interest in applications where content is of primary interest has triggered the exploration of a variety of protocols and algorithms. For such networks that are information-centric, architectures such as the Content-Centric Networking have been proven to result in good network performance. However, such architectures are still evolving to cater for application-specific requirements. This paper proposes T-Move, a light-weight solution for producer mobility and caching at the edge that is especially suitable for content-centric networks with mobile content producers. T-Move introduces a novel concept called trendiness of data for Content-Centric Networking (CCN)/Named Data Networking (NDN)-based networks. It enhances network performance and quality of service (QoS) using two strategies—cache replacement and proactive content-pushing for handling producer mobility—both based on trendiness. It uses simple operations and smaller control message overhead and is suitable for networks where the response needs to be quick. Simulation results using ndnSIM show reduced traffic, content retrieval time, and increased cache hit ratio with T-Move, when compared to MAP-Me and plain NDN for networks of different sizes and mobility rates.


Author(s):  
KUKUH NUGROHO ◽  
DHIMAS PRABOWO SETYANUGROHO

ABSTRAKPerangkat controller dalam jaringan SDN berfungsi untuk memberikan informasi tabel flow ke perangkat switch sebagai acuan dalam menentukan informasi rute. Kecepatan dalam memproses permintaan tabel flow yang dilakukan oleh perangkat switch tergantung dari pemilihan jenis controller yang digunakan. Terdapat beberapa jenis controller yang bisa digunakan untuk mengatur aliran trafik data dalam jaringan SDN. Pada penelitian ini akan digunakan jenis controller RouteFlow dengan menggunakan algoritma routing Djikstra. Jaringan uji menggunakan topologi Full-Mesh yang menyediakan koneksi penuh ke semua switch, dimana terdapat dua protokol layer transport yang digunakan untuk mengirimkan data dalam jaringan SDN yaitu TCP dan UDP. Hasil pengukuran kualitas jaringan menunjukkan bahwa penggunaan protokol UDP menghasilkan nilai delay, jitter, dan throughput yang lebih baik dibandingkan dengan TCP. Waktu konvergensi jaringan yang dihasilkan sebesar 12,18 ms ketika ukuran data yang dipertukarkan sebesar 64 Byte.Kata kunci: Controller, Full-Mesh, RouteFlow, Software Defined Network ABSTRACTThe controller device in the SDN network is applied to provide flow table information for all switches as a reference in determining route information. The speed in processing the flow table requests that are made by the switches depends on the choice of the type of controller used. There are several types of controllers that can be used to manage the data traffic flow in the SDN network. This research utilizes the RouteFlow controller and the Djikstra routing algorithm. The test network applies the Full-Mesh topology that provides fully connections to all switches, wherein two transport protocols are used to transmit data in SDN networks, i.e., TCP and UDP. The results of network performance measurements show that the use of the UDP obtains better values in delay, jitter, and throughput than TCP. The network convergence time is 12.18 ms when the size of data exchanged is set to 64 Bytes.Keywords: Controller, Full-Mesh, RouteFlow, Software Defined Network


2021 ◽  
Vol 12 (1) ◽  
pp. 344
Author(s):  
Salman Rashid ◽  
Shukor Abd Razak ◽  
Fuad A. Ghaleb

In-network caching is the essential part of Content-Centric Networking (CCN). The main aim of a CCN caching module is data distribution within the network. Each CCN node can cache content according to its placement policy. Therefore, it is fully equipped to meet the requirements of future networks demands. The placement strategy decides to cache the content at the optimized location and minimize content redundancy within the network. When cache capacity is full, the content eviction policy decides which content should stay in the cache and which content should be evicted. Hence, network performance and cache hit ratio almost equally depend on the content placement and replacement policies. Content eviction policies have diverse requirements due to limited cache capacity, higher request rates, and the rapid change of cache states. Many replacement policies follow the concept of low or high popularity and data freshness for content eviction. However, when content loses its popularity after becoming very popular in a certain period, it remains in the cache space. Moreover, content is evicted from the cache space before it becomes popular. To handle the above-mentioned issue, we introduced the concept of maturity/immaturity of the content. The proposed policy, named Immature Used (IMU), finds the content maturity index by using the content arrival time and its frequency within a specific time frame. Also, it determines the maturity level through a maturity classifier. In the case of a full cache, the least immature content is evicted from the cache space. We performed extensive simulations in the simulator (Icarus) to evaluate the performance (cache hit ratio, path stretch, latency, and link load) of the proposed policy with different well-known cache replacement policies in CCN. The obtained results, with varying popularity and cache sizes, indicate that our proposed policy can achieve up to 14.31% more cache hits, 5.91% reduced latency, 3.82% improved path stretch, and 9.53% decreased link load, compared to the recently proposed technique. Moreover, the proposed policy performed significantly better compared to other baseline approaches.


2020 ◽  
Vol 22 (5) ◽  
pp. 51-55
Author(s):  
OLEG N. KORCHAGIN ◽  
◽  
ANASTASIA V. LYADSKAYA ◽  

The article is devoted to the current state of digitalization aimed at solving urgent problems of combating corruption in the field of public administration and private business sector. The work considers the experience of foreign countries and the influence of digital technologies on the fight against corruption. It is noted that the digitalization of public administration is becoming one of the decisive factors for increasing the efficiency of the anti-corruption system and improving management mechanisms. Big Data, if integrated and structured according to the given parameters, allows the implementation of legislative, law enforcement, control and supervisory and law enforcement activities reliably and transparently. Big Data tools allow us to analyze processes, identify dependencies and predict corruption risks. The author describes the most significant problems that complicate the transfer of offline technologies into the online environment. The paper analyzes promising directions for the development of digital technologies that would lead to solving the arising problems, as well as to implement tasks that previously seemed unreachable. The article also describes current developments in the field of collecting and managing large amounts of data, the “Internet of Things”, modern network architecture, and other advances in the field of IT; the work provides applied examples of their potential use in the field of combating corruption. The study gives reasons that, in the context of combating corruption, digitalization should be allocated in a separate area of activity that is controlled and regulated by the state.


Photonics ◽  
2021 ◽  
Vol 8 (1) ◽  
pp. 11
Author(s):  
Fulong Yan ◽  
Changshun Yuan ◽  
Chao Li ◽  
Xiong Deng

Interconnecting networks adopting Fast Optical Switches (FOS) can achieve high bandwidth, low latency, and low power consumption. We propose and demonstrate a novel interconnecting topology based on FOS (FOSquare) with distributed fast flow control which is suitable for HPC infrastructures. We also present an Optimized Mapping (OPM) algorithm that maps the most communication-related processes inside a rack. We numerically investigate and compare the network performance of FOSquare with Leaf-Spine under real traffic traces collected by running multiple applications (CG, MG, MILC, and MINI_MD) in an HPC infrastructure. The numerical results show that the FOSquare can reduce >10% latency with respect to Leaf-Spine under the scenario of 16 available cores.


2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.


Author(s):  
Dao Xuan Uoc

Zigbee wireless network built on IEEE 802.15.4 standard is becoming one of the most popular wireless networks in modern IoT devices. One of the disadvantages of Zigbee networks is the short transmission distance between devices. This paper focuses on researching and comparing routing algorithms in Zigbee networks, thereby building the optimal routing algorithm in the existing system. The paper’s objective is to form the basis for making Zigbee tree and mesh networks, which improves the transmission distance for Zigbee networks better than the star network.


Sign in / Sign up

Export Citation Format

Share Document