These days while the traditional Internet cannot meet the requirement of data-intensive communications in large scale escience
grid applications, Optical network which is also referred to as Lambda Grid provide a simple means of achieving
guaranteed high bandwidth, guaranteed latency and deterministic connection. Lots of e-science applications like e-VLBI
and GTL require aggregating several hundred GB data files from distributed databases to super-computers frequently at
real time. Thus minimizing the aggregation time can improve the overall system performance. We consider the problem
of aggregating large data files from distributed databases to distributed computational resources on lambda grid. We
modify the model of Time-Path Scheduling Problem (TPSP) which has been proposed and propose a new N-destination
TPSP (NDTPSP) model. We present the proof of NDTPSP's NP-completeness. We also propose a list scheduling
algorithm and a modified list scheduling algorithm for our problem. The performance of different algorithms will be
compared and analyzed by simulations.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.