In this paper. we consider an admission control algorithm for cellular networks. It is based on direct/dynamic monitoring of the QoS performances - the delay tail of the admitted users. The main purpose of the direct monitoring of QoS performances is to guarantee the required QoS provision more precisely. The system delay tail is effectively computed by the proposed delay tail estimation algorithm. With the estimated delay tails, each base station determines the admission or rejection for a new user to the system. By doing so, the admission control algorithm becomes more robust against time-varying fading channel environment. Simulation results in OFDMA cellular system shows that the proposed algorithm can provide substantial capacity gains in offering QoS. We also use a general Neyman-Pearson-like framework in evaluating various admission control mechanisms.

In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori configuration decisions (such as core selection). The protocol is resource-efficient, robust, flexible, and scalable. In addition, our protocol is provably loop-free.Our protocol starts with a resources-saving tree (Shared Tree) and individual receivers switch to a QoS-competitive tree (Source-Based Tree) when necessary. In both trees, the new destination is able to choose the most promising among several paths. An innovation is that we use dynamic routing information without relying on a link state exchange protocol to provide it. Our protocol limits the effect of pre-configuration decisions drastically, by separating the management from the data transfer functions; administrative routers are not necessarily part of the tree. This separation increases the robustness, and flexibility of the protocol. Furthermore, QoSMIC is able to adapt dynamically to the conditions of the network.The QoSMIC protocol introduces several new ideas that make it more flexible than other protocols proposed to date. In fact, many of the other protocols, (such as YAM, PIMSM, BGMP, CBT) can be seen as special cases of QoSMIC. This paper presents the motivation behind, and the design of QoSMIC, and provides both analytical and experimental results to support our claims.

Proposes delegated tuning and forwarding (DTF), a new architecture for dynamically assigning wavelength channels in a "broadcast star" optical network. DTF exploits tunable components without making excessive demands on tuner agility by combining the tuning on demand of receivers with the forwarding of packets over a logical topology. The authors describe the control algorithms of DTF and prove some results establishing their stability and robustness. They show by simulation that DTF achieves lower hop-counts in conditions of light-to-moderate load than do DeBruijn graph networks. When a DTF network is saturated, the average number of hops in each path is only about 10% higher than the average for a DeBruijn graph network, suggesting that, even under high loads, the evolution of network topology under DTF is close to optimal.>