Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2018
Providing multicast services over SDN-evolved LTE network: Architecture, procedures and performance analysis
Computer Communications (COMS), Volume 127, Issue CPages 131–145https://doi.org/10.1016/j.comcom.2018.06.007AbstractThe recent innovation in cellular technologies like LTE/LTE-Advanced has increased the demand of high bandwidth services e.g. mobile Internet Protocol TV (IPTV), on-demand video streaming etc. However, current cellular multicast ...
- articleNovember 2014
Characterization and modeling of video popularity
International Journal of Communication Systems (IJOCS), Volume 27, Issue 11Pages 2604–2615https://doi.org/10.1002/dac.2493Popularity of videos is a key factor for the design and management of a streaming media system. In this paper, three factors representing clients' access to a media system are investigated to characterize popularity. One of the factors is the commonly ...
- ArticleJune 2009
An Approximate Top-k Query Algorithm in Distributed Networks
CINC '09: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02Pages 417–420https://doi.org/10.1109/CINC.2009.182In this paper, we propose a variant algorithm Rough Classification based on the Precutting parameter p (RCP). As the distribution of page requests generally follows a Zipf-like distribution, RCP precuts the object by predicting the derived bounds and so ...
- articleOctober 2006
A dynamic caching algorithm based on internal popularity distribution of streaming media
Most proxy caches for streaming videos do not cache the entire video but only a portion of it. This is partly due to the large size of video objects. Another reason is that the popularity of different parts of a video can be different, e.g., the prefix ...
- ArticleApril 2006
An Empirically-Based Criterion for Determining the Success of an Open-Source Project
ASWEC '06: Proceedings of the Australian Software Engineering ConferencePages 363–368https://doi.org/10.1109/ASWEC.2006.12In order to determine a success criterion for open-source software projects, we analyzed 122,205 projects in the SourceForge database. There were 80,597 projects with no downloads at all. We restricted our analysis to the 41,608 projects that together ...
- articleAugust 2005
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON), Volume 13, Issue 4Pages 790–801https://doi.org/10.1109/TNET.2005.852881Workload distribution is critical to the performance of network processor based parallel forwarding systems. Scheduling schemes that operate at the packet level, e.g., round-robin, cannot preserve packet-ordering within individual TCP connections. ...
- ArticleOctober 2004
An empirical study of spam traffic and the use of DNS black lists
IMC '04: Proceedings of the 4th ACM SIGCOMM conference on Internet measurementPages 370–375https://doi.org/10.1145/1028788.1028838This paper presents quantitative data about SMTP traffic to MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL) based on packet traces taken in December 2000 and February 2004. These traces show that the volume of email has increased ...
- research-articleDecember 1993
A Parallel Hash Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 4, Issue 12Pages 1355–1371https://doi.org/10.1109/71.250117Presents a parallel hash join algorithm that is based on the concept of hierarchicalhashing, to address the problem of data skew. The proposed algorithm splits the usualhash phase into a hash phase and an explicit transfer phase, and adds an ...
- research-articleJanuary 1993
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 4, Issue 1Pages 70–86https://doi.org/10.1109/71.205654A parallel sort-merge-join algorithm which uses a divide-and-conquer approach to address the data skew problem is proposed. The proposed algorithm adds an extra, low-cost scheduling phase to the usual sort, transfer, and join phases. During the ...