{"title":"Characteristics of deterministic optimal routing for a simple traffic control problem","authors":"K. Oida, K. Shinjo","doi":"10.1109/PCCC.1999.749463","DOIUrl":null,"url":null,"abstract":"This paper deals with a routing problem for a pair of parallel paths connecting a source node and a destination node. The problem is to find the optimal routing that minimizes the average packet delay under the condition that all of the packets' arrival times at the source node as well as all of the packets' sizes are completely deterministic. The numerical solutions of the problem show that the optimal routing assigns most of the short packets to one path and most of the long packets to the other path when the input traffic intensity is high. This new routing assignment is called the fix-queue-based-on-size (FS) policy. It is shown mathematically that the expected average packet delay of the FS policy is smaller than that of the send-to-shortest-delay (SSD) policy if a large number of packets simultaneously arrive at the source node.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
This paper deals with a routing problem for a pair of parallel paths connecting a source node and a destination node. The problem is to find the optimal routing that minimizes the average packet delay under the condition that all of the packets' arrival times at the source node as well as all of the packets' sizes are completely deterministic. The numerical solutions of the problem show that the optimal routing assigns most of the short packets to one path and most of the long packets to the other path when the input traffic intensity is high. This new routing assignment is called the fix-queue-based-on-size (FS) policy. It is shown mathematically that the expected average packet delay of the FS policy is smaller than that of the send-to-shortest-delay (SSD) policy if a large number of packets simultaneously arrive at the source node.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
