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

被引：1
作者：
BILGEN, S
ALTINTAS, O
机构：
[1] Department of Electrical Engineering, Middle East Technical University, Ankara
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 1994年 / 42卷 / 2-4期
关键词：
D O I：
10.1109/TCOMM.1994.577020
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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.
引用
收藏
页码：229 / 232
页数：4
相关论文
共 6 条
[1]  
AGRAWAL S, 1987, P ACM SIGMETRICS C M, P27
[2]   RESEQUENCING DELAY FOR A QUEUING SYSTEM WITH 2 HETEROGENEOUS SERVERS UNDER A THRESHOLD-TYPE SCHEDULING [J].
ILIADIS, I ;
LIEN, LYC .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (06) :692-702
[3]  
ILIADIS I, 1988, P INFOCOM 88 APR, P881
[4]  
Kleinrock L., 1975, QUEUEING SYSTEMS THE, V1
[5]  
TAKINE T, 1990, PERFORMANCE 90, P109
[6]  
YUM TSP, 1986, IEEE T COMMUN, V34, P143
1