Search

The paper presents an admission approach for IPTV service providers that is designed to minimize QoS violations whilst effectively utilizing available bandwidth. Central to the approach is an empirical method of estimating the effective bandwidth required to satisfy QoS targets for admitted traffic flows. The paper describes this method and specifies two admission control algorithms based on the use of effective bandwidth estimates. The first algorithm employs a simple evaluation of whether there is sufficient bandwidth available to ensure, with an appropriate degree of confidence, that QoS targets will not be violated if a requested flow is admitted. The second algorithm utilizes information relating to the cost, duration and request frequency of specific IPTV content to prioritize higher revenue flows within the admission control process. Results of a simulation study (employing real traffic traces of long-lived flows) indicate that the proposed algorithms ensure that an adequate, but not overly generous, amount of bandwidth is allocated to ensure that QoS targets for accepted flows are met. Furthermore, they demonstrate the potential advantage of using content specific information in the admission control process to maximize generated revenue. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a novel prediction method and a communication protocol is proposed for distributed motion tracking systems, for example robot control system over the Internet based on on-line visual information. It is assumed that the trajectory generator part of the control system is connected to the low level controller through wide area network (WAN). In this case the variable network delay, packet losses, irregular packet arrival can severely influence the control characteristics (transient behavior and tracking performance) in a negative sense. The proposed prediction method is based on dynamic filters and it generates the trajectory on the control system side in the control periods when no new information on the time varying reference trajectory arrives through the network. The developed application level communication protocol is meant to keep the packet loss under a predefined limit even if the network bandwidth varies below the value required by the control application. Simulations and real-time experiments show that the prediction algorithm applied jointly with the proposed communication protocol can effectively compensate the effect of networked communication on control characteristics. [Copyright &y& Elsevier]

These days there is a clear trend toward extending the reach of passive optical networks to cover large geographical areas, which enables reduction of the number of central offices and hence has the potential of cost saving in network operation. On the other hand, this reach extension necessitates the design of efficient dynamic bandwidth allocation schemes in order to tackle performance degradation caused by the increased propagation delay in long reach PONs. Among many existing approaches, the multithread- based DBA scheme where several bandwidth allocation processes are performed in parallel is considered one of the most effective options to improve network performance in LRPONs. We have found that without proper intercommunication between the overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional singlethread algorithm. With this in mind, this article reviews different inter-thread scheduling schemes for LR-PONs, and proposes a novel approach of integrating the key ideas of the existing ones. Extensive simulation results confirm that our proposed scheme can significantly improve DBA performance for LR-PONs under a variety of scenarios with consideration of different values of network load and reach. [ABSTRACT FROM PUBLISHER]

In a peer-to-peer overlay network, the phenomenon of multiple overlay links sharing bottleneck physical links leads to correlation of overlay link capacities. We are able to more accurately model the overlay by incorporating these linear capacity constraints (LCCs). We formulate the problem of maximizing bandwidth in overlay multicast using our LCC model. We show that finding a maximum bandwidth multicast tree in an overlay network with LCC is NP-complete. Therefore, an efficient heuristics algorithm is designed to solve the problem. Extensive simulations show that our algorithm is able to construct multicast trees that are optimal or extremely close to optimal, with significantly higher bandwidth than trees formed in overlays with no LCC. Furthermore, we develop a fully distributed algorithm for obtaining near-optimal multicast trees, by means of gossip-based algorithms and a restricted but inherently distributed class of LCC (node-based LCC). We demonstrate that the distributed algorithm converges quickly to the centralized optimal and is highly scalable. [ABSTRACT FROM AUTHOR]