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

1994-02-01
BILGEN, S
ALTINTAS, O
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.
IEEE TRANSACTIONS ON COMMUNICATIONS

Suggestions

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...
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 ...
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 new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems
Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01)
This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...
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.