{"title":"礼貌的带宽限制分配模型","authors":"Chafika Tata, M. Kadoch","doi":"10.1109/ICTEL.2013.6632149","DOIUrl":null,"url":null,"abstract":"This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"CAM: Courteous bandwidth constraints allocation model\",\"authors\":\"Chafika Tata, M. Kadoch\",\"doi\":\"10.1109/ICTEL.2013.6632149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.\",\"PeriodicalId\":430600,\"journal\":{\"name\":\"ICT 2013\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICT 2013\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTEL.2013.6632149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICT 2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2013.6632149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CAM: Courteous bandwidth constraints allocation model
This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.