Mutual Anonymity for Mobile P2P Systems
Mobile Peer-to-Peer Networks (MOPNETs) in Wireless Mobile Ad Hoc Networks (MANET) have become very popular applications due to their easy communication and resource sharing patterns in unfixed network infrastructures. As privacy and security is coming ...
On Sustained QoS Guarantees in Operated IEEE 802.11 Wireless LANs
Most of QoS-capable IEEE 802.11 MAC protocols are unable to deliver sustained quality of service while maintaining high network utilization, particularly under congested network conditions. The problem often resides in the fact that flows belonging to ...
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuously Delivery Message Dissemination (CDMD) problem over the n processor single-port complete (all links are present and are bi-directional) static network with the multicasting communication primitive. This problem has been shown ...
Extending the TokenCMP Cache Coherence Protocol for Low Overhead Fault Tolerance in CMP Architectures
It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On the other hand, Chip-multiprocessors (CMP) that integrate several processor ...
Implementation of Distributed Floor Control Protocols on Overlay Networks
Collaborative multimedia applications (CMAs) on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include networked games and collaborative design and simulation. An important ...
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Qkn in which the number of node faults fv and the number of link faults fe are such that fn+fe ≤ 2n-2. We prove that given any two healthy nodes s and e of Qkn, there is a path from s to e ...
Evaluating Dynamic Task Mapping in Network Processor Runtime Systems
Modern network processor systems require the ability to adapt their processing capabilities at runtime to changes in network traffic. Traditionally, network processor applications have been optimized for a single static workload scenario, but recently ...
A Tree-Based Peer-to-Peer Network with Quality Guarantees
Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system-wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P ...
A Framework to Provide Quality of Service over Advanced Switching
Advanced Switching (AS) is a network technology that expands the capabilities of PCI-Express adding new features like peer-to-peer communication. Together, PCI Express and AS have the potential for building the next generation interconnects. Furthermore,...
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems
The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world this assumption is unrealistic as the processors are ...
Analysis of Distributed Random Grouping for Aggregate Computation on Wireless Sensor Networks with Randomly Changing Graphs
Dynamical connection graph changes are inherent in networks such as peer-to-peer networks, wireless ad hoc networks, and wireless sensor networks. Considering the influence of the frequent graph changes is thus essential for precisely assessing the ...