具有不同类型消息的网络中的路由和容量分配

[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track Pub Date : 1989-01-01 DOI:10.1109/HICSS.1989.49197

I. Neuman

{"title":"具有不同类型消息的网络中的路由和容量分配","authors":"I. Neuman","doi":"10.1109/HICSS.1989.49197","DOIUrl":null,"url":null,"abstract":"A mathematical model is presented for the problem of jointly assigning routes to the communicating pairs of nodes and capacities to the links in a packet-switched network. It is assumed that several classes of flow are using the network, different service requirements and message characteristics being associated with each class. An algorithm that generates good feasible solutions to the model, together with tight lower bounds on the value of the objective function, is presented. Results of numerical experiments using several network topologies are reported.<<ETX>>","PeriodicalId":384442,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Routing and capacity assignment in a network with different classes of messages\",\"authors\":\"I. Neuman\",\"doi\":\"10.1109/HICSS.1989.49197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A mathematical model is presented for the problem of jointly assigning routes to the communicating pairs of nodes and capacities to the links in a packet-switched network. It is assumed that several classes of flow are using the network, different service requirements and message characteristics being associated with each class. An algorithm that generates good feasible solutions to the model, together with tight lower bounds on the value of the objective function, is presented. Results of numerical experiments using several network topologies are reported.<<ETX>>\",\"PeriodicalId\":384442,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.49197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.49197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

针对分组交换网络中节点通信对的路由分配和链路容量分配问题，提出了一个数学模型。假设有几个流类正在使用网络，不同的服务需求和消息特征与每个类相关联。给出了一种算法，该算法能产生该模型的良好可行解，并具有目标函数值的紧下界。本文报道了几种网络拓扑的数值实验结果。

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

查看原文本刊更多论文

Routing and capacity assignment in a network with different classes of messages

A mathematical model is presented for the problem of jointly assigning routes to the communicating pairs of nodes and capacities to the links in a packet-switched network. It is assumed that several classes of flow are using the network, different service requirements and message characteristics being associated with each class. An algorithm that generates good feasible solutions to the model, together with tight lower bounds on the value of the objective function, is presented. Results of numerical experiments using several network topologies are reported.<>

求助全文

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

来源期刊

[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track

自引率

0.00%

发文量