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...

An Overview of Algorithms for Network Survivability

Network survivability—the ability to maintain operation when one or a few network components fail—is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding...

Impairment-Aware Routing in Translucent Spectrum-Sliced Elastic Optical Path Networks

Spectrum-sliced elastic optical path (SLICE) technology offers a more flexible bandwidth allocation in optical networks than wavelength division multiplexing. It allows different connections to be served via different modulation formats. However, as with any optical network, the optical signal may be susceptible to signal impairments, especially...

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...

Survivable Impairment-Aware Traffic Grooming

Traffic grooming allows efficient utilization of network capacity by aggregating several independent traffic streams into a wavelength. In addition, survivability and impairment-awareness (i.e., taking into account the effect of physical impairments) are two important issues that have gained a lot of research interest in the area of optical...

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...

Context-Aware Route Planning

In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both...

Techniques for measuring quality of experience

Quality of Experience (QoE) relates to how users perceive the quality of an application. To capture such a subjective measure, either by subjective tests or via objective tools, is an art on its own. Given the importance of measuring users’ satisfaction to service providers, research on QoE took flight in recent years. In this paper we present...

Inter-domain routing in optical networks wavelength converters

With the increasing deployment of wavelength division multiplexing (WDM) optical networks, the need for advanced lightpath provisioning algorithms and protocols in a multi-domain setting is becoming evident. In order to increase efficiency by relaxing the wavelength continuity constraint in WDM optical networks, wavelength converters are often...

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...

Variants of the Min-Sum Link-Disjoint Paths Problem

A survivable connection usually requires computing link-disjoint primary and backup paths. Finding a min-sum pair of link-disjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NP-complete. In this paper, we study different variants of the min-sum link-disjoint...

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...

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...