Dr. Pengshan Zhang Profile

Dr. Pengshan Zhang

at Shanghai Jiao Tong Univ

SPIE Involvement:

Author

Publications (2)

Proceedings Article | 19 November 2007 Paper

Dynamic routing algorithm for large file transport in optical network

Pengshan Zhang, Wei Guo, Yaohui Jin, Weiqiang Sun, Weisheng Hu

Proceedings Volume 6784, 67842B (2007) https://doi.org/10.1117/12.745118

KEYWORDS: Optical networks, Computer simulations, Mathematical modeling, Bismuth, Distributed computing, Detection and tracking algorithms, Receivers, Data modeling, Optical circuits, Optical fibers

Read 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.

Proceedings Article | 28 September 2006 Paper

Task scheduling algorithm for optical grid architecture

Wei Guo, Zhenyu Sun, Zhengyu Wang, Pengshan Zhang, Jing Ma, Yan Wang, Yaohui Jin, Weiqiang Sun, Weisheng Hu

Proceedings Volume 6354, 63540P (2006) https://doi.org/10.1117/12.691670

KEYWORDS: Optical networks, Computer simulations, Telecommunications, Optical communications, Algorithm development, Fourier transforms, Integrated optics, Optical simulations, Analytical research, Wavelength division multiplexing

Read Abstract +

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Keywords/Phrases

Search In:

Publication Years