scholarly journals Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG)

2021 ◽  
Author(s):  
Amro A. Sabbagh
Keyword(s):  
Routing Protocol ◽  
Path Selection ◽  
Convergence Time ◽  
Stability And Convergence ◽  
The Internet ◽  
Standard Protocol ◽  
The Past ◽  
Reasonable Solution ◽  
Stable Path ◽  
Sheer Size

BGP is the standard inter-domain routing protocol of the internet. It has proven to be scalable enough to accommodate the exceptional growth of the Internet. However, because of the sheer size of the Internet and the complexity of its topology, the behaviour of BGP can be unpredictable sometimes. Researchers have been proposing various changes and enhancements in the past 10 to 15 years to improve the security, stability and convergence of BGP. Some of the solutions have been adopted, but BGP is still suffering from possible deficiencies when it comes to convergence time and stability at specific situations and scenarios. In this thesis, we focus on providing a reasonable solution for the problem of BGP instability but without causing long convergence, which leads eventually into minimizing BGP churn and path exploration. We, first, analyse the current BGP standard protocol and previous proposed solutions. Then, we study current problems associated with a recently proposed improvement, suggest a new algorithm that avoids path selection problem at the aggregator and the path shortening problem. We also describe its implementation in OPNET. Finally, we show the results from our simulation and compare them to the results of previous work suggested. Our results show a great improvement of the convergence of BGP while preserving reachability and optimality all the time.

scholarly journals Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG)

2021 ◽  
Author(s):  
Amro A. Sabbagh
Keyword(s):  
Routing Protocol ◽  
Path Selection ◽  
Convergence Time ◽  
Stability And Convergence ◽  
The Internet ◽  
Standard Protocol ◽  
The Past ◽  
Reasonable Solution ◽  
Stable Path ◽  
Sheer Size

BGP is the standard inter-domain routing protocol of the internet. It has proven to be scalable enough to accommodate the exceptional growth of the Internet. However, because of the sheer size of the Internet and the complexity of its topology, the behaviour of BGP can be unpredictable sometimes. Researchers have been proposing various changes and enhancements in the past 10 to 15 years to improve the security, stability and convergence of BGP. Some of the solutions have been adopted, but BGP is still suffering from possible deficiencies when it comes to convergence time and stability at specific situations and scenarios. In this thesis, we focus on providing a reasonable solution for the problem of BGP instability but without causing long convergence, which leads eventually into minimizing BGP churn and path exploration. We, first, analyse the current BGP standard protocol and previous proposed solutions. Then, we study current problems associated with a recently proposed improvement, suggest a new algorithm that avoids path selection problem at the aggregator and the path shortening problem. We also describe its implementation in OPNET. Finally, we show the results from our simulation and compare them to the results of previous work suggested. Our results show a great improvement of the convergence of BGP while preserving reachability and optimality all the time.

scholarly journals Reducing convergence time along with improvement in path service quality of border gateway protocol

2018 ◽  
Vol 7 (2.31) ◽  
pp. 203
Author(s):  
Arushi Agarwal ◽  
Ayushi Pandey
Keyword(s):  
Quality Of Service ◽  
Service Quality ◽  
Routing Protocol ◽  
Autonomous Systems ◽  
Border Gateway Protocol ◽  
Convergence Time ◽  
The Internet ◽  
Bgp Routing

Border Gateway Protocol (BGP) is an exterior gateway routing protocol used between various autonomous systems across the internet. BGP helps in selecting the best route for the transmission of data among the users. The transmission policy followed by BGP should be such that it should increase BGP routing performances. This work aims to reduce the convergence time of the network with the improvement of QOS (Quality of Service) in the routing of Border Gateway Protocol. Our results show that we can obtain a reduced framework environment which has a best routing path with better energy and quality, along with reduction in convergence time. 

Performance Analysis of Mesh Based Enterprise Network Using RIP, EIGRP and OSPF Routing Protocols

2021 ◽  
Vol 10 (1) ◽  
pp. 47
Author(s):  
Md. Humayun Kabir ◽  
Md. Ahasan Kabir ◽  
Md. Saiful Islam ◽  
Mohammad Golam Mortuza ◽  
Mohammad Mohiuddin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Critical Role ◽  
Data Access ◽  
Convergence Time ◽  
Wireless Sensor ◽  
The Internet ◽  
Enterprise Network

Computer network communication is quickly growing in this pandemic situation. Phone conferencing, video streaming and sharing file/printing are all made easier with communications technologies. Data transmitted in time with little interruption become a significant achievement of wireless sensor networks (WSNs). A massive network is interconnection computer networks in the globe connected by the Internet, and the Internet plays a critical role in WSNs. Data access is a key element of any enterprise network, and the routing protocol is used to transmit data or access data. Due to the growing use of WSNs, it is essential to know about the network structure, the routing protocol. The routing protocols must be used to route all data sent over the Internet between the source and the destination. Which chooses the optimum routes between any two nodes in an enterprise network. This research focused on how the routing table will determine the optimum path/route of data packets to be transmitted from source to destination. The performance of three routing protocols, Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF), is investigated in this research for the massive mesh based enterprise wireless sensor network. We also investigated the behaviors of end-to-end packet latency, convergence time on flapping connections and average point-to-point throughput (bits/sec) between network links. Finally, the simulation results are compared to the efficacy and performance of these protocols implemented in the wireless LAN and internet-based wireless sensor network.

scholarly journals History-based consistency algorithm for the trickle-timer with low-power and lossy networks

2021 ◽  
Vol 11 (3) ◽  
pp. 2569
Author(s):  
Firas A. Albalas ◽  
Haneen Taamneh ◽  
Wail E. Mardini
Keyword(s):  
Power Consumption ◽  
Low Power ◽  
Routing Protocol ◽  
Convergence Time ◽  
Limited Resources ◽  
The Internet ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Main Components ◽  
The Internet Of Things

Recently, the internet of things (IoT) has become an important concept which has changed the vision of the Internet with the appearance of IPv6 over low power and lossy networks (6LoWPAN). However, these 6LoWPANs have many drawbacks because of the use of many devices with limited resources; therefore, suitable protocols such as the Routing Protocol for low power and lossy networks (RPL) were developed, and one of RPL's main components is the trickle timer algorithm, used to control and maintain the routing traffic frequency caused by a set of control messages. However, the trickle timer suffered from the short-listen problem which was handled by adding the listen-only period mechanism. This addition increased the delay in propagating transmissions and resolving the inconsistency in the network. However, to solve this problem we proposed the history based consistency algorithm (HBC), which eliminates the listen-only period based on the consistency period of the network. The proposed algorithm showed very good results. We measured the performance of HBC trickle in terms of convergence time; which was mainly affected, the power consumption and the packet delivery ratio (PDR). We made a comparison between the original trickle timer, the E-Trickle, the optimized trickle and our HBC trickle algorithm. The PDR and the power consumption showed in some cases better results under the HBC trickle compared to other trickle timers and in other cases the results were very close to the original trickle indicating the efficiency of the proposed trickle in choosing optimal routes when sending messages.

scholarly journals VaSe-MRP: Velocity-aware and stability-estimation–based multi-path routing protocol in flying ad hoc network

2019 ◽  
Vol 15 (11) ◽  
pp. 155014771988312 ◽  
Author(s):  
Zhongyu Ma ◽  
Qun Guo ◽  
Ji Ma ◽  
Zhe Zhang ◽  
Hongfeng Ma ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Path Selection ◽  
Convergence Time ◽  
Survival Duration ◽  
Long Distance ◽  
Routing Overhead ◽  
Stability Estimation

Flying ad hoc network is widely used in many military and civilian scenarios. Compared with mobile ad hoc network and vehicular ad hoc network, flying ad hoc network holds some special characteristics such as high mobility, long-distance communication, and sparse node-deployment, which cause an important challenge in the design of routing protocols. In this article, a velocity-aware and stability-estimation–based multi-path routing protocol is proposed for flying ad hoc network. The protocol is mainly composed of two important parts, which are the routing discovery mechanism and routing maintenance mechanism. In routing discovery process, the routing discovery request packet only can be forwarded by the reliable node, which is decided by the calculation of co-direction degree, then the routing overhead is reduced at some extent. Noticeably, the correlation of the survival duration between adjacent links is fully considered, which is very important to the path stability criteria. In routing maintenance progress, a path similarity and path remaining survival duration–based multi-path selection mechanism is proposed. The performance superiority of velocity-aware and stability-estimation–based multi-path routing protocol is also demonstrated by extensive simulations. The results show that velocity-aware and stability-estimation–based multi-path routing protocol is much better than other existing protocols in terms of network throughput, average delay of data transmission, routing overhead, and the convergence time of the routing discovery.

Wages for Soundwork

Resonance ◽  
2020 ◽  
Vol 1 (2) ◽  
pp. 191-210
Author(s):  
Joshua Hudelson
Keyword(s):  
Panic Attacks ◽  
The Internet ◽  
Close Reading ◽  
Financial Independence ◽  
Reproductive Labor ◽  
The Past ◽  
Labor Power ◽  
Sales Clerks

Over the past decade, ASMR (Autonomous Sensory Meridian Response) has emerged from whisper-quiet corners of the Internet to become a bullhorn of speculation on the human sensorium. Many consider its sonically induced “tingling” to be an entirely novel, and potentially revolutionary, form of human corporeality—one surprisingly effective in combating the maladies of a digitally networked life: insomnia, anxiety, panic attacks, and depression. Complicating these claims, this article argues that ASMR is also neoliberal repackaging of what Marx called the reproduction of labor power. Units of these restorative “tingles” are exchanged for micro-units of attention, which YouTube converts to actual currency based on per-1,000-view equations. True to the claims of Silvia Federici and Leopoldina Fortunati, this reproductive labor remains largely the domain of women. From sweet-voiced receptionists to fawning sales clerks (both of whom are regularly role-played by ASMRtists), sonic labor has long been a force in greasing the gears of capital. That it plays a role in production is a matter that ASMRtists are often at pains to obscure. The second half of this article performs a close reading of what might be considered the very first ASMR film: Chantal Akerman’s Jeanne Dielman, 23 quai du Commerce, 1080 Bruxelles. Through this film, the exploitative dimensions of ASMR can be contrasted with its potential for creating protected spaces of financial independence and nonnormative corporeal practices.

Courting the Youth Vote in 2008: The Obama Effect

2009 ◽  
Vol 5 ◽  
Author(s):  
Lindsey C Bohl
Keyword(s):  
Presidential Elections ◽  
Voter Registration ◽  
The Internet ◽  
The Past ◽  
Several Variables ◽  
High Turnout ◽  
Short And Long Term ◽  
Use Of The Internet ◽  
Youth Vote

This paper examines a few of the numerous factors that may have led to increased youth turnout in 2008 Election. First, theories of voter behavior and turnout are related to courting the youth vote. Several variables that are perceived to affect youth turnout such as party polarization, perceived candidate difference, voter registration, effective campaigning and mobilization, and use of the Internet, are examined. Over the past 40 years, presidential elections have failed to engage the majority of young citizens (ages 18-29) to the point that they became inclined to participate. This trend began to reverse starting in 2000 Election and the youth turnout reached its peak in 2008. While both short and long-term factors played a significant role in recent elections, high turnout among youth voters in 2008 can be largely attributed to the Obama candidacy and campaign, which mobilized young citizens in unprecedented ways.

The evolution of the Internet of Things (IoT) over the past 20 years

2021 ◽  
Vol 155 ◽  
pp. 107174 ◽  
Author(s):  
Jianxin Wang ◽  
Ming K. Lim ◽  
Chao Wang ◽  
Ming-Lang Tseng
Keyword(s):  
Internet Of Things ◽  
The Internet ◽  
The Past ◽  
The Internet Of Things

scholarly journals Stable routing and energy-conserved data transmission over wireless sensor networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Suzan Shukry
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Data Transmission ◽  
Source Node ◽  
Wireless Sensor ◽  
Dominant Factor ◽  
Communication Overhead ◽  
Forwarding Node ◽  
Stable Path ◽  
Stable Routing

AbstractStable routing and energy conservation over a wireless sensor network (WSN) is a major issue in Internet of Things applications. The network lifetime can be increased when studying this issue with interest. Data transmission is a dominant factor in IoT networks for communication overhead and energy consumption. A proposed efficient node stable routing ($$ENSR$$ ENSR ) protocol is introduced to guarantee the stability of transmission data between the source and destination nodes, in a dynamic WSN conditions. $$ENSR$$ ENSR minimizes energy consumption and selects more stable nodes for packets forwarding. Stability becomes the most important factor that qualifies the node's centrality. A node’s stability is characterized by residual energy, link quality, and number of hops needed to reach the destination from the node. To calculate node's stability, an enhanced centrality concept, known as stable betweenness centrality ($$SBC$$ SBC ) is introduced. In $$ENSR$$ ENSR , at first, some nodes will be selected as the stable forwarding nodes, usually with maximum $$SBC$$ SBC between their neighbors within a limited communication radio range of a particular region. Furthermore, each stable forwarding node then broadcasts its identity, including $$SBC$$ SBC , to the source node separately. The source node can compute a stable path to forward packets to the corresponding stable forwarding node, based on a proper designed stable path routing metric ($$SPRM$$ SPRM ). Then, the stable forwarding node will behave as a new source node and start another stable path routing process until the packets are forwarded and reached to the destination node. In addition, the change of stable nodes over time balances and conserves node energy consumption, thereby mitigating “hot spots”. The proposed routing protocol is validated through simulation. The numerical results show that the proposed protocol outperforms the existing algorithms, global and local reliability-based routing ($$GLRR$$ GLRR ) and reliable energy-aware routing protocol $$(RER)$$ ( R E R ) , in terms of network efficiency and reliability.

scholarly journals Beads, Pixels, and Nkisi: Contemporary Kinois Art and Reconfigurations of the Virtual

2021 ◽  
Vol 64 (1) ◽  
pp. 23-40
Author(s):  
Katrien Pype
Keyword(s):  
Mobile Phone ◽  
Political Elite ◽  
The Internet ◽  
Social Transformations ◽  
The Past ◽  
Wide Range ◽  
Art Works ◽  
Stereotypical Image

AbstractIn the 2016 Abiola Lecture, Mbembe argued that “the plasticity of digital forms speaks powerfully to the plasticity of African precolonial cultures and to ancient ways of working with representation and mediation, of folding reality.” In her commentary, Pype tries to understand what “speaking powerfully to” can mean. She first situates the Abiola Lecture within a wide range of exciting and ongoing scholarship that attempts to understand social transformations on the continent since the ubiquitous uptake of the mobile phone, and its most recent incarnation, the smartphone. She then analyzes the aesthetics of artistic projects by Alexandre Kyungu, Yves Sambu, and Hilaire Kuyangiko Balu, where wooden doors, tattoos, beads, saliva, and nails correlate with the Internet, pixels, and keys of keyboards and remote controls. Finally, Pype asks to whom the congruence between the aesthetics of a “precolonial” Congo and the digital speaks. In a society where “the past” is quickly demonized, though expats and the commercial and political elite pay thousands of dollars for the discussed art works, Pype argues that this congruence might be one more manifestation of capitalism’s cannibalization of a stereotypical image of “Africa.”

Sign in / Sign up

Export Citation Format

Share Document