AN APPROXIMATE SOLUTION FOR THE RESEQUENCING PROBLEM IN PACKET-SWITCHING NETWORKS

Date

1994-02-01

Author

BILGEN, S
ALTINTAS, O

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

167
views

0
downloads

An approximation heuristic is proposed for solving the heterogeneous multi-server queueing problem associated with the analysis of resequencing of packets travelling over multiple physical links to a packet-switching network. Even though a method for obtaining the exact solution exists, its processing time and memory requirements vary exponentially in terms of the number of servers and render it infeasible even for moderately-sized systems. Precision of the proposed approximation which has linear time complexity is demonstrated. The approximation is recommendable in cases when overall system population and resequencing delays, rather than individual link utilizations, have to be calculated.

Subject Keywords

Intelligent networks, Queueing analysis, Network servers, Delay systems, Linear approximation, Routing, Dispatching, Information analysis, Equations, Computer networks

URI

https://hdl.handle.net/11511/65912

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS

DOI

https://doi.org/10.1109/tcomm.1994.577020

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks Deniz, Fatih; Bagci, Hakki; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (2016-07-01) This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this heterogeneous model, we have resource-rich supernodes as well as ordinary sensor nodes that are supposed to be connected to the supernodes. Unlike the static alternative Disjoint Path Vector (DPV) algorithm, the focus of ADPV is to secure supernode connectivity in the presence of node failures...
AN OPTIMAL-CONTROL PROBLEM WITH NONLINEAR ELLIPTIC STATE-EQUATIONS Leblebicioğlu, Mehmet Kemal (Elsevier BV, 1992-02-01) In this article some of the results for optimal control of linear systems have been generalized to a nonlinear case. This is achieved by employing standard techniques of the nonlinear theory. After demonstrating the existence of optimal controls, finite element method is used to discretize the problem. The resulting finite dimensional problem is solved by a special algorithm. The theoretical discussions are completed by proving that approximate solutions are reduced to exact solutions as the element size te...
A Divide and Conquer Approach for Construction of Large-Scale Signaling Networks from PPI and RNAi Data Using Linear Programming Ozsoy, Oyku Eren; Can, Tolga (Institute of Electrical and Electronics Engineers (IEEE), 2013-07-01) Inference of topology of signaling networks from perturbation experiments is a challenging problem. Recently, the inference problem has been formulated as a reference network editing problem and it has been shown that finding the minimum number of edit operations on a reference network to comply with perturbation experiments is an NP-complete problem. In this paper, we propose an integer linear optimization (ILP) model for reconstruction of signaling networks from RNAi data and a reference network. The ILP ...
A simulation study of scheduling algorithms for packet switching networks Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003) A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
Delay and Peak-Age Violation Probability in Short-Packet Transmissions Devassy, Rahul; Durisi, Giuseppe; Ferrante, Guido Carlo; Simeone, Osvaldo; Uysal, Elif (2018-06-22) This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue with first-come first-served discipline and transmitted over an additive white Gaussian noise (AWGN) channel. When a packet is correctly decoded, the sender receives an instantaneous error-free positive acknowledgment, upon which it removes the packet from the buffer. In ...

Citation Formats

S. BILGEN and O. ALTINTAS, “AN APPROXIMATE SOLUTION FOR THE RESEQUENCING PROBLEM IN PACKET-SWITCHING NETWORKS,” IEEE TRANSACTIONS ON COMMUNICATIONS, pp. 229–232, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65912.