scholarly journals A Hierarchical Cache Size Allocation Scheme Based on Content Dissemination in Information-Centric Networks

2021 ◽  
Vol 13 (5) ◽  
pp. 131
Author(s):  
Hongyu Liu ◽  
Rui Han
Keyword(s):  
Network Topology ◽  
Network Performance ◽  
Network Architectures ◽  
Content Dissemination ◽  
Cache Size ◽  
Space Allocation ◽  
Weight Calculation ◽  
Internet Information ◽  
Network Cache ◽  
The Impact

With the rapid growth of mass content retrieval on the Internet, Information-Centric Network (ICN) has become one of the hotspots in the field of future network architectures. The in-network cache is an important feature of ICN. For better network performance in ICN, the cache size on each node should be allocated in proportion to its importance. However, in some current studies, the importance of cache nodes is usually determined by their location in the network topology, ignoring their roles in the actual content transmission process. In this paper, we focus on the allocation of cache size for each node within a given total cache space budget. We explore the impact of heterogeneous cache allocation on content dissemination under the same ICN infrastructure and we quantify the importance of nodes from content dissemination and network topology. To this purpose, we implement a hierarchy partitioning method based on content dissemination, then we formulate a set of weight calculation methods for these hierarchies and to provide a per-node cache space allocation to allocate the total cache space budget to each node in the network. The performance of the scheme is evaluated on the Garr topology, and the average hit ratio, latency, and load are compared to show that the proposed scheme has better performance in these aspects than other schemes.

ANALYSIS OF THE PERFORMANCE OF REACTIVE ROUTING PROTOCOLS IN VANET BASED ON NS3

2021 ◽  
Vol 55 (3) ◽  
pp. 90-97
Author(s):  
AMANI AHMAD SABBAGH ◽  
◽  
SHCHERBAKOV MAXIM V. ◽  
Keyword(s):  
Ad Hoc Networks ◽  
Network Topology ◽  
Routing Protocols ◽  
Network Performance ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Delivery Ratio ◽  
Self Administration ◽  
Hoc Networks ◽  
The Impact

Since importance of improving of Intelligent Transportation System (ITS) always follow modern trends by using new wireless communication technologies, the trend of latest research topics is focusing on Vehicular Ad Hoc Network (VANET). VANET networks play a vital role in ITS due to their increasing importance for the building of ITS. VANET is a subclass of mobile ad-hoc networks (MANET). VANET depends on wireless technologies to establish communication between moving vehicles (nodes). An appropriate and efficient routing protocol helps to successful exchange data between mobility nodes in vehicular ad-hoc networks. VANET has a lot of similar features to MANETs such as finite bandwidth, self-arrangement, self-administration, and unstable network topology. Except it has some important features of its characteristic such as very high node mobility, delay restrictions, and frequent network outages. For this reason, routing in VANET networks is much more complex than routing in MANET networks. The purpose of this study - to evaluate the performance of protocols AODV (Ad hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) and their impact on the performance of networks VANET. This paper differs in that it analyses the impact of network size at a large number of nodes, and different vehicle speeds on network performance metrics like packet delivery ratio, throughput, average delay, overhead and packet loss ratio and assessing the level of network performance at realistic mobility scenarios for the movement of vehicles in the street generated by Bonnmotion tool. Also, the simulation is carried out in NS-3 simulator to create VANET network topology and routing protocols.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

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.

scholarly journals Cooperation and information replication in wireless networks

2016 ◽  
Vol 374 (2062) ◽  
pp. 20150123 ◽  
Author(s):  
Konstantinos Poularakis ◽  
Leandros Tassiulas
Keyword(s):  
Network Performance ◽  
Access Network ◽  
Network Architectures ◽  
Backbone Networks ◽  
Network Bandwidth ◽  
Multicast Service ◽  
Radio Access ◽  
Maximum Benefit ◽  
Wireless Medium ◽  
Cell Tower

A significant portion of today's network traffic is due to recurring downloads of a few popular contents. It has been observed that replicating the latter in caches installed at network edges—close to users—can drastically reduce network bandwidth usage and improve content access delay. Such caching architectures are gaining increasing interest in recent years as a way of dealing with the explosive traffic growth, fuelled further by the downward slope in storage space price. In this work, we provide an overview of caching with a particular emphasis on emerging network architectures that enable caching at the radio access network. In this context, novel challenges arise due to the broadcast nature of the wireless medium, which allows simultaneously serving multiple users tuned into a multicast stream, and the mobility of the users who may be frequently handed off from one cell tower to another. Existing results indicate that caching at the wireless edge has a great potential in removing bottlenecks on the wired backbone networks. Taking into consideration the schedule of multicast service and mobility profiles is crucial to extract maximum benefit in network performance.

scholarly journals Performance Analysis of Wireless Local Area Network for a High-/Low-Priority Traffic Ratio at Different Numbers of Access Categories

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 693
Author(s):  
Kvitoslava Obelovska ◽  
Olga Panova ◽  
Vincent Karovič
Keyword(s):  
Network Performance ◽  
Wireless Local Area Network ◽  
Local Area Network ◽  
Local Area ◽  
Area Network ◽  
Large Network ◽  
Medium Access ◽  
Massive Growth ◽  
Adaptive Adjustment ◽  
The Impact

The performance of Wireless Local Area Network (WLAN) is highly dependent on the processes that are implemented in the Medium Access Control (MAC) sublayer regulated by the IEEE 802.11 standard. In turn, various parameters affect the performance of the MAC sublayer, the most important of which is the number of stations in the network and the offered load. With the massive growth of multimedia traffic, research of the network performance depending on traffic types is relevant. In this paper, we present the impact of a high-/low-priority traffic ratio on WLAN performance with different numbers of access categories. The simulation results show different impact of high-/low-priority traffic ratio on the performance of the MAC sublayer of wireless LANs depending on different network-sizes and on network conditions. Performance of the large network with two access categories and with the prevalent high-priority traffic is significantly higher than in the case of using four categories on the MAC sublayer. This allows us to conclude that the performance improvement of the large network with the prevalent high-priority traffic can be achieved by an adaptive adjustment of the access categories number on the MAC sublayer.

Toward Online Control of Local Bifurcation in Power Systems via Network Topology Optimization

2015 ◽  
Vol 25 (12) ◽  
pp. 1550167
Author(s):  
Lei Wang ◽  
Hsiao-Dong Chiang
Keyword(s):  
Topology Optimization ◽  
Power Systems ◽  
Transmission Line ◽  
Network Topology ◽  
Online Control ◽  
Power Grids ◽  
Local Bifurcations ◽  
Network Topology Optimization ◽  
Online Methods ◽  
The Impact

This paper presents online methods for controlling local bifurcations of power grids with the goal of increasing bifurcation values (i.e. increasing load margins) via network topology optimization, a low-cost control. In other words, this paper presents online methods for increasing power transfer capability subject to static stability limit via switching transmission line out/in (i.e. disconnecting a transmission line or connecting a transmission line). To illustrate the impact of network topology on local bifurcations, two common local bifurcations, i.e. saddle-node bifurcation and structure-induced bifurcation on small power grids with different network topologies are shown. A three-stage online control methodology of local bifurcations via network topology optimization is presented to delay local bifurcations of power grids. Online methods must meet the challenging requirements of online applications such as the speed requirement (in the order of minutes), accuracy requirement and robustness requirement. The effectiveness of the three-stage methodology for online applications is demonstrated on the IEEE 118-bus and a 1648-bus practical power systems.

scholarly journals Virtual Networking Performance in OpenStack Platform for Network Function Virtualization

2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Franco Callegati ◽  
Walter Cerroni ◽  
Chiara Contoli
Keyword(s):  
Cloud Computing ◽  
Network Performance ◽  
Network Virtualization ◽  
Network Function Virtualization ◽  
Network Architectures ◽  
Cloud Data ◽  
Network Function ◽  
Computing Platform ◽  
Central Offices ◽  
The One

The emerging Network Function Virtualization (NFV) paradigm, coupled with the highly flexible and programmatic control of network devices offered by Software Defined Networking solutions, enables unprecedented levels of network virtualization that will definitely change the shape of future network architectures, where legacy telco central offices will be replaced by cloud data centers located at the edge. On the one hand, this software-centric evolution of telecommunications will allow network operators to take advantage of the increased flexibility and reduced deployment costs typical of cloud computing. On the other hand, it will pose a number of challenges in terms of virtual network performance and customer isolation. This paper intends to provide some insights on how an open-source cloud computing platform such as OpenStack implements multitenant network virtualization and how it can be used to deploy NFV, focusing in particular on packet forwarding performance issues. To this purpose, a set of experiments is presented that refer to a number of scenarios inspired by the cloud computing and NFV paradigms, considering both single tenant and multitenant scenarios. From the results of the evaluation it is possible to highlight potentials and limitations of running NFV on OpenStack.

scholarly journals Design and Efficient Network Investigation of Passive Periodic Drop Attack

2021 ◽  
Vol 13 (0203) ◽  
pp. 110-116
Author(s):  
Sunil Kumar ◽  
Maninder Singh
Keyword(s):  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Denial Of Service ◽  
High Mobility ◽  
Network Simulator ◽  
Denial Of Service Attack ◽  
Drop Attack ◽  
Service Attack ◽  
The Impact

A Mobile Ad Hoc Network (MANET) is much more vulnerable to various security attacks due to its high mobility, multi-hop communication and the absence of centralized administration. In this paper, we investigate the impact of Jellyfish periodic dropping attack on MANETs under different routing protocols. This investigate is under the class of denial-of-service attack and targets closed loop flows which results in delay and data loss. In this paper, the simulation results are gathered using OPNET network simulator and its effect on network performance is studied by analysing re-transmission attempts, network load and throughput. The results have shown that the impact of Jellyfish periodic dropping attack which reduces the network performance. Performance shows OLSR performs better than AODV under periodic drop attack.

scholarly journals Neural network models of the tactile system develop first-order units with spatially complex receptive fields

2017 ◽  
Author(s):  
Charlie W. Zhao ◽  
Mark J. Daley ◽  
J. Andrew Pruszynski
Keyword(s):  
Neural Network ◽  
Network Performance ◽  
Receptive Fields ◽  
Network Models ◽  
Network Architectures ◽  
Learning Tools ◽  
Neural Network Models ◽  
First Order ◽  
Wide Range ◽  
Tactile System

AbstractFirst-order tactile neurons have spatially complex receptive fields. Here we use machine learning tools to show that such complexity arises for a wide range of training sets and network architectures, and benefits network performance, especially on more difficult tasks and in the presence of noise. Our work suggests that spatially complex receptive fields are normatively good given the biological constraints of the tactile periphery.

Sign in / Sign up

Export Citation Format

Share Document