Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/622200
Title: Performance analysis of storage-based routing for circuit-switched networks
Authors: Chao Sun;Wei Guo;Zhe Liu;Ming Xia;Weisheng Hu
subject: Blocking rate|Circuit switched networks|Link utilization|Routing|Storage
Year: 2016
Publisher: IEEE
Abstract: Circuit-switching technology has been widely used for bulky data transfers due to its advantages over packet switching, such as deterministic delay, guaranteed bandwidth, and low jitter. However, the traditional end-to-end circuit provisioning mechanism may be bottlenecked by the link that has the least amount of available bandwidth. To solve this problem, this paper proposes to deploy storage capacity at intermediate nodes along a path for circuit-switched networks and introduces an efficient routing algorithm that allows different bandwidth allocations from link to link along a path. The simulation results demonstrate that our storage-based approach can efficiently reduce the blocking rate and improve average link utilization and is well suited for delay-insensitive applications.
URI: http://localhost/handle/Hannan/156771
http://localhost/handle/Hannan/622200
ISSN: 1943-0620
1943-0639
volume: 8
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7489957.pdf569.52 kBAdobe PDFThumbnail
Preview File
Title: Performance analysis of storage-based routing for circuit-switched networks
Authors: Chao Sun;Wei Guo;Zhe Liu;Ming Xia;Weisheng Hu
subject: Blocking rate|Circuit switched networks|Link utilization|Routing|Storage
Year: 2016
Publisher: IEEE
Abstract: Circuit-switching technology has been widely used for bulky data transfers due to its advantages over packet switching, such as deterministic delay, guaranteed bandwidth, and low jitter. However, the traditional end-to-end circuit provisioning mechanism may be bottlenecked by the link that has the least amount of available bandwidth. To solve this problem, this paper proposes to deploy storage capacity at intermediate nodes along a path for circuit-switched networks and introduces an efficient routing algorithm that allows different bandwidth allocations from link to link along a path. The simulation results demonstrate that our storage-based approach can efficiently reduce the blocking rate and improve average link utilization and is well suited for delay-insensitive applications.
URI: http://localhost/handle/Hannan/156771
http://localhost/handle/Hannan/622200
ISSN: 1943-0620
1943-0639
volume: 8
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7489957.pdf569.52 kBAdobe PDFThumbnail
Preview File
Title: Performance analysis of storage-based routing for circuit-switched networks
Authors: Chao Sun;Wei Guo;Zhe Liu;Ming Xia;Weisheng Hu
subject: Blocking rate|Circuit switched networks|Link utilization|Routing|Storage
Year: 2016
Publisher: IEEE
Abstract: Circuit-switching technology has been widely used for bulky data transfers due to its advantages over packet switching, such as deterministic delay, guaranteed bandwidth, and low jitter. However, the traditional end-to-end circuit provisioning mechanism may be bottlenecked by the link that has the least amount of available bandwidth. To solve this problem, this paper proposes to deploy storage capacity at intermediate nodes along a path for circuit-switched networks and introduces an efficient routing algorithm that allows different bandwidth allocations from link to link along a path. The simulation results demonstrate that our storage-based approach can efficiently reduce the blocking rate and improve average link utilization and is well suited for delay-insensitive applications.
URI: http://localhost/handle/Hannan/156771
http://localhost/handle/Hannan/622200
ISSN: 1943-0620
1943-0639
volume: 8
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7489957.pdf569.52 kBAdobe PDFThumbnail
Preview File