Optimal services for content delivery based on business priority

In a content-delivery system, connections are viewed as resources for sending files. However, the growing business needs of large-scale networks require an effective content-delivery service for transferring files. Since connections are sparse resources, prioritizing connections is essential for efficiently delivering urgent files and regular files based on various business priorities. This study presents a loss function as a performance index for a content-delivery service. The proposed loss function was applied to a sample content-delivery system to derive the average number of regular files in the retry group, the probability of failure to transfer a regular file in the first attempt, and the probability of failure to transmit urgent files. Additionally, the loss was associated with the decreased number of reserve connections under regular hours and peak hours. The experimental results show that the proposed model finds the optimal number of reserve connections for sending high- and low-priority files, and a manager can increase the service rate to ensure that losses are tolerable when delivering urgent files. Finally, the relative probabilities of blocked urgent files and blocked regular files are used as an indicator of efficiency in reserving connections.

[1]  Hairong Qi,et al.  Control-Based Real-Time Metadata Matching for Information Dissemination , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[2]  Vladimir V. Korolyuk,et al.  Stochastic Models of Systems , 1999 .

[3]  Edward Shih-Tse Wang,et al.  Why do customers utilize the internet as a retailing platform , 2009 .

[4]  Mohamed Gamal Aboelmaged,et al.  Six Sigma quality: a structured review and implications for future research , 2010 .

[5]  Mihaela van der Schaar,et al.  Pricing and Incentives in Peer-to-Peer Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Thomas Magedanz,et al.  Critical Issues for QoS Management and Provisioning in the IP Multimedia Subsystem , 2008, Journal of Network and Systems Management.

[7]  Jun-Der Leu,et al.  An Effective Approach for Content Delivery in an Evolving Intranet Environment - A Case Study of the Largest Telecom Company in Taiwan , 2005, WISE.

[8]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[9]  Victor C. M. Leung,et al.  Joint connection admission control and routing in IEEE 802.16-based mesh networks , 2008, IEEE Transactions on Wireless Communications.

[10]  Reuven Cohen,et al.  Path Switching and Grading Algorithms for Advance Channel Reservation Architectures , 2009, IEEE/ACM Transactions on Networking.

[11]  Evangelos Chaniotakis,et al.  Load-balancing for advance reservation connection rerouting , 2010, IEEE Communications Letters.

[12]  Emmanouel A. Varvarigos,et al.  Routing and scheduling connections in networks that support advance reservations , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[13]  Morris Sloman,et al.  A survey of quality of service in mobile computing environments , 1999, IEEE Communications Surveys & Tutorials.

[14]  Kai Liu,et al.  Performance analysis of data scheduling algorithms for multi-item requests in multi-channel broadcast environments , 2010 .

[15]  Ping-Yu Hsu,et al.  Disaster avoidance mechanism for content-delivering service , 2009, Comput. Oper. Res..

[16]  Xin Yao,et al.  Resource allocation in decentralised computational systems: an evolutionary market-based approach , 2009, Autonomous Agents and Multi-Agent Systems.

[17]  Przemyslaw Ignaciuk,et al.  Dead-beat and reaching-law-based sliding-mode control of perishable inventory systems , 2011 .