Share Email Print

Proceedings Paper

Dynamic routing algorithm for large file transport in optical network
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Many distributed computing applications need transfer large files between distributed locations as fast as possible. A dynamic routing algorithm for optical network is designed to modify existing transfers and spare network resources for new request to satisfy both old and new transfers' requirements. In data intensive application on circuit-switch optical network, light-path resources are scarce and there should be concurrent file transfers competing for the same fibers. In static routing optical network, if new coming file transfer cannot acquire light-path with enough bandwidth, it could only wait for the releasing of current used resources. Due to the waiting, the delay time will be large. So we use our dynamic routing algorithm to schedule and modify existing light-paths, to spare a light-path with enough bandwidth for new coming file. Our optimized target is to make every file finish transferring in less time, so we propose two objectives defined in the paper: one is to make maximal delay time of all tasks less and the other is to make average delay time less. The algorithm proposed has two mainly steps: 1) Routing process; 2) Dynamic routing process. In routing step, when task of file arrives we firstly get k random paths, then use Least Congestion Algorithm (LCA) (or Shortest Path Algorithm (SPA)) to get the primary path P1 of maximal residual bandwidth (RB) from k paths and the alternate path P2 of the second maximal RB. If the bandwidth of P1 is enough for this task, transfer the file in P1 path. If not, we go to the dynamic routing process. In the second process, get all the links of P1 then we change the existing light paths of tasks in the P1 path one by one to their alternative paths until we can get enough bandwidth of P1. In the dynamic routing process, we design two different queuing strategies. The first strategy is First Arrive First Modified (FAFM) strategy, namely we schedule the first arrival task firstly. The other is Larger Bandwidth First Modified (LBFM) and the file with larger bandwidth is scheduled firstly. By comparison of simulation results, we can prove that our two kinds of dynamic routing algorithms can get better results for both decreasing maximal delay time and average delay time than LCA and SPA routing algorithms. In the two queuing strategies, LBFM can get better results than FAFM strategy. The receivers in the destinations can get better results by using our dynamic routing algorithm.

Paper Details

Date Published: 19 November 2007
PDF: 8 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67842B (19 November 2007); doi: 10.1117/12.745118
Show Author Affiliations
Pengshan Zhang, Shanghai Jiao Tong Univ. (China)
Wei Guo, Shanghai Jiao Tong Univ. (China)
Yaohui Jin, Shanghai Jiao Tong Univ. (China)
Weiqiang Sun, Shanghai Jiao Tong Univ. (China)
Weisheng Hu, Shanghai Jiao Tong Univ. (China)

Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top