Implementing congestion control in the real world

It is well known that congestion control is a key issue for the safe deployment of multimedia applications over IP. We describe our initial experiences implementing TCP-friendly congestion control in a system designed to deliver HDTV content over IP networks. In particular we discuss the effects of packet reordering on the calculated throughput, and highlight the problems this can pose for high-rate applications

Holographic and 3D teleconferencing and visualization: implications for terabit networked applications

Abstract not available

Rtp and the datagram congestion control protocol

We describe how the new Datagram Congestion Control Protocol (DCCP) can be used as a bearer for the Real-time Transport Protocol (RTP) to provide a congestion controlled basis for networked multimedia applications. This is a step towards deployment of congestion control for such applications, necessary to ensure the future stability of the best-effort network if high-bandwidth streaming and IPTV services are to be deployed outside of closed QoS-managed networks

Packet reordering, high speed networks and transport protocol performance

We performed end-to-end measurements of UDP/IP flows across an Internet backbone network. Using this data, we characterized the packet reordering processes seen in the network. Our results demonstrate the high prevalence of packet reordering relative to packet loss, and show a strong correlation between packet rate and reordering on the network we studied. We conclude that, given the increased parallelism in modern networks and the demands of high performance applications, new application and protocol designs should treat packet reordering on an equal footing to packet loss, and must be robust and resilient to both in order to achieve high performance

Compact routing on the Internet AS-graph

Compact routing algorithms have been presented as candidates for scalable routing in the future Internet, achieving near-shortest path routing with considerably less forwarding state than the Border Gateway Protocol. Prior analyses have shown strong performance on power-law random graphs, but to better understand the applicability of compact routing algorithms in the context of the Internet, they must be evaluated against real- world data. To this end, we present the first systematic analysis of the behaviour of the Thorup-Zwick (TZ) and Brady-Cowen (BC) compact routing algorithms on snapshots of the Internet Autonomous System graph spanning a 14 year period. Both algorithms are shown to offer consistently strong performance on the AS graph, producing small forwarding tables with low stretch for all snapshots tested. We find that the average stretch for the TZ algorithm increases slightly as the AS graph has grown, while previous results on synthetic data suggested the opposite would be true. We also present new results to show which features of the algorithms contribute to their strong performance on these graphs

Skew detection and compensation for Internet audio applications

Long lived audio streams, such as music broadcasts, and small differences in clock rates lead to buffer underflow or overflow events in receiving applications that manifest themselves as audible interruptions. We present a low complexity algorithm for detecting clock skew in network audio applications that function with local clocks and in the absence of a synchronization mechanism. A companion algorithm to perform skew compensation is also presented. The compensation algorithm utilises the temporal redundancy inherent in audio streams to make inaudible playout adjustments. Both algorithms have been implemented in a simulator and in a network audio application. They perform effectively over the range of observed clock rate differences and beyond

Poor Man's Content Centric Networking (with TCP)

A number of different architectures have been proposed in support of data-oriented or information-centric networking. Besides a similar visions, they share the need for designing a new networking architecture. We present an incrementally deployable approach to content-centric networking based upon TCP. Content-aware senders cooperate with probabilistically operating routers for scalable content delivery (to unmodified clients), effectively supporting opportunistic caching for time-shifted access as well as de-facto synchronous multicast delivery. Our approach is application protocol-independent and provides support beyond HTTP caching or managed CDNs. We present our protocol design along with a Linux-based implementation and some initial feasibility checks

Experiences with high definition interactive video conferencing

We review the design and implementation of UltraGrid, a new high definition video conferencing system, and present some experimental results. UltraGrid was the first system to support gigabit rate high definition interactive video conferencing on commodity systems and networks, and we present measurements to illustrate behavior of production networks subject to such real time traffic. We illustrate the benefits of hybrid IP/provisioned optical networks over best effort IP networks for this class of traffic, and motivate the development of congestion control algorithms for interactive conferencing on best effort IP networks

GeV to TeV astrophysical tau neutrinos

Neutrinos with energy greater than GeV are copiously produced in the p(A,p) interactions occurring in several astrophysical sites such as (i) the earth atmosphere, (ii) our galactic plane as well as in (iii) the galaxy clusters. A comparison of the tau and mu neutrino flux in the presence of neutrino oscillations from these three representative astrophysical sites is presented. It is pointed out that the non-atmospheric tau neutrino flux starts dominating over the downward going atmospheric tau neutrino flux for neutrino energy E as low as 10 GeV. This energy value is much lower than the energy value, E \geq 5\times 10^4 GeV, estimated for the dominance of the non-atmospheric mu neutrino flux, in the presence of neutrino oscillations. Future prospects for possible observations of non-atmospheric tau neutrino flux are briefly mentioned.Comment: 17 pages, 5 figures (to appear in PLB

Common Data Elements for National Institute of Mental Health–Funded Translational Early Psychosis Research

The National Institutes of Health has established the PhenX Toolkit as a web-based resource containing consensus measures freely available to the research community. The National Institute of Mental Health (NIMH) has introduced the Mental Health Research Core Collection as part of the PhenX Toolkit and recently convened the PhenX Early Psychosis Working Group to generate the PhenX Early Psychosis Specialty Collection. The Working Group consisted of two complementary panels for clinical and translational research. We review the process, deliberations, and products of the translational research panel. The Early Psychosis Specialty Collection rationale for measure selection as well as additional information and protocols for obtaining each measure are available on the PhenX website (https://www.phenxtoolkit.org). The NIMH strongly encourages investigators to use instruments from the PhenX Mental Health Research Collections in NIMH-funded studies and discourages use of alternative measures to collect similar data without justification. We also discuss some of the potential advances that can be achieved by collecting common data elements across large-scale longitudinal studies of early psychosis