On the forwarding paths produced by Internet routing algorithms

Author(s):  
Seweryn Dynerowicz ◽  
Timothy G. Griffin
2021 ◽  
Author(s):  
Fenwick Robert McKelvey

This dissertation develops the concept of transmissive control to explore the consequences of changes in Internet routing for communication online. Where transmission often denotes an act of exchanging information between sender and receiver, transmissive control theorizes transmission as the production and assignment of common times or temporalities between components of a communication system. Transmissive control functions both operationally according to how computational algorithms route Internet data (known as packets) and systematically according to how patterns in these operations express temporalities of coordination and control. Transmissive control questions how algorithms transmit packets and how transmission expresses valuable temporalities within the Internet. The concept of transmissive control developed as a response to advanced Internet routing algorithms that have greater awareness of packets and more capacity to intervene during transmission. The temporality of the Internet is changing due to these algorithms. Where transmissive control has been made possible by the Internet’s core asynchronous design that allows for many diferent temporalities to be simultaneous (such as real-time networks or time-sharing networks), this diversity has taxed the resources of the Internet infrastructure as well as the business models of most Internet Service Providers (ISPs). To bring the temporality of the Internet back under control, ISPs and other network administrators have turned to transmissive control to better manage their resources. Their activities shift the Internet from an asynchronous temporality to a poly-chronous temporality where network administrators set and manage the times of the Internet. Where this turn to traffic management has often been framed as a debate over the neutrality of the Internet, the dissertation re-orientates the debate around transmissive control. Tactics by the anti-copyright Pirate Bay and Internet transparency projects illustrate potential political and policy responses to transmissive control. The former seeks to elude its control where the latter seeks to expose its operation. These components as well as the operation of transmissive control will be developed through a series of metaphors from the film Inception, the demons of Pandemonium, the novel Moby-Dick and the film Stalker. Each metaphor cooperate to provide a comprehensive discussion of transmissive control.


2021 ◽  
Author(s):  
Fenwick Robert McKelvey

This dissertation develops the concept of transmissive control to explore the consequences of changes in Internet routing for communication online. Where transmission often denotes an act of exchanging information between sender and receiver, transmissive control theorizes transmission as the production and assignment of common times or temporalities between components of a communication system. Transmissive control functions both operationally according to how computational algorithms route Internet data (known as packets) and systematically according to how patterns in these operations express temporalities of coordination and control. Transmissive control questions how algorithms transmit packets and how transmission expresses valuable temporalities within the Internet. The concept of transmissive control developed as a response to advanced Internet routing algorithms that have greater awareness of packets and more capacity to intervene during transmission. The temporality of the Internet is changing due to these algorithms. Where transmissive control has been made possible by the Internet’s core asynchronous design that allows for many diferent temporalities to be simultaneous (such as real-time networks or time-sharing networks), this diversity has taxed the resources of the Internet infrastructure as well as the business models of most Internet Service Providers (ISPs). To bring the temporality of the Internet back under control, ISPs and other network administrators have turned to transmissive control to better manage their resources. Their activities shift the Internet from an asynchronous temporality to a poly-chronous temporality where network administrators set and manage the times of the Internet. Where this turn to traffic management has often been framed as a debate over the neutrality of the Internet, the dissertation re-orientates the debate around transmissive control. Tactics by the anti-copyright Pirate Bay and Internet transparency projects illustrate potential political and policy responses to transmissive control. The former seeks to elude its control where the latter seeks to expose its operation. These components as well as the operation of transmissive control will be developed through a series of metaphors from the film Inception, the demons of Pandemonium, the novel Moby-Dick and the film Stalker. Each metaphor cooperate to provide a comprehensive discussion of transmissive control.


1999 ◽  
Vol 10 (01) ◽  
pp. 63-94 ◽  
Author(s):  
K. SHINJO ◽  
S. SHIMOGAWA ◽  
J. YAMADA ◽  
K. OIDA

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with a maximum degree of performance attainment are realized. By "degree of performance attainment", we mean that we can see how much room is left for the improvement of algorithms. We develop [A] and [B] with the performance measures of throughput and average packet delay and the M/M/1 queuing network. We decide ideal static routings and their performance limits from [A]. We obtain a new simple algorithm from [B] based on the notion of the ideal routings in implementation conditions. The designed algorithm improves the throughput and the average delay, which are comparable to those from ideal static routings. This improvement is contrasted to the adaptive and distributed OSPF (Open Shortest Path First), a standard Internet routing protocol.


2019 ◽  
Vol 7 (4) ◽  
pp. 644-646
Author(s):  
O.Koteswara Rao ◽  
Y K Sundara Krishna ◽  
G K Mohan Devarakonda

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.


2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.


Sign in / Sign up

Export Citation Format

Share Document