Dedicated channels as an optimal network support for effective transfer of massive data

Sergey Gorinsky, Nageswara S.V. Rao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Abstract

Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time interval. In this paper, we argue that IFS is an inappropriate ideal for the application of massive data transfers where the primary goal is to minimize message transfer times. We propose an alternative paradigm of Virtual Finish Time First (ViFi) scheduling that dedicates the entire capacity to one message at a time in the order of message finish times under IFS. Unlike Shortest Remaining Time First and other earlier algorithms for dedicated scheduling, ViFi provides a remarkable guarantee of delivering each message no later than under IFS. Our analysis and simulations show the dedicated ViFi scheduling offers significant reductions in the average transfer time. The above properties make ViFi a promising approach for resource allocation in emerging dedicated-channel networks that enable advance reservation of end-to-end channels between hosts.

Original languageEnglish
Title of host publicationProceedings - INFOCOM 2006
Subtitle of host publication25th IEEE International Conference on Computer Communications
DOIs
StatePublished - 2006
EventINFOCOM 2006: 25th IEEE International Conference on Computer Communications - Barcelona, Spain
Duration: Apr 23 2006Apr 29 2006

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

ConferenceINFOCOM 2006: 25th IEEE International Conference on Computer Communications
Country/TerritorySpain
CityBarcelona
Period04/23/0604/29/06

Fingerprint

Dive into the research topics of 'Dedicated channels as an optimal network support for effective transfer of massive data'. Together they form a unique fingerprint.

Cite this