{"title":"基于抢占感知的diffserver /MPLS网络选路算法","authors":"Yu-Kung Ke, Zhang Lin, Hui-min Zhang","doi":"10.1109/IPOM.2004.1547604","DOIUrl":null,"url":null,"abstract":"In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A preemption-aware path selection algorithm for DiffServ/MPLS networks\",\"authors\":\"Yu-Kung Ke, Zhang Lin, Hui-min Zhang\",\"doi\":\"10.1109/IPOM.2004.1547604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.\",\"PeriodicalId\":197627,\"journal\":{\"name\":\"2004 IEEE International Workshop on IP Operations and Management\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Workshop on IP Operations and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPOM.2004.1547604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Workshop on IP Operations and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPOM.2004.1547604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A preemption-aware path selection algorithm for DiffServ/MPLS networks
In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.