{"title":"WDM光网络中基于缓冲的滑动批量传输请求动态配置","authors":"Min Zhu, W. Zhong, S. Xiao","doi":"10.1109/PGC.2012.6457961","DOIUrl":null,"url":null,"abstract":"We present a new model for dynamically provisioning sliding bulk transfer requests in data-intensive applications over wavelength-division multiplexing (WDM) optical networks. This model can provide more flexibility for the users and serve them better. It allows the users not only to specify the sizes of submitted bulk files, but also to make decisions on the minimum bandwidth guarantee (MBG) and the time redundancy (TR) of the sliding window. We formulate the problem into two sub-problems (time scheduling, routing-wavelength assignment (RWA) and bandwidth allocation (BA)) and prove it to be NP-complete. We propose a buffer-based provisioning (B2P) architecture to deal with the problem. The approach first temporarily buffers those blocked requests at their arrival times and then attempt to provision these requests later once new resources become available. The effectiveness and the feasibility of the proposed approach are demonstrated by the simulations.","PeriodicalId":158783,"journal":{"name":"2012 Photonics Global Conference (PGC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Buffer-based dynamic provisioning for sliding bulk transfer requests in WDM optical networks\",\"authors\":\"Min Zhu, W. Zhong, S. Xiao\",\"doi\":\"10.1109/PGC.2012.6457961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new model for dynamically provisioning sliding bulk transfer requests in data-intensive applications over wavelength-division multiplexing (WDM) optical networks. This model can provide more flexibility for the users and serve them better. It allows the users not only to specify the sizes of submitted bulk files, but also to make decisions on the minimum bandwidth guarantee (MBG) and the time redundancy (TR) of the sliding window. We formulate the problem into two sub-problems (time scheduling, routing-wavelength assignment (RWA) and bandwidth allocation (BA)) and prove it to be NP-complete. We propose a buffer-based provisioning (B2P) architecture to deal with the problem. The approach first temporarily buffers those blocked requests at their arrival times and then attempt to provision these requests later once new resources become available. The effectiveness and the feasibility of the proposed approach are demonstrated by the simulations.\",\"PeriodicalId\":158783,\"journal\":{\"name\":\"2012 Photonics Global Conference (PGC)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Photonics Global Conference (PGC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PGC.2012.6457961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Photonics Global Conference (PGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PGC.2012.6457961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Buffer-based dynamic provisioning for sliding bulk transfer requests in WDM optical networks
We present a new model for dynamically provisioning sliding bulk transfer requests in data-intensive applications over wavelength-division multiplexing (WDM) optical networks. This model can provide more flexibility for the users and serve them better. It allows the users not only to specify the sizes of submitted bulk files, but also to make decisions on the minimum bandwidth guarantee (MBG) and the time redundancy (TR) of the sliding window. We formulate the problem into two sub-problems (time scheduling, routing-wavelength assignment (RWA) and bandwidth allocation (BA)) and prove it to be NP-complete. We propose a buffer-based provisioning (B2P) architecture to deal with the problem. The approach first temporarily buffers those blocked requests at their arrival times and then attempt to provision these requests later once new resources become available. The effectiveness and the feasibility of the proposed approach are demonstrated by the simulations.