scholarly journals A Bit Torrent Traffic Optimization Method for Enhancing the Stability of Network Traffic

Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 361
Author(s):  
Deguang Li ◽  
Yongxin Zhang ◽  
Shijie Jia ◽  
Dong Liu ◽  
Yanling Jin ◽  
...  
Keyword(s):  
Network Traffic ◽  
Network Performance ◽  
Optimization Method ◽  
Peer To Peer ◽  
Simulation Experiments ◽  
Network Resource ◽  
Traffic Matrix ◽  
The Stability ◽  
Traffic Optimization ◽  
Real Traffic

With the extensive use of peer-to-peer applications in recent years, the network traffic becomes more dynamic and less predictable, which leads to the decline of network resource utilization and the degradation of network performance. Aiming towards the above problems, we explore how to strengthen the cooperation between peer-to-peer applications and networks, making the application adjust its own traffic mode according to current network traffic status to enhance the stability of network traffic. We improve two key algorithms of peer selection and choking/unchoking in the protocol and introduce traffic relaxation to characterize traffic state while taking the current most popular peer-to-peer application (bit torrent protocol) as an example. In our improved method, peers are selected probabilistically according their traffic relaxation, and the double-parameter selection problem that simultaneously considers the traffic relaxation and transfer rate of peers is also solved. Finally, we conduct simulation experiments in two real network typologies with real traffic matrix data and different sizes of bit torrent swarms; the experimental results show that our method can significantly improve the stability of the network traffic without sacrificing or even improving the performance of the bit torrent protocol when compared with original BT protocol.

scholarly journals SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems

Algorithms ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 150 ◽  
Author(s):  
Mohammed  Gharib ◽  
Marzieh Malekimajd ◽  
Ali Movaghar
Keyword(s):  
Network Traffic ◽  
Network Performance ◽  
Overlay Networks ◽  
Peer To Peer ◽  
Cloud Systems ◽  
P2p Systems ◽  
Trip Time ◽  
Computational Capability ◽  
Efficient Data ◽  
Overlay Graph

Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.

On the Stability of Peer-to-Peer Networks in Real-World Environments

2009 ◽  
pp. 622-630
Author(s):  
Zoltán Czirkos ◽  
Gábor Hosszú
Keyword(s):  
Computer Networks ◽  
Real World ◽  
Network Traffic ◽  
Peer To Peer ◽  
Central Point ◽  
The Other ◽  
Peer Networks ◽  
Client Server ◽  
Peer To Peer Networks ◽  
The Stability

Communication in computer networks can be organized in two different ways, according to the client/ server model and the peer-to-peer model (Spinellis & Androutsellis-Theotokis, 2004). In the client/server model, the network is centralized. There is one host on the network, the server, which provides services to its clients. Its network address is usually well-known. On the other hand, in the peer-to-peer model, there is no central point in the network. Hosts participating are sometimes called “servents” (Gnutella, 2006), as they act both as servers and as clients at the same time: they provide services to other servents, while they also use the services of others. Nodes in unstructured peer-to-peer networks usually communicate via message flooding. For example, a search request for a given file in the Gnutella network is sent to all neighboring servents. However, this solution is not scalable, and it generates a lot of unnecessary network traffic.

scholarly journals FOSquare: A Novel Optical HPC Interconnect Network Architecture Based on Fast Optical Switches with Distributed Optical Flow Control

Photonics ◽  
2021 ◽  
Vol 8 (1) ◽  
pp. 11
Author(s):  
Fulong Yan ◽  
Changshun Yuan ◽  
Chao Li ◽  
Xiong Deng
Keyword(s):  
Flow Control ◽  
Network Architecture ◽  
Network Performance ◽  
Optical Switches ◽  
Low Power Consumption ◽  
Low Latency ◽  
High Bandwidth ◽  
Fast Flow ◽  
Real Traffic ◽  
Interconnect Network

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.

scholarly journals Deep learning based network traffic matrix prediction

2021 ◽  
Vol 2 ◽  
pp. 46-56
Author(s):  
Dalal Aloraifan ◽  
Imtiaz Ahmad ◽  
Ebrahim Alrashed
Keyword(s):  
Deep Learning ◽  
Network Traffic ◽  
Traffic Matrix

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.

METHOD OF INCREASING THE STABILITY OF THE INFORMATION AND COMMUNICATION NETWORK UNDER THE INFLUENCE OF THE ENEMY BASED ON THE DETERMINATION OF THE REFERENCE NETWORK VERSION

2020 ◽  
Author(s):  
С.А. БАГРЕЦОВ ◽  
Э.А. БУДАРИН ◽  
О.С. ЛАУТА ◽  
М.В. МИТРОФАНОВ
Keyword(s):  
Communication Network ◽  
Information Flow ◽  
Network Traffic ◽  
Communication Systems ◽  
Reference Network ◽  
Computing Systems ◽  
Electronic Warfare ◽  
Information And Communication ◽  
The Stability

Сетевой трафик, проходящий через современные вычислительные системы, представляет собой огромный информационный поток, который содержит сведения различной степени важности. Показана необходимость использования наиболее рациональных приемов повышения устойчивости сети в радиоэлектронной борьбе, чтобы заставить противника затрачивать больше времени на подбор новых принципов воздействия на системы связи. Network traffic passing through modern computing systems is a huge information flow, which contains information of varying degrees of importance. It is shown the necessity of using the most rational methods of increasing the stability of the network in electronic warfare to force the enemy to spend more time on selecting new principles of influence on communication systems.

Modification of Neuron PID Control in Case of Improper Learning Factors

2012 ◽  
Vol 433-440 ◽  
pp. 6795-6801
Author(s):  
Xue Gui Zhu ◽  
Zhi Hong Fu ◽  
Xing Zhe Hou
Keyword(s):  
Steady State ◽  
Reference Signal ◽  
Stability And Convergence ◽  
Simulation Experiments ◽  
Slow Dynamic ◽  
Penalty Factor ◽  
The Stability ◽  
Learning Factors ◽  
Control Output ◽  
Reference Input

Some modifications of conventional neuron proportional-integral-differential controller (NPID) are presented in this paper to prevent its slow dynamic response and loss of control in case of improper learning factors. The quasi-step signal replaces the step signal as the reference signal to improve the dynamic characteristics. The control output of NPID is modified every step by multiplying a penalty factor called senior teacher signal to suppress further the overshoot and compress the settling time. The steady-state error from the modified NPID (MNPID) is reduced or removed by adjusting dynamically reference input signal while excluding the pseudo steady state. Lots of simulation experiments are done to prove the stability and convergence of the MNPID control algorithm.

scholarly journals An Efficient Leader Node Selection for Movable Nodes in WSN using PSO Technique

2019 ◽  
Vol 8 (6) ◽  
pp. 5072-5078
Keyword(s):  
Energy Efficient ◽  
Network Performance ◽  
Clustering Algorithm ◽  
Group Formation ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Efficient Prediction ◽  
The Stability ◽  
Effective Group

Wireless Sensor Networks (WSN) is a group of sensor devices, which are used to sense the surroundings. The network performance is still an issue in the WSN and an efficient protocol is introduced such as LEACH. To improve the stability, LEACH with fuzzy descriptors is used in preceding research. However the existing has drawback with effective group formation in heterogeneous WSN and also it is not achieved the Super Leader Node (SLH). To overcome the above mentioned issues, the proposed system enhances the approach which is used for increasing the energy consumption, packet delivery ratio, and bandwidth and network lifetime. The proposed paper contains three phases such as grouping formation, Leader Node (LN) selection, SLN selection with three main objectives:(i) to acquire Energy-Efficient Prediction Clustering Algorithm (EEPCA) in heterogeneous WSN for grouping formation (ii)To design Low Energy Adaptive Clustering Hierarchy- Expected Residual Energy (LEACH-ERE) protocol for LN selection.(iii)To optimize the SCH selection by Particle Swarm Optimization (PSO) based fuzzy approach. The clustering formation is done by Energy-Efficient Prediction Clustering Algorithm (EEPCA) in heterogeneous WSN. It is used to calculate the sensor nodes which have shortest distance between each node. The LEACH-ERE protocol was proposed to form a Leader Node (LN) and all the nodes has to communicate with sink through LN only. New SLN is elected based on distance from the sink and battery power of the node.

Sign in / Sign up

Export Citation Format

Share Document