Number Of Intermediate Nodes Research Articles

A modified auction algorithm for the shortest path problem

A modified auction algorithm for solving the shortest path problem is presented and convergence is established. The proposed method differs from the standard auction algorithm in the way dual variables are updated. By relaxing the dual feasibility requirement we were able to reduce the total number of iterations required by the auction algorithm to compute the shortest path. Computational results show the advantage of this new approach, especially when the number of intermediate nodes in the shortest path from the origin to the destination is large.

Performance analysis of end-to-end transfer delays for multipacket messages in packet-switching networks

When a long message such as file is to be transmitted in a packet-switching network, the source node segments the message into a number of packets and the packets are transmitted to the network. Those packets are transferred to the destination node through several intermediate nodes and then reassembled into the message. This paper models the packet-switching network into a tandem queueing network. By analyzing the model, the performance of message transfer in the packet-switching network is evaluated. The discrete-time system is considered in the analysis. An algorithm is presented which strictly derives the distribution of time needed in the transfer of all packets composing the message from the source node to the destination node (message transfer time). In the numerical example, it is assumed that the service time at each node is composed of the packet processing time and the packet transmission time. The effect of the packet size on the mean and variance of the message transfer delay is analyzed. The case where the message size and the number of intermediate nodes are increased also is considered.

Performance Evaluation of Multilayered Protocol

AbstractThe protocol on the OSI basic reference model is standardized as a hierarchical model composed of seven layers. Protocols of some layers are applied link‐by‐link and protocols of other layers are applied end‐to‐end. The transmission timing of the protocol data unit of each layer depends on the network configuration as well as the protocol parameters. Consequently, there is a possibility that the throughput of the network is deteriorated unless the protocol parameters of each layer are determined adequately according to the network configuration. This paper considers the network containing the transport layer, network layer and data link layer of OSI protocol, and the performance is evaluated from the viewpoint of transmission efficiency, which is a measure in evaluating the network throughput. The relation between the protocol parameters and the throughput is derived. As the protocol parameters, the transmission speed, transmission delay, data unit length, window size, number of intermediate nodes, bit error rate and protocol processing time are considered. The protocol parameters can be determined based on the presented results.