YouTube has become the most successful Internet website providing a new generation of short video sharing service since its establishment in early 2005. YouTube has a great impact on Internet traffic nowadays, yet itself is suffering from a severe problem of scalability. Therefore, understanding the characteristics of YouTube and similar sites is essential to network traffic engineering and to their sustainable development. To this end, we have crawled the YouTube site for four months, collecting more than 3 million YouTube videos' data. In this paper, we present a systematic and in-depth measurement study on the statistics of YouTube videos. We have found that YouTube videos have noticeably different statistics compared to traditional streaming videos, ranging from length and access pattern, to their growth trend and active life span. We investigate the social networking in YouTube videos, as this is a key driving force toward its success. In particular, we find that the links to related videos generated by uploaders' choices have clear small-world characteristics. This indicates that the videos have strong correlations with each other, and creates opportunities for developing novel techniques to enhance the service quality.

/pdf/statistics-and-social-network-of-youtube-videos-4g8j2q74fy.pdf

Statistics and Social Network of YouTube Videos

Trust is an important concept in human interactions which facilitates the formation and continued existence of functional human societies. In the first decade of the 21st century, computational trust models have been applied to solve many problems in wireless communication systems. This cross-disciplinary research has yielded many innovative solutions. In this paper, we examine the latest methods which have been proposed by researchers to manage trust and reputation in wireless communication systems. Specifically, we survey the state of the art in the application of trust models in the fields of mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), and cognitive radio networks (CRNs). We classify the mainstream methods into natural categories and illustrate how they complement each other in achieving design goals. Major research directions are also outlined.

A Survey of Trust and Reputation Management Systems in Wireless Communications

We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capturing the concept of acceptance qua member of an institution as the kind of attitude that agents are committed to when they are “functioning as members of an institution”. Acceptance logic can also be used to model judgement aggregation: it deals with how a collective acceptance of the members of an institution about a certain fact φ is created from the individual acceptances of the members of the institution. The contribution of this paper is to present a tableau method for the logic of acceptance. The method automatically decides whether a formula of the logic of acceptance is satisfiable thereby providing an automated reasoning procedure for judgement aggregation in the logic of acceptance.

/pdf/declarative-agent-languages-and-technologies-iv-19ivc6j86j.pdf

Declarative Agent Languages and Technologies IV

Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Established in 2005, YouTube has become the most successful Internet site providing a new generation of short video sharing service. Today, YouTube alone comprises approximately 20% of all HTTP traffic, or nearly 10% of all traffic on the Internet. Understanding the features of YouTube and similar video sharing sites is thus crucial to their sustainable development and to network traffic engineering. In this paper, using traces crawled in a 3-month period, we present an in-depth and systematic measurement study on the characteristics of YouTube videos. We find that YouTube videos have noticeably different statistics compared to traditional streaming videos, ranging from length and access pattern, to their active life span, ratings, and comments. The series of datasets also allows us to identify the growth trend of this fast evolving Internet site in various aspects, which has seldom been explored before. We also look closely at the social networking aspect of YouTube, as this is a key driving force toward its success. In particular, we find that the links to related videos generated by uploaders' choices form a small-world network. This suggests that the videos have strong correlations with each other, and creates opportunities for developing novel caching or peer-to-peer distribution schemes to efficiently deliver videos to end users.

Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study

Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes forward packets for each other, allowing communication among nodes outside wireless transmission range hop by hop. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. Attacks on ad hoc network routing protocols disrupt network performance and reliability. This paper attempts to provide a comprehensive overview of attacks and secure routing. It first analyzes the reason that ad hoc network is vulnerable to attacks. Then it presents the well known attacks and the popular secure protocols.

A Survey of Secure Routing in Ad Hoc Networks

/pdf/anti-collusive-self-healing-key-distribution-scheme-with-2cwocfdlfh.pdf

Anti-collusive Self-healing Key Distribution Scheme with Revocation Capability

Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, heterogeneity, adaptability, and scalability emerge as tough challenges for the design of multisite job scheduling models and algorithms. This paper presents a new multisite job scheduling schema based on the multisite job scheduling model and the performance model for a heterogeneous grid environment. There are three key components: resource selection, reservation, and backfilling. The optimal and greedy-heuristic adaptive resource selection strategies are introduced. The conservative and easy backfilling are incorporated into the backfilling procedure. Experiments indicate that the scheduler and the algorithm are effective and perform better than a non-adaptive algorithm.

/pdf/multisite-co-allocation-algorithms-for-computational-grid-3k22389owc.pdf

Multisite co-allocation algorithms for computational grid

This paper seeks to quantitatively understand the nature of the current threat towards the common name servers. A new tracking technique based on statistical model is proposed to locate the anomalous name servers by analyzing the real-world DNS traffic. After summarizing the attacks towards DNS, the detection method based on associative feature analysis is presented. Experiments are conducted which highlighting both the payload anomaly and the data flow anomaly, and the experimental results reveal the efficiency of our method in detecting the anomalous behaviors of name servers.

Tracking anomalous behaviors of name servers by mining DNS traffic

Summary form only given. Multisite resource selection and task scheduling is paid more and more attention under the grid environment nowadays with the emergence of high speed WAN. Especially in a distributed computational grid, multisite resource selection and scheduling can significantly reduce the average execution time of grand applications with a limited demand in communication. Therefore we present a CGRS resource selection algorithm based on a new density-based grid resource-clustering algorithm, and implement it in our scalable environment. The analysis and experimental results show the correctness and effectiveness of our resource selection algorithm.

Mingzeng Hu

Papers

A Survey of Secure Routing in Ad Hoc Networks

Anti-collusive Self-healing Key Distribution Scheme with Revocation Capability

Multisite co-allocation algorithms for computational grid

Tracking anomalous behaviors of name servers by mining DNS traffic

Multisite resource selection and scheduling algorithm on computational grid