Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
Networking and Internet Architecture
2010-04-21 v1 Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
Abstract
In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data transfer services and present general guidelines and algorithms for managing service prices, risks and schedules. In the second part of the paper we solve two packet scheduling cost optimization problems and present efficient algorithms for identifying maximum weight (k-level-) caterpillar subtrees in tree networks.
Keywords
Cite
@article{arxiv.1004.3452,
title = {Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services},
author = {Mugurel Ionut Andreica and Vasile Deac and Stelian Tipa},
journal= {arXiv preprint arXiv:1004.3452},
year = {2010}
}
Comments
Proceedings of the 9th WSEAS International Conference on Multimedia, Internet & Video Technologies (MIV), Budapest, Hungary, 3-5 September, 2009. (ISBN: 978-960-474-114-4 / ISSN: 1790-5109)