确定队列串联中的最优路由策略

Sixth International Workshop on Discrete Event Systems, 2002. Proceedings. Pub Date : 2002-10-02 DOI:10.1109/WODES.2002.1167696

Bruno Gaujal, E. Hyon

{"title":"确定队列串联中的最优路由策略","authors":"Bruno Gaujal, E. Hyon","doi":"10.1109/WODES.2002.1167696","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time. We show that the optimal routing is a Sturmian word whose density depends on the maximum service time on each route. In order to do this, we particularly study the output process of deterministic queues when the input process is Sturmian.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Optimal routing policies in deterministic queues in tandem\",\"authors\":\"Bruno Gaujal, E. Hyon\",\"doi\":\"10.1109/WODES.2002.1167696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time. We show that the optimal routing is a Sturmian word whose density depends on the maximum service time on each route. In order to do this, we particularly study the output process of deterministic queues when the input process is Sturmian.\",\"PeriodicalId\":435263,\"journal\":{\"name\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2002.1167696\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

在本文中，我们解决了在两个具有确定性服务时间的队列串联的并行网络中路由客户流的问题，以最小化平均响应时间。我们证明了最优路线是一个图尔图曼词，其密度取决于每条路线上的最大服务时间。为了做到这一点，我们特别研究了当输入过程为Sturmian时确定性队列的输出过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal routing policies in deterministic queues in tandem

In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time. We show that the optimal routing is a Sturmian word whose density depends on the maximum service time on each route. In order to do this, we particularly study the output process of deterministic queues when the input process is Sturmian.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.

自引率

0.00%

发文量