An approximate solution of the resequencing problem in packet-switching networks

Download
009598.pdf
1990
Altıntaş, Onur
Show full item record
74
views
0
downloads
https://hdl.handle.net/11511/8240
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

AN APPROXIMATE SOLUTION FOR THE RESEQUENCING PROBLEM IN PACKET-SWITCHING NETWORKS
BILGEN, S; ALTINTAS, O (1994-02-01)
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 approximatio...
An efficient solution of the generalized eigenvalue problems for planar transmission lines
Prakash, VVS; Kuzuoğlu, Mustafa; Mittra, R (Wiley, 2001-11-05)
This paper presents an efficient solution for solving the generalized eigenvalue equation arising in the finite-element (FE) formulation of propagation characterization of planar transmission-line structures. A two-dimensional (2-D) finite-element method (FEM) is used for analyzing the uniform planar transmission lines. The Arnoldi algorithm is used in conjunction with the multifrontal decomposition of the system matrix for solving the eigensystem. Convergence is typically obtained within a few iterations o...
An efficient parallel implementation of the multilevel fast multipole algorithm for rigorous solutions of large-scale scattering problems
Ergül, Özgür Salih (2010-08-19)
We present the solution of large-scale scattering problems discretized with hundreds of millions of unknowns. The multilevel fast multipole algorithm (MLFMA) is parallelized using the hierarchical partitioning strategy on distributed-memory architectures. Optimizations and load-balancing algorithms are extensively used to improve parallel MLFMA solutions. The resulting implementation is successfully employed on modest parallel computers to solve scattering problems involving metallic objects larger than 100...
An efficient transitive closure algorithm for distributed databases
Toroslu, İsmail Hakkı (1993-01-01)
© 1993 IEEE.Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for s...
An optimal stopping problem for spectrally negative Markov additive processes
Çağlar, Mine; Kyprianou, Andreas; Vardar Acar, Ceren (2021-07-01)
Previous authors have considered optimal stopping problems driven by the running maximum of a spectrally negative Lévy process as well as of a one-dimensional diffusion; see e.g. Kyprianou and Ott (2014); Ott (2014); Ott (2013); Alvarez and Matomäki (2014); Guo and Shepp (2001); Pedersen (2000); Gapeev (2007). Many of the aforementioned results are either implicitly or explicitly dependent on Peskir’s maximality principle, cf. (Peskir, 1998). In this article, we are interested in understanding how some of t...
Citation Formats
O. Altıntaş, “An approximate solution of the resequencing problem in packet-switching networks,” Middle East Technical University, 1990.
METU IIS - Integrated Information Service open@metu.edu.tr