{"title":"IP网络中最优容量分配","authors":"A. Rassaki, A. Nel","doi":"10.1109/ICDIPC.2015.7323038","DOIUrl":null,"url":null,"abstract":"We present an analysis of the problem of routing and bandwidth allocation problem in packet switched networks. In this problem, we identify a route for every pair of communicating nodes and then assign a capacity to each link in the network in order to minimize the total line capacity and delay costs. We have developed a mathematical programming formulation which is an efficient solution. This formulation is indicated to be effective procedure based on computational results across a variety of networks.","PeriodicalId":339685,"journal":{"name":"2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal capacity assignment in IP networks\",\"authors\":\"A. Rassaki, A. Nel\",\"doi\":\"10.1109/ICDIPC.2015.7323038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an analysis of the problem of routing and bandwidth allocation problem in packet switched networks. In this problem, we identify a route for every pair of communicating nodes and then assign a capacity to each link in the network in order to minimize the total line capacity and delay costs. We have developed a mathematical programming formulation which is an efficient solution. This formulation is indicated to be effective procedure based on computational results across a variety of networks.\",\"PeriodicalId\":339685,\"journal\":{\"name\":\"2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDIPC.2015.7323038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIPC.2015.7323038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present an analysis of the problem of routing and bandwidth allocation problem in packet switched networks. In this problem, we identify a route for every pair of communicating nodes and then assign a capacity to each link in the network in order to minimize the total line capacity and delay costs. We have developed a mathematical programming formulation which is an efficient solution. This formulation is indicated to be effective procedure based on computational results across a variety of networks.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
