Search arXivSearch

arXiv · 0804.3215

Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic

Abstract

Packet-switching WDM ring networks with a hotspot transporting unicast, multicast, and broadcast traffic are important components of high-speed metropolitan area networks. For an arbitrary multicast fanout traffic model with uniform, hotspot destination, and hotspot source packet traffic, we analyze the maximum achievable long-run average packet throughput, which we refer to as \textit{multicast capacity}, of bi-directional shortest-path routed WDM rings. We identify three segments that can experience the maximum utilization, and thus, limit the multicast capacity. We characterize the segment utilization probabilities through bounds and approximations, which we verify through simulations. We discover that shortest-path routing can lead to utilization probabilities above one half for moderate to large portions of hotspot source multi- and broadcast traffic, and consequently multicast capacities of less than two simultaneous packet transmissions. We outline a one-copy routing strategy that guarantees a multicast capacity of at least two simultaneous packet transmissions for arbitrary hotspot source traffic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthias an der Heiden, Michel Sortais, Michael Scheutzow, Martin Reisslein, Martin Maier. 2008-04-20. Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic. https://doi.org/10.1016/j.osn.2011.05.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT