In cognitive radio networks a secondary user needs to estimate the primary users’ air traffic patterns so as to optimize its transmission strategy. In this chapter, the authors describe a nonparametric Bayesian method for identifying traffic applications, since the traffic applications have their own distinctive air traffic patterns. In the proposed algorithm, the collapsed Gibbs sampler is app...

In this paper, a new binary erasure correction algorithm for packet loss recovery and a packet oriented conditional access technique based on a novel stream cipher are proposed. Short-length binary linear block codes are used, with erasure correction based on two hard-decision decodings, look-up tables and simple logic for Hamming distance computation, comparison and selection between the two h...

In this paper, a scalable variable-length packet switch using multistage interconnection network is proposed. The architecture consists of multiple non-buffer switch elements, interconnected with perfect shuffle pattern and with ring topology. Each input port is connected to a switch element in a different stage, and packets applied from these ports are routed to their destined output ports bas...

This paper considers the scheduling problem of packet transmissions in a TDM/WDM unidirectional optical ring network. Our objective is to design a scheduling scheme for packet transmission with minimum scheduling length satisfying a set of traffic requirements. We focus on a fairly general case in that non-uniform traffic demands and arbitrary transmitter tuning latencies are allowed. Since the...

The central result of this paper is an analytic formula describing the packet loss probability in a buffer as a function of the length of the buffer and the probability of external packet loss. This formula makes it possible to calculate the total loss along a multi-buffer, multi-link route. Also, new types of congestion window distributions are discovered when the packet loss in the buffer is ...

In this paper, we address the design of multi-hop packet transmissions for the All-to-All Broadcast (AAB) problem in a Wavelength Division Multiplexing (WDM) optical star network with N nodes. The tunable transmitter on each node needs a nonnegligible tuning latency δ to switch between wavelengths. To decrease the affection of the packet delay in multi-hop scheduling, the maximum of hop distanc...

This paper proposes a new packet rate scheduling scheme for a non-real time data service over the uplink of a burst switching-based direct sequence code division multiple access (DS/CDMA) system to support the integrated voice/data service. We consider the most general form of optimization problem formulation to determine the optimal number of transmission-time groups along with their data rate...

In this paper, we address the question of whether the packet drop rate of a bottleneck router measured (experienced) by probe packets can accurately reflect the bottleneck router’s real packet drop rate. To answer this question, we built a testbed network and conducted several real experiments on it. In these experiments, using various traffic types and loads, we compared the probed and the rea...

Programmable network paradigm allows packet processing in the routers within the data path. One of the key problems in programmable networks is the inability to determine execution times of packets from information in headers for scheduling which is in contrast to using packet length in transport resources scheduling. This paper presents a scheduling algorithm called Prediction based Fair Queue...

We present a generic approximation of the packet error rate (PER) function of uncoded schemes in the AWGN channel using extreme value theory (EVT). The PER function can assume both the exponential and the Gaussian Q-function bit error rate (BER) forms. The EVT approach leads us to a best closed-form approximation, in terms of accuracy and computational efficiency, of the average PER in block-fa...