Analysis and modelling of concurrent communicationsover high performance networks. Improving processor capabilities by increasing the number of cores produces sharing effects over com-puter components among core requests. Furthermore, parallel applications from scientific fields attempt tofully exploit the resources of parallel architectures. Therefore, understanding resource-sh...

In this work we study the effect data and instruction sharing on cache miss rates. We then extend an analytical system-level throughput model to take multi-threaded data and instruction sharing into account. We use the model to provide insights into the interaction of thread count, cache size, off-chip bandwidth, and, sharing, on system throughput. Using specific examples we teach how the model...

A bandwidth-sharing scheme for group video conferencing is presented in this paper. The key features of the scheme are the monitoring of user behavior and message passing, which are used by each client in order to identify and report their interest in other group members. Each video sender operates on the information about other users’ interest in order to adjust the sender’s own frame rate, re...

The required real-time and high-rate transfers for multimedia data severely limit the number of requests that can be serviced concurrently by Video-on-Demand (VOD) servers. Resource sharing techniques can be used to address this problem. We study how VOD servers can support heterogeneous receivers while delivering data in a client-pull fashion using enhanced resource sharing. We propose three h...

This paper investigates a new spectrum sharing algorithm based on price in cognitive radio networks. A supply and demand model between primary users and secondary users is established to decide the price of free spectrum leased by primary users. Considering the utility of primary users and the total bandwidth while deciding the price per bandwidth using supply and demand balance (the spectrum s...

In this paper we address two problems, for which we present novel, efficient, algorithmic solutions. The first problem is motivated by practical situations and is concerned with the efficient estimation of the upload bandwidth of a machine, particularly in the context of a peer-to-peer content sharing and distribution application. The second problem is more of a theoretical nature and considers...

This paper examines the interactions between high speed Ethernet switches and TCP in high bandwidth delay product networks. First, the behavior of a range of Ethernet switches when two long lived connections compete to the same output port is investigated. Then we study the impact of these switches behaviors on TCP protocols in long and fast networks (LFNs). Several conditions in which scheduli...

In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...

In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...

The UTRA TDD specification for wireless communication systems can be exploited to dynamically allocate users bandwidth. This paper investigates a Fair Packet Loss Sharing (FPLS) scheduling algorithm which attempts to satisfy the quality of service and delay requirements of all users and Fair Share Dynamic Channel Allocation (FSDCA) which utilizes FPLS in order to dynamically allocate users band...