AN APPROXIMATE SOLUTION OF THE HETEROGENEOUS MULTISERVER QUEUING PROBLEM

Date

1991-05-24

Author

ALTINTAS, O
BILGEN, S

Metadata

Show full item record

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

Item Usage Stats

43
views

0
downloads

The exact solution of the M/M/m/k queuing problem for the case of different capacity servers requires extensive process time and memory space. An approximation method which reduces the necessary solution effort drastically is proposed. Rather than the utilization of each link, overall system performance is computed in terms of steady-state system population probabilities. The efficiency and accuracy of the proposed method are compared with the exact solution and the feasibility of the approximation is demonstrated.

Subject Keywords

Delay Systems , Waveguide Discontinuities , Packet Switching , Error Probability , Routing , Information Analysis, Queueing Analysis , Equations , Costs , Markov Processes

URI

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

Collections

Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Chung, Chia-Shin; Flynn, James; Kırca, Ömer (Elsevier BV, 2006-10-01) The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and ca...
A column generation approach for the location-routing problem with time windows Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01) The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...
A Link delay computation method for the quality of service support in software defined networks Balo, Efe; Güran Schmidt, Ece.; Department of Electrical and Electronics Engineering (2019) Packet switched networks cannot provide tight delay bounds that are required by certain types of applications despite facilitating high throughput. Therefore, delay measurementtechniquesforpacket-switchednetworkshavealwaysgrabbedtheattention of the community to both utilize advantages of packet-switched networks and provide a realistic end to end delay prediction of packets. Software Deﬁned Networking (SDN) isa new paradigmofpacket-switchednetworkingwhichgathersmanagement functionality of network in a logic...
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 ...

Citation Formats

O. ALTINTAS and S. BILGEN, “AN APPROXIMATE SOLUTION OF THE HETEROGENEOUS MULTISERVER QUEUING PROBLEM,” 1991, p. 961, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65663.