SearcharxivSearch

arXiv subjects

Fraida Fund

Publications and source records attributed to Fraida Fund.

10 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

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

Collection: UAV-Based RSS Measurements from the AFAR Challenge in Digital Twin and Real-World Environments

This paper presents a comprehensive real-world and Digital Twin (DT) dataset collected as part of the AERPAW Find A Rover (AFAR) Challenge, organized by the NSF Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) testbed and hosted at the Lake Wheeler Field in Raleigh, North Carolina. The AFAR Challenge was a competition involving five finalist university teams, focused on promoting innovation in unmanned aerial vehicle (UAV)-assisted radio frequency (RF) source localization. Participating teams were tasked with designing UAV flight trajectories and localization algorithms to detect the position of a hidden unmanned ground vehicle (UGV), also referred to as a rover, emitting probe signals generated by GNU Radio. The competition was structured to evaluate solutions in a DT environment first, followed by deployment and testing in the AERPAW outdoor wireless testbed. For each team, the UGV was placed at three different positions, resulting in a total of 29 datasets, 15 collected in a DT simulation environment and 14 in a physical outdoor testbed. Each dataset contains time-synchronized measurements of received signal strength (RSS), received signal quality (RSQ), GPS coordinates, UAV velocity, and UAV orientation (roll, pitch, and yaw). Data is organized into structured folders by team, environment (DT and real-world), and UGV location. The dataset supports research in UAV-assisted RF source localization, air-to-ground (A2G) wireless propagation modeling, trajectory optimization, signal prediction, autonomous navigation, and DT validation. With 300k time-synchronized samples from the real-world experiments, the AFAR dataset enables effective training/testing of deep learning (DL) models and supports robust, real-world UAV-based wireless communication and sensing research.

eess.SP

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

A UAV-assisted Wireless Localization Challenge on AERPAW

As wireless researchers are tasked to enable wireless communication as infrastructure in more dynamic aerial settings, there is a growing need for large-scale experimental platforms that provide realistic, reproducible, and reliable experimental validation. To bridge the research-to-implementation gap, the Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) offers open-source tools, reference experiments, and hardware to facilitate and evaluate the development of wireless research in controlled digital twin environments and live testbed flights. The inaugural AERPAW Challenge, "Find a Rover," was issued to spark collaborative efforts and test the platform's capabilities. The task involved localizing a narrowband wireless signal, with teams given ten minutes to find the "rover" within a twenty-acre area. By engaging in this exercise, researchers can validate the platform's value as a tool for innovation in wireless communications research within aerial robotics. This paper recounts the methods and experiences of the top three teams in automating and rapidly locating a wireless signal by automating and controlling an aerial drone in a realistic testbed scenario.

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

Capturing Capacity and Profit Gains with Base Station Sharing in mmWave Cellular Networks

Due to the greater path loss, shadowing, and increased effect of blockage in millimeter wave cellular networks, base station sharing among network service providers has the potential to significantly improve overall network capacity. However, a service provider may find that despite the technical gains, sharing actually reduces its profits because it makes price competition between service providers tougher. In this work, a weighted scheduling algorithm is described, which gives greater control over how the airtime resource is allocated within a shared cell. It is shown that, under certain market conditions, there exist scheduling weights such that base station sharing is more profitable than not sharing for both service providers in a duopoly market, while still achieving almost as much network capacity as in a conventional base station sharing scenario. Thus, both technical and economic benefits of base station sharing may be realized simultaneously.

cs.IT

Resource Sharing Among mmWave Cellular Service Providers in a Vertically Differentiated Duopoly

With the increasing interest in the use of millimeter wave bands for 5G cellular systems comes renewed interest in resource sharing. Properties of millimeter wave bands such as massive bandwidth, highly directional antennas, high penetration loss, and susceptibility to shadowing, suggest technical advantages to spectrum and infrastructure sharing in millimeter wave cellular networks. However, technical advantages do not necessarily translate to increased profit for service providers, or increased consumer surplus. In this paper, detailed network simulations are used to better understand the economic implications of resource sharing in a vertically differentiated duopoly market for cellular service. The results suggest that resource sharing is less often profitable for millimeter wave service providers compared to microwave cellular service providers, and does not necessarily increase consumer surplus.

cs.NI

Spectrum and Infrastructure Sharing in Millimeter Wave Cellular Networks: An Economic Perspective

The licensing model for millimeter wave bands has been the subject of considerable debate, with some industry players advocating for unlicensed use and others for traditional geographic area exclusive use licenses. Meanwhile, the massive bandwidth, highly directional antennas, high penetration loss and susceptibility to shadowing in these bands suggest certain advantages to spectrum and infrastructure sharing. However, even when sharing is technically beneficial (as recent research in this area suggests that it is), it may not be profitable. In this paper, both the technical and economic implications of resource sharing in millimeter wave networks are studied. Millimeter wave service is considered in the economic framework of a network good, where consumers' utility depends on the size of the network, and the strategic decisions of consumers and service providers are connected to detailed network simulations. The results suggest that "open" deployments of neutral small cells that serve subscribers of any service provider encourage market entry by making it easier for networks to reach critical mass, more than "open" (unlicensed) spectrum would. The conditions under which competitive service providers would prefer to share resources or not are also described.

cs.NI

Under a cloud of uncertainty: Legal questions affecting Internet storage and transmission of copyright-protected video content

The rapid growth of multimedia consumption has triggered technical, economic, and business innovations that improve the quality and accessibility of content. It has also opened new markets, promising large revenues for industry players. However, new technologies also pose new questions regarding the legal aspects of content delivery, which are often resolved through litigation between copyright owners and content distributors. The precedents set by these cases will act as a game changer in the content delivery industry and will shape the existing offerings in the market in terms of how new technologies can be deployed and what kind of pricing strategies can be associated with them. In this paper, we offer a tutorial on key copyright and communications laws and decisions related to storage and transmission of video content over the Internet. We summarize legal limitations on the deployment of new technologies and pricing mechanisms, and explain the implications of recent lawsuits. Understanding these concerns is essential for engineers engaged in designing the technical and economic aspects of video delivery systems.

cs.NI