2011•Unpublished venueRequires access

Packets travelling in non-homogeneous networks

Omer H. Abdelrahman, Erol Gelenbe

Open publisher page 1 citations

Abstract

This paper considers a probability model for travel of a packet from a source node to a destination node in a large non-homogeneous multiple hop network with unreliable routing tables. Use of a random model is justified by the lack of precise information that can be used in each step of the packet's travel, and randomness can also be useful in exploring alternate paths when a long sequence of hops has not resulted in the packet's arrival to the destination. The packet's travel may also be impeded if certain routers on its path prove to be unreliable, or the packet may be dropped from a buffer or destroyed due to packet loss. The packet also has a limited time-out that allows the source to retransmit a dropped or lost packet. Because the network itself may be extremely large, we consider packet travel in an infinite random non-homogeneous medium, with events that may interrupt, destroy or stop the packet from moving towards its destination. We derive a numerical-analytical solution allowing us to compute the average travel time of the packet from source to destination, as well as to estimate its energy consumption. Two interesting applications are then presented. In the first one a wireless network where areas which are remote from the source and destination nodes may have poor wireless coverage so that the packet losses become more frequent as the packet "unknowingly" (due to poor routing tables for instance) meanders away from the source and destination node. The second application is related to defending a destination node against attacks that take the form of packets that carry a virus or a worm that can be detected via deep packet inspection at intermediate nodes, and as the packet approaches the destination node it is more frequently inspected and dropped if it is a threat.

About this research paper

What this paper is about

This paper considers a probability model for travel of a packet from a source node to a destination node in a large non-homogeneous multiple hop network with unreliable routing tables. Use of a random model is justified by the lack of precise information that can be used in each step of the packet's travel, and randomness can also be useful in exploring alternate paths when a long sequence of hops has not resulted in the packet's arrival to the destination. The packet's travel may also be impeded if certain routers on its path prove to be unreliable, or the packet may be dropped from a buffer or destroyed due to packet loss. The packet also has a limited time-out that allows the source to retransmit a dropped or lost packet. Because the network itself may be extremely large, we consider packet travel in an infinite random non-homogeneous medium, with events that may interrupt, destroy or stop the packet from moving towards its destination. We derive a numerical-analytical solution allowing us to compute the average travel time of the packet from source to destination, as well as to estimate its energy consumption. Two interesting applications are then presented. In the first one a wireless network where areas which are remote from the source and destination nodes may have poor wireless coverage so that the packet losses become more frequent as the packet "unknowingly" (due to poor routing tables for instance) meanders away from the source and destination node. The second application is related to defending a destination node against attacks that take the form of packets that carry a virus or a worm that can be detected via deep packet inspection at intermediate nodes, and as the packet approaches the destination node it is more frequently inspected and dropped if it is a threat.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper considers a probability model for travel of a packet from a source node to a destination node in a large non-homogeneous multiple hop network with unreliable routing tables. Use of a random model is justified by the lack of precise information that can be used in each step of the packet's travel, and randomness can also be useful in exploring alternate paths when a long sequence of hops has not resulted in the packet's arrival to the destination. The packet's travel may also be impeded if certain routers on its path prove to be unreliable, or the packet may be dropped from a buffer or destroyed due to packet loss. The packet also has a limited time-out that allows the source to retransmit a dropped or lost packet. Because the network itself may be extremely large, we consider packet travel in an infinite random non-homogeneous medium, with events that may interrupt, destroy or stop the packet from moving towards its destination. We derive a numerical-analytical solution allowing us to compute the average travel time of the packet from source to destination, as well as to estimate its energy consumption. Two interesting applications are then presented. In the first one a wireless network where areas which are remote from the source and destination nodes may have poor wireless coverage so that the packet losses become more frequent as the packet "unknowingly" (due to poor routing tables for instance) meanders away from the source and destination node. The second application is related to defending a destination node against attacks that take the form of packets that carry a virus or a worm that can be detected via deep packet inspection at intermediate nodes, and as the packet approaches the destination node it is more frequently inspected and dropped if it is a threat.

Key concepts: Computer network, Source routing, Computer science, Network packet, DSRFLOW, End-to-end delay, Processing delay, Randomness

Related papers

Back to paper searchBrowse research topicsOriginal source
Packets travelling in non-homogeneous networks — Research Paper | ScholarLens