SearcharxivSearch

arXiv subjects

Shivendra Panwar

Publications and source records attributed to Shivendra Panwar.

At least 19 recordsLinked to original sources

Extending Low Latency Service Across the Internet

Protocols such as L4S for low latency network services have attracted growing interest from major industry stakeholders such as Comcast, Apple, T-Mobile, and NVIDIA. However, L4S requires isolation between L4S flows and classic flows in order to maintain its low latency benefits and safe coexistence. The L4S architecture uses a DualPI2 AQM mechanism to provide this isolation when the bottleneck occurs at the home access link. In practice, however, bottlenecks may also occur at other locations in the network, such as peering points, ingress to wide area networks, or occasionally congested links in the core, where deploying DualPI2 AQM is not feasible. Without a solution to this problem, L4S may struggle to gain deployment, since its benefits may remain limited without end-to-end support. To address this challenge, we propose a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps. We demonstrate the feasibility of this approach through large scale experiments on the FABRIC testbed. Our results demonstrate a practical deployment strategy for extending low latency service across the Internet, even across independently administered networks.

cs.NI

Evaluation of TCP Congestion Control for Public High-Performance Wide-Area Networks

Practitioners of a growing number of scientific and artificial-intelligence (AI) applications use High-Performance Wide-Area Networks (HP-WANs) for moving massive data sets between remote facilities. Accurate prediction of the flow completion time (FCT) is essential in these data-transfer workflows because compute and storage resources are tightly scheduled and expensive. We assess the viability of three TCP congestion control algorithms (CUBIC, BBRv1, and BBRv3) for massive data transfers over public HP-WANs, where limited control of critical data-path parameters precludes the use of Remote Direct Memory Access (RDMA) over Converged Ethernet (RoCEv2), which is known to outperform TCP in private HP-WANs. Extensive experiments on the FABRIC testbed indicate that the configuration control limitations can also hinder TCP, especially through microburst-induced packet losses. Under these challenging conditions, we show that the highest FCT predictability is achieved by combination of BBRv1 with the application of traffic shaping before the HP-WAN entry points.

cs.NI

BBR's Sharing Behavior with CUBIC and Reno

TCP BBR's behavior has been explained by various theoretical models, and in particular those that describe how it co-exists with other types of flows. However, as new versions of the BBR protocol have emerged, it remains unclear to what extent the high-level behaviors described by these models apply to the newer versions. In this paper, we systematically evaluate the most influential steady-state and fluid models describing BBR's coexistence with loss-based flows over shared bottleneck links. Our experiments, conducted on a new experimental platform (FABRIC), extend previous evaluations to additional network scenarios, enabling comparisons between the two models and include the recently introduced BBRv3. Our findings confirm that the steady-state model accurately captures BBRv1 behavior, especially against single loss-based flows. The fluid model successfully captures several key behaviors of BBRv1 and BBRv2 but shows limitations, in scenarios involving deep buffers, large numbers of flows, or intra-flow fairness. Importantly, we observe clear discrepancies between existing model predictions and BBRv3 behavior, suggesting the need for an updated or entirely new modeling approach for this latest version. We hope these results validate and strengthen the research community's confidence in these models and identify scenarios where they do not apply.

cs.NI

To Adopt or Not to Adopt L4S-Compatible Congestion Control? Understanding Performance in a Partial L4S Deployment

With few exceptions, the path to deployment for any Internet technology requires that there be some benefit to unilateral adoption of the new technology. In an Internet where the technology is not fully deployed, is an individual better off sticking to the status quo, or adopting the new technology? This question is especially relevant in the context of the Low Latency, Low Loss, Scalable Throughput (L4S) architecture, where the full benefit is realized only when compatible protocols (scalable congestion control, accurate ECN, and flow isolation at queues) are adopted at both endpoints of a connection and also at the bottleneck router. In this paper, we consider the perspective of the sender of an L4S flow using scalable congestion control, without knowing whether the bottleneck router uses an L4S queue, or whether other flows sharing the bottleneck queue are also using scalable congestion control. We show that whether the sender uses TCP Prague or BBRv2 as the scalable congestion control, it cannot be assured that it will not harm or be harmed by another flow sharing the bottleneck link. We further show that the harm is not necessarily mitigated when a scalable flow shares a bottleneck with multiple classic flows. Finally, we evaluate the approach of BBRv3, where scalable congestion control is used only when the path delay is small, with ECN feedback ignored otherwise, and show that it does not solve the coexistence problem.

cs.NI

Designing Reliable Virtualized Radio Access Networks

As virtualization of Radio Access Networks (RAN) gains momentum, understanding the impact of hardware and software disaggregation on resiliency becomes critical to meet the high availability requirements of mobile networks. Our paper presents an analytical model, using continuous time Markov chains, to study the impact of virtualization and disaggregation on RAN availability. Our evaluation, assuming typical parameter value ranges for failure and recovery rates, points to containerized platform reliability as a constraint on vRAN availability. We also find that with active-passive replication, increasing hardware replication factor beyond 2 may not bring any benefits unless failover times are reduced. We also compare the reliability of centralized and distributed virtualized central units.

cs.NI

To Switch or Not to Switch to TCP Prague? Incentives for Adoption in a Partial L4S Deployment

The Low Latency, Low Loss, Scalable Throughput (L4S) architecture has the potential to reduce queuing delay when it is deployed at endpoints and routers throughout the Internet. However, it is not clear how TCP Prague, a prototype scalable congestion control for L4S, behaves when L4S is not yet universally deployed. Specifically, we consider the question: in a partial L4S deployment, will a user benefit by unilaterally switching from the status quo TCP to TCP Prague? To address this question, we evaluate the performance of a TCP Prague flow when sharing an L4S or non-L4S bottleneck queue with a non-L4S flow. Our findings suggest that the L4S congestion control, TCP Prague, has less favorable throughput or fairness properties than TCP Cubic or BBR in some coexistence scenarios, which may hinder adoption.

cs.NI

Structured Reinforcement Learning for Delay-Optimal Data Transmission in Dense mmWave Networks

We study the data packet transmission problem (mmDPT) in dense cell-free millimeter wave (mmWave) networks, i.e., users sending data packet requests to access points (APs) via uplinks and APs transmitting requested data packets to users via downlinks. Our objective is to minimize the average delay in the system due to APs' limited service capacity and unreliable wireless channels between APs and users. This problem can be formulated as a restless multi-armed bandits problem with fairness constraint (RMAB-F). Since finding the optimal policy for RMAB-F is intractable, existing learning algorithms are computationally expensive and not suitable for practical dynamic dense mmWave networks. In this paper, we propose a structured reinforcement learning (RL) solution for mmDPT by exploiting the inherent structure encoded in RMAB-F. To achieve this, we first design a low-complexity and provably asymptotically optimal index policy for RMAB-F. Then, we leverage this structure information to develop a structured RL algorithm called mmDPT-TS, which provably achieves an \tilde{O}(\sqrt{T}) Bayesian regret. More importantly, mmDPT-TS is computation-efficient and thus amenable to practical implementation, as it fully exploits the structure of index policy for making decisions. Extensive emulation based on data collected in realistic mmWave networks demonstrate significant gains of mmDPT-TS over existing approaches.

cs.NI

Learning Based Methods for Traffic Matrix Estimation from Link Measurements

Network traffic demand matrix is a critical input for capacity planning, anomaly detection and many other network management related tasks. The demand matrix is often computed from link load measurements. The traffic matrix (TM) estimation problem is the determination of the traffic demand matrix from link load measurements. The relationship between the link loads and the traffic matrix that generated the link load can be modeled as an under-determined linear system and has multiple feasible solutions. Therefore, prior knowledge of the traffic demand pattern has to be used in order to find a potentially feasible demand matrix. In this paper, we consider the TM estimation problem where we have information about the distribution of the demand sizes. This information can be obtained from the analysis of a few traffic matrices measured in the past or from operator experience. We develop an iterative projection based algorithm for the solution of this problem. If large number of past traffic matrices are accessible, we propose a Generative Adversarial Network (GAN) based approach for solving the problem. We compare the strengths of the two approaches and evaluate their performance for several networks using varying amounts of past data.

cs.NI

Beamformed mmWave System Propagation at 60GHz in an Office Environment

Millimeter wave wireless systems rely heavily on directional communication in narrow steerable beams. Tools to measure the spatial and temporal nature of the channel are necessary to evaluate beamforming and related algorithms. This paper presents a novel 60~GHz phased-array based directional channel sounder and data analysis procedure that can accurately extract paths and their transmit and receive directions. The gains along each path can also be measured for analyzing blocking scenarios. The sounder is validated in an indoor office environment.

eess.SY

Optimal Transmission Policies for Energy Harvesting Age of Information Systems with Battery Recovery

We consider an energy harvesting information update system where a sensor is allowed to choose a transmission mode for each transmission, where each mode consists of a transmission power-error pair. We also incorporate the battery phenomenon called battery recovery effect where a battery replenishes the deliverable energy if kept idle after discharge. For an energy-limited age of information (AoI) system, this phenomenon gives rise to the interesting trade-off of recovering energy after transmissions, at the cost of increased AoI. Considering two metrics, namely peak-age hitting probability and average age as the worst-case and average performance indicators, respectively, we propose a framework that formulates the optimal transmission scheme selection problem as a Markov Decision Process (MDP). We show that the gains obtained by considering both battery dynamics and adjustable transmission power together are much higher than the sum gain achieved if they are considered separately. We also propose a simple methodology to optimize the system performance taking into account worst-case and average performances jointly.

cs.IT

The Impact of Mobile Blockers on Millimeter Wave Cellular Systems

Millimeter Wave (mmWave) communication systems can provide high data rates, but the system performance may degrade significantly due to interruptions by mobile blockers such as humans or vehicles. A high frequency of interruptions and lengthy blockage durations will degrade the quality of the user's experience. A promising solution is to employ the macrodiversity of Base Stations (BSs), where the User Equipment (UE) can handover to other available BSs if the current serving BS gets blocked. However, an analytical model to evaluate the system performance of dynamic blockage events in this setting is unknown. In this paper, we develop a Line of Sight (LOS) dynamic blockage model and evaluate the probability, duration, and frequency of blockage events considering all the links to the UE which are not blocked by buildings or the user's own body. For a dense urban area, we also analyze the impact of non-LOS (NLOS) links on blockage events. Our results indicate that the minimum density of BS required to satisfy the Quality of Service (QoS) requirements of Ultra Reliable Low Latency Communication (URLLC) applications will be driven mainly by blockage and latency constraints, rather than coverage or capacity requirements.

eess.SP

Will TCP work in mmWave 5G Cellular Networks?

The vast available spectrum in the millimeter wave (mmWave) bands offers the possibility of multi-Gbps data rates for fifth generation (5G) cellular networks. However, mmWave capacity can be highly intermittent due to the vulnerability of mmWave signals to blockages and delays in directional searching. Such highly variable links present unique challenges for adaptive control mechanisms in transport layer protocols and end-to-end applications. This paper considers the fundamental question of whether TCP - the most widely used transport protocol - will work in mmWave cellular systems. The paper provides a comprehensive simulation study of TCP considering various factors such as the congestion control algorithm, including the recently proposed TCP BBR, edge vs. remote servers, handover and multi- connectivity, TCP packet size and 3GPP-stack parameters. We show that the performance of TCP on mmWave links is highly dependent on different combinations of these parameters, and identify the open challenges in this area.

cs.NI

Limited by Capacity or Blockage? A Millimeter Wave Blockage Analysis

Millimeter wave (mmWave) communication systems can provide high data rates but the system performance may degrade significantly due to mobile blockers and the user's own body. A high frequency of interruptions and long duration of blockage may degrade the quality of experience. For example, delays of more than about 10ms cause nausea to VR viewers. Macro-diversity of base stations (BSs) has been considered a promising solution where the user equipment (UE) can handover to other available BSs, if the current serving BS gets blocked. However, an analytical model for the frequency and duration of dynamic blockage events in this setting is largely unknown.In this paper, we consider an open park-like scenario and obtain closed-form expressions for the blockage probability, expected frequency and duration of blockage events using stochastic geometry. Our results indicate that the minimum density of BS that is required to satisfy the Quality of Service (QoS) requirements of AR/VR and other low latency applications is largely driven by blockage events rather than capacity requirements. Placing the BS at a greater height reduces the likelihood of blockage. We present a closed-form expression for the BS density-height trade-off that can be used for network planning.

eess.SP

milliProxy: a TCP Proxy Architecture for 5G mmWave Cellular Systems

TCP is the most widely used transport protocol in the internet. However, it offers suboptimal performance when operating over high bandwidth mmWave links. The main issues introduced by communications at such high frequencies are (i) the sensitivity to blockage and (ii) the high bandwidth fluctuations due to Line of Sight (LOS) to Non Line of Sight (NLOS) transitions and vice versa. In particular, TCP has an abstract view of the end-to-end connection, which does not properly capture the dynamics of the wireless mmWave link. The consequence is a suboptimal utilization of the available resources. In this paper we propose a TCP proxy architecture that improves the performance of TCP flows without any modification at the remote sender side. The proxy is installed in the Radio Access Network, and exploits information available at the gNB in order to maximize throughput and minimize latency.

cs.NI

Scheduling and Power Allocation in Self-Backhauled Full Duplex Small Cells

Full duplex (FD) communications, which increases spectral efficiency through simultaneous transmission and reception on the same frequency band, is a promising technology to meet the demand of next generation wireless networks. In this paper, we consider the application of such FD communication to self-backhauled small cells. We consider a FD capable small cell base station (BS) being wirelessly backhauled by a FD capable macro-cell BS. FD communication enables simultaneous backhaul and access transmissions at small cell BSs, which reduces the need to orthogonalize allocated spectrum between access and backhaul. However, in such simultaneous operations, all the links experience higher interference, which significantly suppresses the gains of FD operations. We propose an interference-aware scheduling method to maximize the FD gain across multiple UEs in both uplink and downlink directions, while maintaining a level of fairness between all UEs. It jointly schedules the appropriate links and traffic based on the back-pressure algorithm, and allocates appropriate transmission powers to the scheduled links using Geometric Programming. Our simulation results show that the proposed scheduler nearly doubles the throughput of small cells compared to traditional half-duplex self-backhauling.

cs.NI

WiLiTV: A Low-Cost Wireless Framework for Live TV Services

With the evolution of HDTV and Ultra HDTV, the bandwidth requirement for IP-based TV content is rapidly increasing. Consumers demand uninterrupted service with a high Quality of Experience (QoE). Service providers are constantly trying to differentiate themselves by innovating new ways of distributing content more efficiently with lower cost and higher penetration. In this work, we propose a cost-efficient wireless framework (WiLiTV) for delivering live TV services, consisting of a mix of wireless access technologies (e.g. Satellite, WiFi and LTE overlay links). In the proposed architecture, live TV content is injected into the network at a few residential locations using satellite dishes. The content is then further distributed to other homes using a house-to-house WiFi network or via an overlay LTE network. Our problem is to construct an optimal TV distribution network with the minimum number of satellite injection points, while preserving the highest QoE, for different neighborhood densities. We evaluate the framework using realistic time-varying demand patterns and a diverse set of home location data. Our study demonstrates that the architecture requires 75 - 90% fewer satellite injection points, compared to traditional architectures. Furthermore, we show that most cost savings can be obtained using simple and practical relay routing solutions.

cs.MM

The Bufferbloat Problem over Intermittent Multi-Gbps mmWave Links

Due to massive available spectrum in the millimeter wave (mmWave) bands, cellular systems in these frequencies may provides orders of magnitude greater capacity than networks in conventional lower frequency bands. However, due to high susceptibility to blocking, mmWave links can be extremely intermittent in quality. This combination of high peak throughputs and intermittency can cause significant challenges in end-to-end transport-layer mechanisms such as TCP. This paper studies the particularly challenging problem of bufferbloat. Specifically, with current buffering and congestion control mechanisms, high throughput-high variable links can lead to excessive buffers incurring long latency. In this paper, we capture the performance trends obtained while adopting two potential solutions that have been proposed in the literature: Active queue management (AQM) and dynamic receive window. We show that, over mmWave links, AQM mitigates the latency but cannot deliver high throughput. The main reason relies on the fact that the current congestion control was not designed to cope with high data rates with sudden change. Conversely, the dynamic receive window approach is more responsive and therefore supports higher channel utilization while mitigating the delay, thus representing a viable solution.

cs.NI

Throughput and Coverage for a Mixed Full and Half Duplex Small Cell Network

Recent advances in self-interference cancellation enable radios to transmit and receive on the same frequency at the same time. Such a full duplex radio is being considered as a potential candidate for the next generation of wireless networks due to its ability to increase the spectral efficiency of wireless systems. In this paper, the performance of full duplex radio in small cellular systems is analyzed by assuming full duplex capable base stations and half duplex user equipment. However, using only full duplex base stations increases interference leading to outage. We therefore propose a mixed multi-cell system, composed of full duplex and half duplex cells. A stochastic geometry based model of the proposed mixed system is provided, which allows us to derive the outage and area spectral efficiency of such a system. The effect of full duplex cells on the performance of the mixed system is presented under different network parameter settings. We show that the fraction of cells that have full duplex base stations can be used as a design parameter by the network operator to target an optimal tradeoff between area spectral efficiency and outage in a mixed system.

cs.IT