消息交换网络中路由的最小原则/排队理论方法

1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes Pub Date : 1978-12-01 DOI:10.1109/CDC.1978.267928

J. Meditch

{"title":"消息交换网络中路由的最小原则/排队理论方法","authors":"J. Meditch","doi":"10.1109/CDC.1978.267928","DOIUrl":null,"url":null,"abstract":"Preliminary results for minimum message-delay routing in message-switched, store-and-forward, data-communication networks are presented using a minimum principle/queueing theory approach. The routing algorithm is a decentralized one which requires only local information. The results are illustrated via a special case, and extensions and problems for future research are discussed.","PeriodicalId":375119,"journal":{"name":"1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A minimum principle/queueing theory approach to routing in message-switched networks\",\"authors\":\"J. Meditch\",\"doi\":\"10.1109/CDC.1978.267928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Preliminary results for minimum message-delay routing in message-switched, store-and-forward, data-communication networks are presented using a minimum principle/queueing theory approach. The routing algorithm is a decentralized one which requires only local information. The results are illustrated via a special case, and extensions and problems for future research are discussed.\",\"PeriodicalId\":375119,\"journal\":{\"name\":\"1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1978.267928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1978.267928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

利用最小原则/排队理论方法，给出了在消息交换、存储转发和数据通信网络中最小消息延迟路由的初步结果。该算法是一种分散的路由算法，只需要本地信息。通过一个特例说明了结果，并讨论了未来研究的扩展和问题。

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

查看原文本刊更多论文

A minimum principle/queueing theory approach to routing in message-switched networks

Preliminary results for minimum message-delay routing in message-switched, store-and-forward, data-communication networks are presented using a minimum principle/queueing theory approach. The routing algorithm is a decentralized one which requires only local information. The results are illustrated via a special case, and extensions and problems for future research are discussed.

求助全文

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

来源期刊

1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes

自引率

0.00%

发文量