How does TCP generate Pseudo-self-similarity?

Long-range dependence has been observed in many recent Internet traffic measurements. In addition, some recent studies have shown that under certain network conditions, TCP itself can produce traffic that exhibits dependence over limited timescales, even in the absence of higher-level variability. In this paper, we use a simple Markovian model to argue that when the loss rate is relatively high, TCP's adaptive congestion control mechanism indeed generates traffic with OFF periods exhibiting power-law shape over several timescales and thus introduces pseudo-long-range dependence into the overall traffic. Moreover, we observe that more variable initial retransmission timeout values for different packets introduces more variable packet inter-arrival times, which increases the burstiness of the overall traffic. We can thus explain why a single TCP connection can produce a time-series that can be misidentified as self-similar using standard tests.

Adaptive Reliable Multicast

An increasing number of applications, such as distributed interactive simulation, live auctions, distributed games and collaborative systems, require the network to provide a reliable multicast service. This service enables one sender to reliably transmit data to multiple receivers. Reliability is traditionally achieved by having receivers send negative acknowledgments (NACKs) to request from the sender the retransmission of lost (or missing) data packets. However, this Automatic Repeat reQuest (ARQ) approach results in the well-known NACK implosion problem at the sender. Many reliable multicast protocols have been recently proposed to reduce NACK implosion. But, the message overhead due to NACK requests remains significant. Another approach, based on Forward Error Correction (FEC), requires the sender to encode additional redundant information so that a receiver can independently recover from losses. However, due to the lack of feedback from receivers, it is impossible for the sender to determine how much redundancy is needed. In this paper, we propose a new reliable multicast protocol, called ARM for Adaptive Reliable Multicast. Our protocol integrates ARQ and FEC techniques. The objectives of ARM are (1) reduce the message overhead due to NACK requests, (2) reduce the amount of data transmission, and (3) reduce the time it takes for all receivers to receive the data intact (without loss). During data transmission, the sender periodically informs the receivers of the number of packets that are yet to be transmitted. Based on this information, each receiver predicts whether this amount is enough to recover its losses. Only if it is not enough, that the receiver requests the sender to encode additional redundant packets. Using ns simulations, we show the superiority of our hybrid ARQ-FEC protocol over the well-known Scalable Reliable Multicast (SRM) protocol.

Search Space Reduction in QoS Routing

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called DCCR (for Delay-Cost-Constrained Routing), is a variant of the k-shortest path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use the method proposed by Blokh and Gutin to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm SSR+DCCR (for Search Space Reduction+DCCR). Through extensive simulations, we confirm that SSR+DCCR performs very well compared to the optimal but very expensive solution.

SomeCast: A Paradigm for Real-Time Adaptive Reliable Multicast

SomeCast is a novel paradigm for the reliable multicast of real-time data to a large set of receivers over the Internet. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics of paths between senders and receivers (e.g. maximum bandwidth and round-trip-time), and the dynamic conditions of such paths (e.g. congestion-induced delays and losses). SomeCast enables receivers to dynamically adjust the rate at which they receive multicast information to enable the satisfaction of real-time QoS constraints (e.g. rate, deadlines, or jitter). This is done by enabling a receiver to join SOME number of concurrent multiCAST sessions, whereby each session delivers a portion of an encoding of the real-time data. By adjusting the number of such sessions dynamically, client-specific QoS constraints can be met independently. The SomeCast paradigm can be thought of as a generalization of the AnyCast (e.g. Dynamic Server Selection) and ManyCast (e.g. Digital Fountain) paradigms, which have been proposed in the literature to address issues of scalability of UniCast and MultiCast environments, respectively. In this paper we overview the SomeCast paradigm, describe an instance of a SomeCast protocol, and present simulation results that quantify the significant advantages gained from adopting such a protocol for the reliable multicast of data to a diverse set of receivers subject to real-time QoS constraints.

On the Origin of Power Laws in Internet Topologies

Recent empirical studies have shown that Internet topologies exhibit power laws of the form for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs y = x^α within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely diameter, average path length and clustering coefficient. Different kinds of network topologies are generated: (T1) topologies generated using our parametrized generator, we call BRITE; (T2) random topologies generated using the well-known Waxman model; (T3) Transit-Stub topologies generated using GT-ITM tool; and (T4) regular grid topologies. We observe that some generated topologies may not obey power laws P1 and P2. Thus, the existence of these power laws can be used to validate the accuracy of a given tool in generating representative Internet topologies. Power laws P3 and P4 were observed in nearly all considered topologies, but different topologies showed different values of the power exponent α. Thus, while the presence of power laws P3 and P4 do not give strong evidence for the representativeness of a generated topology, the value of α in P3 and P4 can be used as a litmus test for the representativeness of a generated topology. We also find that factors F1 and F2 are the key contributors in our study which provide the resemblance of our generated topologies to that of the Internet.

QoS Controllers for the Internet

In this position paper, we review basic control strategies that machines acting as "traffic controllers" could deploy in order to improve the management of Internet services. Such traffic controllers are likely to spur the widespread emergence of advanced applications, which have (so far) been hindered by the inability of the networking infrastructure to deliver on the promise of Quality-of-Service (QoS).

Differentiated Predictive Fair Service for TCP Flows

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion avoidance mechanism and its effect on the performance of short and long data transfers. At the same time, the rising interest in enhancing Internet services while keeping the implementation cost low has led to several service-differentiation proposals. In such service-differentiation architectures, much of the complexity is placed only in access routers, which classify and mark packets from different flows. Core routers can then allocate enough resources to each class of packets so as to satisfy delivery requirements, such as predictable (consistent) and fair service. In this paper, we investigate the interaction among short and long TCP flows, and how TCP service can be improved by employing a low-cost service-differentiation scheme. Through control-theoretic arguments and extensive simulations, we show the utility of isolating TCP flows into two classes based on their lifetime/size, namely one class of short flows and another of long flows. With such class-based isolation, short and long TCP flows have separate service queues at routers. This protects each class of flows from the other as they possess different characteristics, such as burstiness of arrivals/departures and congestion/sending window dynamics. We show the benefits of isolation, in terms of better predictability and fairness, over traditional shared queueing systems with both tail-drop and Random-Early-Drop (RED) packet dropping policies. The proposed class-based isolation of TCP flows has several advantages: (1) the implementation cost is low since it only requires core routers to maintain per-class (rather than per-flow) state; (2) it promises to be an effective traffic engineering tool for improved predictability and fairness for both short and long TCP flows; and (3) stringent delay requirements of short interactive transfers can be met by increasing the amount of resources allocated to the class of short flows.

A Cortical and Cerebellar Parcellation System for Speech Studies

A neuroanatomical parcellation system is described which encompasses the entire cerebral cortex and the cerebellum. The cortical system modified version of the scheme described by Caviness et al. (1996) and is designed particularly for studies of speech processing. The cerebellum is parcellated into 6 cortical regions of interest (ROIs) and an ROI representing the deep cerebellar nuclei in each hemisphere. The boundaries of each ROI are based on individual anatomical markers that are clearly visible from standard structural MRI acquistions. The system permits averaginh of functional imaging data sets from multiple sujects while accounting for individual anatomical variability. Used in conjuction with region-of-interest analysis techniques such as that described by Nieto-Castanon et al. (2003), the parcellation system provides a more powerful means of analyzing functional data.

A Recurrent Cooperative/Competitive Field for Segmentation of Magnetic Resonance Brain Imagery

The Grey-White Decision Network is introduced as an application of an on-center, off-surround recurrent cooperative/competitive network for segmentation of magnetic resonance imaging (MRI) brain images. The three layer dynamical system relaxes into a solution where each pixel is labeled as either grey matter, white matter, or "other" matter by considering raw input intensity, edge information, and neighbor interactions. This network is presented as an example of applying a recurrent cooperative/competitive field (RCCF) to a problem with multiple conflicting constraints. Simulations of the network and its phase plane analysis are presented.

Magnetic resonance water proton relaxation in protein solutions and tissue: T(1rho) dispersion characterization.

BACKGROUND: Image contrast in clinical MRI is often determined by differences in tissue water proton relaxation behavior. However, many aspects of water proton relaxation in complex biological media, such as protein solutions and tissue are not well understood, perhaps due to the limited empirical data. PRINCIPAL FINDINGS: Water proton T(1), T(2), and T(1rho) of protein solutions and tissue were measured systematically under multiple conditions. Crosslinking or aggregation of protein decreased T(2) and T(1rho), but did not change high-field T(1). T(1rho) dispersion profiles were similar for crosslinked protein solutions, myocardial tissue, and cartilage, and exhibited power law behavior with T(1rho)(0) values that closely approximated T(2). The T(1rho) dispersion of mobile protein solutions was flat above 5 kHz, but showed a steep curve below 5 kHz that was sensitive to changes in pH. The T(1rho) dispersion of crosslinked BSA and cartilage in DMSO solvent closely resembled that of water solvent above 5 kHz but showed decreased dispersion below 5 kHz. CONCLUSIONS: Proton exchange is a minor pathway for tissue T(1) and T(1rho) relaxation above 5 kHz. Potential models for relaxation are discussed, however the same molecular mechanism appears to be responsible across 5 decades of frequencies from T(1rho) to T(1).

Variability in frontotemporal brain structure: the importance of recruitment of African Americans in neuroscience research.

BACKGROUND: Variation in brain structure is both genetically and environmentally influenced. The question about potential differences in brain anatomy across populations of differing race and ethnicity remains a controversial issue. There are few studies specifically examining racial or ethnic differences and also few studies that test for race-related differences in context of other neuropsychiatric research, possibly due to the underrepresentation of ethnic minorities in clinical research. It is within this context that we conducted a secondary data analysis examining volumetric MRI data from healthy participants and compared the volumes of the amygdala, hippocampus, lateral ventricles, caudate nucleus, orbitofrontal cortex (OFC) and total cerebral volume between Caucasian and African-American participants. We discuss the importance of this finding in context of neuroimaging methodology, but also the need for improved recruitment of African Americans in clinical research and its broader implications for a better understanding of the neural basis of neuropsychiatric disorders. METHODOLOGY/PRINCIPAL FINDINGS: This was a case control study in the setting of an academic medical center outpatient service. Participants consisted of 44 Caucasians and 33 ethnic minorities. The following volumetric data were obtained: amygdala, hippocampus, lateral ventricles, caudate nucleus, orbitofrontal cortex (OFC) and total cerebrum. Each participant completed a 1.5 T magnetic resonance imaging (MRI). Our primary finding in analyses of brain subregions was that when compared to Caucasians, African Americans exhibited larger left OFC volumes (F (1,68) = 7.50, p = 0.008). CONCLUSIONS: The biological implications of our findings are unclear as we do not know what factors may be contributing to these observed differences. However, this study raises several questions that have important implications for the future of neuropsychiatric research.

BOLD signal compartmentalization based on the apparent diffusion coefficient.

Functional MRI (fMRI) can detect blood oxygenation level dependent (BOLD) hemodynamic responses secondary to neuronal activity. The most commonly used method for detecting fMRI signals is the gradient-echo echo-planar imaging (EPI) technique because of its sensitivity and speed. However, it is generally believed that a significant portion of these signals arises from large veins, with additional contribution from the capillaries and parenchyma. Early experiments using diffusion-weighted gradient-echo EPI have suggested that intra-voxel incoherent motion (IVIM) weighting inherent in the sequence can selectively attenuate contributions from different vessels based on the differences in the mobility of the blood within them. In the present study, we used similar approach to characterize the apparent diffusion coefficient (ADC) distribution within the activated areas of BOLD contrast. It is shown that the voxel values of the ADCs obtained from this technique can infer various vascular contributions to the BOLD signal.

Magnetic Resonance Imaging Biomarkers of Renal Structure and Function

The kidney's major role in filtration depends on its high blood flow, concentrating mechanisms, and biochemical activation. The kidney's greatest strengths also lead to vulnerability for drug-induced nephrotoxicity and other renal injuries. The current standard to diagnose renal injuries is with a percutaneous renal biopsy, which can be biased and insufficient. In one particular case, biopsy of a kidney with renal cell carcinoma can actually initiate metastasis. Tools that are sensitive and specific to detect renal disease early are essential, especially noninvasive diagnostic imaging. While other imaging modalities (ultrasound and x-ray/CT) have their unique advantages and disadvantages, MRI has superb soft tissue contrast without ionizing radiation. More importantly, there is a richness of contrast mechanisms in MRI that has yet to be explored and applied to study renal disease.

The focus of this work is to advance preclinical imaging tools to study the structure and function of the renal system. Studies were conducted in normal and disease models to understand general renal physiology as well as pathophysiology. This dissertation is separated into two parts--the first is the identification of renal architecture with ex vivo MRI; the second is the characterization of renal dynamics and function with in vivo MRI. High resolution ex vivo imaging provided several opportunities including: 1) identification of fine renal structures, 2) implementation of different contrast mechanisms with several pulse sequences and reconstruction methods, 3) development of image-processing tools to extract regions and structures, and 4) understanding of the nephron structures that create MR contrast and that are important for renal physiology. The ex vivo studies allowed for understanding and translation to in vivo studies. While the structure of this dissertation is organized by individual projects, the goal is singular: to develop magnetic resonance imaging biomarkers for renal system.

The work presented here includes three ex vivo studies and two in vivo studies:

1) Magnetic resonance histology of age-related nephropathy in sprague dawley.

2) Quantitative susceptibility mapping of kidney inflammation and fibrosis in type 1 angiotensin receptor-deficient mice.

3) Susceptibility tensor imaging of the kidney and its microstructural underpinnings.

4) 4D MRI of renal function in the developing mouse.

5) 4D MRI of polycystic kidneys in rapamycin treated Glis3-deficient mice.

Improved delineation of short cortical association fibers and gray/white matter boundary using whole-brain three-dimensional diffusion tensor imaging at submillimeter spatial resolution.

Recent emergence of human connectome imaging has led to a high demand on angular and spatial resolutions for diffusion magnetic resonance imaging (MRI). While there have been significant growths in high angular resolution diffusion imaging, the improvement in spatial resolution is still limited due to a number of technical challenges, such as the low signal-to-noise ratio and high motion artifacts. As a result, the benefit of a high spatial resolution in the whole-brain connectome imaging has not been fully evaluated in vivo. In this brief report, the impact of spatial resolution was assessed in a newly acquired whole-brain three-dimensional diffusion tensor imaging data set with an isotropic spatial resolution of 0.85 mm. It was found that the delineation of short cortical association fibers is drastically improved as well as the definition of fiber pathway endings into the gray/white matter boundary-both of which will help construct a more accurate structural map of the human brain connectome.

Neural networks supporting autobiographical memory retrieval in posttraumatic stress disorder.

Posttraumatic stress disorder (PTSD) affects the functional recruitment and connectivity between neural regions during autobiographical memory (AM) retrieval that overlap with default and control networks. Whether such univariate changes relate to potential differences in the contributions of the large-scale neural networks supporting cognition in PTSD is unknown. In the present functional MRI study, we employed independent-component analysis to examine the influence of the engagement of neural networks during the recall of personal memories in a PTSD group (15 participants) as compared to non-trauma-exposed healthy controls (14 participants). We found that the PTSD group recruited similar neural networks when compared to the controls during AM recall, including default-network subsystems and control networks, but group differences emerged in the spatial and temporal characteristics of these networks. First, we found spatial differences in the contributions of the anterior and posterior midline across the networks, and of the amygdala in particular, for the medial temporal subsystem of the default network. Second, we found temporal differences within the medial prefrontal subsystem of the default network, with less temporal coupling of this network during AM retrieval in PTSD relative to controls. These findings suggest that the spatial and temporal characteristics of the default and control networks potentially differ in a PTSD group versus healthy controls and contribute to altered recall of personal memory.