This paper proposes a novel file transfer scheme named "Jam-packing file transfer" that consists of a call admission control and a packet scheduling mechanism. This combination can efficiently multiplex the traffic of file transfer and provides a guaranteed delivery time. Simulation results show the highness of extreme the multiplexing efficiency as the improvement in call blocking probabilities compared with the conventional rate-based reservation schemes. Furthermore, simulations of the packet scheduling indicate that file deliveries are done at the predicted delivery time.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tetsuya ONODA, Hui ZHANG, "Jam-Packing: An Efficient QoS Service for Transferring Huge Files" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2095-2104, August 2001, doi: .
Abstract: This paper proposes a novel file transfer scheme named "Jam-packing file transfer" that consists of a call admission control and a packet scheduling mechanism. This combination can efficiently multiplex the traffic of file transfer and provides a guaranteed delivery time. Simulation results show the highness of extreme the multiplexing efficiency as the improvement in call blocking probabilities compared with the conventional rate-based reservation schemes. Furthermore, simulations of the packet scheduling indicate that file deliveries are done at the predicted delivery time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2095/_p
Copy
@ARTICLE{e84-b_8_2095,
author={Tetsuya ONODA, Hui ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Jam-Packing: An Efficient QoS Service for Transferring Huge Files},
year={2001},
volume={E84-B},
number={8},
pages={2095-2104},
abstract={This paper proposes a novel file transfer scheme named "Jam-packing file transfer" that consists of a call admission control and a packet scheduling mechanism. This combination can efficiently multiplex the traffic of file transfer and provides a guaranteed delivery time. Simulation results show the highness of extreme the multiplexing efficiency as the improvement in call blocking probabilities compared with the conventional rate-based reservation schemes. Furthermore, simulations of the packet scheduling indicate that file deliveries are done at the predicted delivery time.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Jam-Packing: An Efficient QoS Service for Transferring Huge Files
T2 - IEICE TRANSACTIONS on Communications
SP - 2095
EP - 2104
AU - Tetsuya ONODA
AU - Hui ZHANG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2001
AB - This paper proposes a novel file transfer scheme named "Jam-packing file transfer" that consists of a call admission control and a packet scheduling mechanism. This combination can efficiently multiplex the traffic of file transfer and provides a guaranteed delivery time. Simulation results show the highness of extreme the multiplexing efficiency as the improvement in call blocking probabilities compared with the conventional rate-based reservation schemes. Furthermore, simulations of the packet scheduling indicate that file deliveries are done at the predicted delivery time.
ER -