Learn More
This paper presents a detailed characterisation of user behaviour for a series of interactive sport videos from the 2006 FIFA World Cup. In addition to generic VCR-like features, our custom-built Video-on-Demand architecture enabled us to provide advanced interactivity features such as book-marking. We illustrate how such functionality may have a dramatic(More)
Recent studies of Internet traffic have shown that flow size distributions often exhibit a high variability property in the sense that most of the flows are short and more than half of the total load is constituted by a small percentage of the largest flows. In the light of this observation, it is interesting to revisit scheduling policies that are known to(More)
The Internet today carries different types of traffic that have different service requirements. A large fraction of the traffic is either Web traffic requiring low response time or peer-to-peer traffic requiring high throughput. Meeting both performance requirements in a network where routers use droptail or RED for buffer management and FIFO as the service(More)
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for short flows while not significantly increasing the average flow time for the long flows that share the same bottleneck. No modification of the packet headers is required to implement(More)
Recent Internet traffic measurements reveal that Internet traffic exhibits high coefficient of variability (CoV). That is, the Internet traffic consists of many small jobs and very few large jobs, and less than 1% of the largest jobs constitute more than half of the load. Consequently, we propose to use policies that take advantage of this attribute to(More)
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for short flows, while not significantly increasing the average flow time for the long flows that share the same bottleneck. No modification of the packet headers is required to implement(More)
Most Distributed Hash Tables (DHTs) simply consider interconnecting <i>homogeneous</i> nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional DHTs have been shown to exhibit poor performance in a real-world environment. Additionally, we believe that it is this(More)
This paper presents a detailed character-isation of user behaviour for a series of interactive video experiments over a 12 month period, in which we served popular sporting and musical content. In addition to generic VCR-like features, our custom-built Video-on-Demand application provides advanced inter-activity features such as bookmarking. The dramatic(More)
We propose using least attained service (LAS) scheduling in network routers to prevent some connections against utilizing all or a large fraction of network bandwidth. This phenomenon, which is also known as bandwidth hogging , occurs in heterogeneous networks such as networks with connections that have varying propagation delays, networks with competing(More)