A Hybrid Network Architecture for File Transfers

In prior work, we proposed a hybrid architecture that complements the connectionless Internet with a high-speed, dynamically shared circuit-switched network for file-transfer applications. "Smallrdquo files are directed to the connectionless network while for "largerdquo files, a high-spee...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 2009-12, Vol.20 (12), p.1714-1725
Hauptverfasser: Xiuduan Fang, Veeraraghavan, M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In prior work, we proposed a hybrid architecture that complements the connectionless Internet with a high-speed, dynamically shared circuit-switched network for file-transfer applications. "Smallrdquo files are directed to the connectionless network while for "largerdquo files, a high-speed circuit setup is attempted. If the attempt is unsuccessful (because all circuits are already in use), the application will fall back to using the connectionless path. This paper addresses the question of how to select appropriate values for operational parameters in this hybrid architecture. Specifically, we study the questions of what sized files to direct to the circuit-switched network and how much bandwidth to allocate per file transfer. To answer these questions, we construct a model of this hybrid architecture by combining the Erlang-B call blocking model with TCP delay models. Our model captures a combination of utilization and delay considerations in the selection of minimum file size above which transfers should be directed to the circuit-switched network. The optimal per-call circuit rate and the optimal minimum file size are determined to maximize the benefits of using the circuit network, which is quantified with an average-delay-reduction metric.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2009.21