scholarly journals Redundancy Gateway Menggunakan Metode Failover dan Load Sharing Gateway

2020 ◽  
Vol 9 (1) ◽  
pp. 22-31
Author(s):  
Rachmat Adi Purnama ◽  
Firmansyah Firmansyah
Keyword(s):  
Packet Loss ◽  
Heavy Traffic ◽  
Load Sharing ◽  
Link Failures ◽  
Transfer Data ◽  
Data Packets ◽  
Traffic Loads

Failure to transfer data packets on a network becomes a big threat, both caused by link failures and heavy traffic loads. To maintain stability in the network, the VRRP gateway redundancy protocol is applied. From the results of the research conducted, it takes an average time to failover for 3.75ms from the master router to the backup router and an average packet loss that occurs as many as 3 packets and the average time needed to failover from the backup router back to master router for 1.37ms and 1.5 packet loss occurred. The results of load sharing research are able to make 1 router device as a master router in 2 VRID at once. Implementing both Failover and Load Sharing methods can improve connectivity in the network by ensuring connectivity can run stably and equally. Failover is used as a backup gateway redundancy and load sharing is used to divide the gateway load equally.

Congestion-Free Transient Plane (CFTP) Using Bandwidth Sharing During Link Failures in SDN

2019 ◽  
Vol 63 (6) ◽  
pp. 832-843
Author(s):  
Muthumanikandan Vanamoorthy ◽  
Valliyammai Chinnaiah
Keyword(s):  
Packet Loss ◽  
Effective Bandwidth ◽  
Bandwidth Utilization ◽  
Bandwidth Sharing ◽  
Link Failures ◽  
Data Packets ◽  
Multiple Flows ◽  
Flow Table ◽  
Speed Up ◽  
Plane Technique

Abstract Software-defined networking (SDN) is an emerging trend where the control plane and the data plane are separated from each other, culminating in effective bandwidth utilization. This separation also allows multi-vendor interoperability. Link failure is a major problem in networking and must be detected as soon as possible because when a link fails the path becomes congested and packet loss occurs, delaying the delivery of packets to the destination. Backup paths must be configured immediately when a failure is detected in the network to speed up packet delivery, avoid congestion and packet loss and provide faster convergence. Various SDN segment protection algorithms that efficiently reduce CPU cycles and flow table entries exist, but each has drawbacks. An independent transient plane technique can be used to reduce packet loss but is not as efficient when multiple flows try to share the same link. The proposed work focuses on reducing congestion, providing faster convergence with minimal packet loss and effectively utilizing link bandwidth using bandwidth-sharing techniques. An analysis and related studies show that this method performs better and offers a more reliable network without loss, while simultaneously ensuring the swift delivery of data packets toward the destination without congestion, compared to the other existing schemes.

Evaluation of Fatigue Properties for Ultraviolet Radiation Aged Bitumen and Mixture

2011 ◽  
Vol 217-218 ◽  
pp. 181-186
Author(s):  
Shao Peng Wu ◽  
Jun Han ◽  
Xing Liu
Keyword(s):  
Ultraviolet Radiation ◽  
Heavy Traffic ◽  
Testing Machine ◽  
Road Construction ◽  
Fatigue Properties ◽  
Repeated Loading ◽  
Uv Aging ◽  
Traffic Loads ◽  
Universal Testing ◽  
Layered Clay

Bitumen is widely used in road construction. Due to heavy traffic loads and environmental factors, bitumen properties will change during service life. Bitumen will age due to diffusion of oxygen and UV radiation. Repeated loading will result in decreasing strength because of fatigue. In this paper, one layer clay powder was used to modify base bitumen with different mass contents. Then the influences of ultraviolet radiation (UV) aging on the dynamic fatigue properties of the layered clay powder were evaluated by Dynamic Shear Rheomoter (DSR) and Universal Testing Machine (UTM). The ageing evaluation shows that the ageing resistance of bitumen is improved and this improvement is more notable in bitumen fatigue than mixture.

Efficient Intrusion Detection for High-Speed Networks

2012 ◽  
Vol 263-266 ◽  
pp. 2915-2919
Author(s):  
Gao Long Ma ◽  
Wen Tang
Keyword(s):  
Intrusion Detection ◽  
Error Detection ◽  
Intrusion Detection System ◽  
High Speed ◽  
Detection System ◽  
Heavy Traffic ◽  
High Speed Networks ◽  
Network Intrusion ◽  
Traffic Loads ◽  
Rule Sets

With the great increasing of high-speed networks,the traditional network intrusion detection system(NIDS) has a serious problem with handling heavy traffic loads in real-time ,which may result in packets loss and error detection . In this paper we will introduce the efficient load balancing scheme into NIDS and improve rule sets of the detection engine so as to make NIDS more suitable to high-speed networks environment.

HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING

1999 ◽  
Vol 13 (3) ◽  
pp. 251-273 ◽  
Author(s):  
Philip J. Fleming ◽  
Burton Simon
Keyword(s):  
State Space ◽  
Heavy Traffic ◽  
Joint Probability ◽  
Mass Function ◽  
Accurate Estimate ◽  
The State ◽  
Probability Mass Function ◽  
Traffic Loads ◽  
Wide Range ◽  
Heavy Traffic Approximations

We consider an exponential queueing system with multiple stations, each of which has an infinite number of servers and a dedicated arrival stream of jobs. In addition, there is an arrival stream of jobs that choose a station based on the state of the system. In this paper we describe two heavy traffic approximations for the stationary joint probability mass function of the number of busy servers at each station. One of the approximations involves state-space collapse and is accurate for large traffic loads. The state-space in the second approximation does not collapse. It provides an accurate estimate of the stationary behavior of the system over a wide range of traffic loads.

scholarly journals BAHAN TAMBAH SERAT ECENG GONDOK PADA LASTON TIPE XI TERHADAP INDEKS MARSHALL TEST MENGGUNAKAN KERIKIL MANTUP

UKaRsT ◽  
2018 ◽  
Vol 2 (2) ◽  
pp. 8
Author(s):  
Sugeng Dwi Hartantyo ◽  
Rasiyo Hepiyanto
Keyword(s):  
Asphalt Concrete ◽  
Water Hyacinth ◽  
Heavy Traffic ◽  
Asphalt Mixture ◽  
Cellulose Fiber ◽  
Fine Aggregate ◽  
Traffic Loads ◽  
Marshall Test ◽  
Technical Specifications

Laston is a mixture of coarse aggregate, fine aggregate, and filler with a binder under the temperature of 145-155oC with the composition being studied and regulated by technical specifications. Laston is also known as AC (Asphalt Concrete).Laston itself is commonly used in Indonesia with continuous gradations used for heavy traffic loads. To get the addictive material is not easy and the material is expensive. Therefore, it is necessary to find alternatives to the cellulose fiber. Water hyacinth is a water weed that once grow and develop, it has high cellulose fiber content, which is about 60%.For that, done a research to add a hot asphalt mixture material that aims to improve the quality of mixed result. The selected material is natural water hyacinth. The method used is trial and error with reference of SNI 03-1737-1989. Variations used are 3%, 5%, and 7% of the asphalt weight, asphalt level used Is 5.61%.The result of this study is Marshall evaluation where the greatest score obtained for stability is 1325 kg,  Flow is 3.73 mm, Quotient Marshall is 401.02 kg/mm, VMA is 66.30%, VFWA is 19.25%, and VIM score is 54.35 %. With this result, the asphalt mixture can not be used because the results of VMA, VFWA, and VIM have not been suitable on specification of SNI 03-1737-1989.  Keywords: Laston, Asphalt Concrete, Water Hyacinth, SNI 03-1737-1989.

scholarly journals ANALYSIS OF USER MOBILITY PERFORMANCE ON SOFTWARE DEFINED WIRELESS NETWORK USING DIJKSTRA ALGORITHM

2021 ◽  
Vol 2 (2) ◽  
pp. 127-133
Author(s):  
Icha Nurlaela Khoerotunisa ◽  
Sofia Naning Hertiana ◽  
Ridha Muldina Negara
Keyword(s):  
Wireless Network ◽  
Packet Loss ◽  
Network Performance ◽  
User Mobility ◽  
Dijkstra Algorithm ◽  
High Complexity ◽  
Quality Of Data ◽  
Data Packets ◽  
Mobility Performance

  Over the last decade, wireless devices have developed rapidly until predictions will develop with high complexity and dynamic. So that new capabilities are needed for wireless problems in this problem. Software Defined Network (SDN) is generally a wire-based network, but to meet the needs of users in terms of its implementation, it has begun to introduce a Wireless-based SDN called Software Defined Wireless Network (SDWN) which provides good service quality and reach and higher tools, so as to be able to provide new capabilities to wireless in a high complexity and very dynamic. When SDN is implemented in a wireless network it will require a routing solution that chooses paths due to network complexity. In this paper, SDWN is tested by being applied to mesh topologies of 4,6 and 8 access points (AP) because this topology is very often used in wireless-based networks. To improve network performance, Dijkstra's algorithm is added with the user mobility scheme used is RandomDirection. The Dijkstra algorithm was chosen because it is very effective compared to other algorithms. The performance measured in this study is Quality of Service (QoS), which is a parameter that indicates the quality of data packets in a network. The measurement results obtained show that the QoS value in this study meets the parameters considered by the ITU-T G1010 with a delay value of 1.3 ms for data services and packet loss below 0.1%. When compared with the ITU-T standard, the delay and packet loss fall into the very good category.

scholarly journals Reinforcement learning-based link adaptation in long delayed underwater acoustic channel

2019 ◽  
Vol 283 ◽  
pp. 07001 ◽  
Author(s):  
Jingxi Wang ◽  
Chau Yuen ◽  
Yong Liang Guan ◽  
Fengxiang Ge
Keyword(s):  
Reinforcement Learning ◽  
Learning Strategy ◽  
Learning Algorithm ◽  
Optimal Parameters ◽  
Underwater Acoustic Channel ◽  
Transfer Data ◽  
Data Packets ◽  
Significant Area ◽  
Channel Environment ◽  
Self Learning

In this paper, we apply reinforcement learning, a significant area of machine learning, to formulate an optimal self-learning strategy to interact in an unknown and dynamically variable underwater channel. The dynamic and volatile nature of the underwater channel environment makes it impossible to employ pre-knowledge. In order to select the optimal parameters to transfer data packets, by using reinforcement learning, this problem could be resolved, and better throughput could be achieved without any environmental pre-information. The slow sound velocity in an underwater scenario, means that the delay of transmitting packet acknowledgement back to sender from the receiver is material, deteriorating the convergence speed of the reinforcement learning algorithm. As reinforcement learning requires a timely acknowledgement feedback from the receiver, in this paper, we combine a juggling-like ARQ (Automatic Repeat Request) mechanism with reinforcement learning to minimize the long-delayed reward feedback problem. The simulation is accomplished by OPNET.

Sign in / Sign up

Export Citation Format

Share Document