By Topic

Design of a Large Network for Radiological Image Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ruffolo, M. ; Sandia Nat. Labs., Livermore, CA ; Daskin, M.S. ; Sahakian, A.V. ; Berry, R.A.

Radiological imaging is a rapidly growing business. The field is quickly evolving from films to electronic or digital imaging. By the year 2015, the amount of radiological image data that will have been generated in the U.S. alone is projected to be between 100 and 300000 PB. (1 PB equals 250 B or about 1015 B.) As the volume of radiological data increases, the need to transmit the data over long distances also increases. For example, radiologists in Chicago, India, or Israel, working in the same medical practice, may read images taken in Chicago. Globally distributed research requires that images be transmitted around the world. Radiologists and researchers want to be able to download files containing hundreds of megabytes in seconds. This service requirement suggests that multiple copies of images should be retained in globally distributed databases to minimize access and transmission delays. Key design issues for such a database include the location of the data repositories relative to the generating and retrieval (reading) sites and the number and location of the copies of the files that are generated. In this paper, we approximate the time to retrieve images stored in city j by a radiologist in city k at time period t. Next, we formulate a model designed to minimize the average retrieval time weighted over all demands. We briefly outline a nested Lagrangian relaxation approach to the problem. Computational results are then summarized. The paper ends with conclusion and directions for future research

Published in:

Information Technology in Biomedicine, IEEE Transactions on  (Volume:11 ,  Issue: 1 )