Designing virus-resistant networks: A game-formation approach

Forming, in a decentralized fashion, an optimal network topology while balancing multiple, possibly conflicting objectives like cost, high performance, security and resiliency to viruses is a challenging endeavor. In this paper, we take a game-formation approach to network design where each player, for instance an autonomous system in the...

Domination-time dynamics in susceptible-infected-susceptible virus competition on networks

When two viruses compete for healthy nodes in a simple network and both spreading rates are above the epidemic threshold, only one virus will survive. However, if we prevent the viruses from dying out, rich dynamics emerge. When both viruses are identical, one virus always dominates the other, but the dominating and dominated virus alternate. We...

Finding Critical Regions and Region-Disjoint Paths in a Network

Due to their importance to society, communication networks should be built and operated to withstand failures.However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their...

Gossip-based counting in dynamic networks

We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a...

Impairment-aware path selection and regenerator placement in translucent optical networks

Physical impairments, such as noise and signal distortions, negatively affect the quality of information transfer in optical networks. The effect of physical impairments predominantly augments with distance and bit rate of the signal to the point that it becomes detrimental to the information transfer. To reverse the effect of physical...

Measurement study of multi-party video conferencing

More and more free multi-party video conferencing applications are readily available over the Internet and both Server-to-Client (S/C) or Peer-to-Peer (P2P) technologies are used. Investigating their mechanisms, analyzing their system performance, and measuring their quality are important objectives for researchers, developers and end users. In...

Impairment-Aware Path Selection in Translucent Optical Networks

Physical impairments, such as noise and signal distortions, negatively affect the quality of information transport in optical networks. The effect of physical impairments augments with distance and bit rate of the signal to the point that it becomes detrimental to the information transfer. To reverse the effect of physical impairments, the...

Topology dynamics in a P2PTV network

In recent years, a number of commercial peer-to-peer TV (P2PTV) applications have been launched. Yet, their mechanisms and characteristics are unknown. In this paper, we study SopCast, a typical proprietary P2PTV system. Treating SopCast as a black box, we perform a set of experiments that are suitable to analyze SopCast in depth. We attempt to...

On-line survivable routing in WDM networks

In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...

Dynamic Routing in QoS-aware Traffic Engineered Network

The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements, they often do not consider the perspective of service providers. Service providers aim at maximizing the throughput and the number of accepted requests. These goals have been addressed by...

QoS routing: Average complexity and hopcount in m dimensions

QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to...

On-line Survivable Routing in WDM Networks

In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...

Analytical Model for Mesh-based P2PVoD

Recently, there has been a growing interest in academic and commercial environments for Video-on-Demand (VoD) using Peer-to-Peer (P2P) technology. Unlike centralized solutions for VoD services, P2P technology lets the clients distribute video content among themselves. In this paper, we propose an analytical model for P2PVoD and we compare that...

On the Quality of Experience of SopCast

Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial enviornments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies...