Idris A. Rai

Learn 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)
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 bookmarking. We illustrate how such functionality may have a dramatic(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)
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)
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 advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes connecting to peer-to-peer networks. However, the characteristics of mobile nodes and limitations of access point coverage often cause mobile nodes to lose connectivity, which can(More)
We present numerical analysis that campares the performances of PS, SRPT , and FB scheduling polcies in terms of their conditional mean response times in an M/G/1 model, where G represents an exponential job size distribution or a job size distribution with highly varying sizes such as heavy tailed distribution. The results show that for heavy tailed job(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)
We analyze routing algorithm for wireless sencor networks called Power Aware Differentiated Routing (PADR), which is proposed for collaborative routing of Real-time (RT) and Non-real time (NRT) traffic in a sensor field in order to prolong the otherwise shorter life time of RT sensor network. PADR uses nodes in the non-real time network as backup for(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)