An official website of the United States government
Next-generation distributed computing networks (e.g., edge and fog computing) enable the efficient delivery of delay-sensitive, compute-intensive applications by facilitating access to computation resources in close proximity to end users. Many of these applications (e.g., augmented/virtual reality) are also data-intensive: in addition to user-specific (live) data streams, they require access to shared (static) digital objects (e.g., im-age database) to complete the required processing tasks. When required objects are not available at the servers hosting the associated service functions, they must be fetched from other edge locations, incurring additional communication cost and latency. In such settings, overall service delivery performance shall benefit from jointly optimized decisions around (i) routing paths and processing locations for live data streams, together with (ii) cache selection and distribution paths for associated digital objects. In this paper, we address the problem of dynamic control of data-intensive services over edge cloud networks. We characterize the network stability region and design the first throughput-optimal control policy that coordinates processing and routing decisions for both live and static data-streams. Numerical results demonstrate the superior performance (e.g., throughput, delay, and resource consumption) obtained via the novel multi-pipeline flow control mechanism of the proposed policy, compared with state-of-the-art algorithms that lack integrated stream processing and data distribution control.
more »
« less
A multiple access channel game with users implementing throughput and latency metrics
We consider a multiple access channel (MAC) problem where several users communicate with a base station and in which the users may have different applications or communication purposes for using the network, which is reflected via associated communication metrics. Specifically, we use throughput as the metric to reflect regular data transmission purposes, and latency, modeled by the inverse throughput, is used to reflect data transmission speed as another metric. The problem is formulated as a non-zero sum game. The equilibrium is derived in closed form. Stability in communication for such a heterogeneous network is established by proving the uniqueness of the equilibrium, except for particular cases where stability still can be maintained via cooperation of users with throughput metric or their switching to latency metric.
more »
« less
- Award ID(s):
- 2128451
- PAR ID:
- 10521540
- Publisher / Repository:
- ICT Express
- Date Published:
- Journal Name:
- ICT Express
- Volume:
- 9
- Issue:
- 5
- ISSN:
- 2405-9595
- Page Range / eLocation ID:
- 869 to 874
- Subject(s) / Keyword(s):
- Multi-user Multi-access channel Throughput Latency Equilibrium
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Fifth Generation (5G) networks operating on mmWave frequency bands are anticipated to provide an ultrahigh capacity with low latency to serve mobile users requiring high-end cellular services and emerging metaverse applications. Managing and coordinating the high data rate and throughput among the mmWave 5G Base Stations (BSs) is a challenging task, and it requires intelligent network traffic analysis. While BSs coordination has been traditionally treated as a centralized task, this involves higher latency that may adversely impact the user’s Quality of Service (QoS). In this paper, we address this issue by considering the need for distributed coordination among BSs to maximize spectral efficiency and improve the data rate provided to their users via embedded AI. We present Peer-Coordinated Sequential Split Learning dubbed PC-SSL, which is a distributed learning approach whereby multiple 5G BSs collaborate to train and update deep learning models without disclosing their associated mobile users data, i.e., without privacy leakage. Our proposed PC-SSL minimizes the data transmitted between the client BSs and a server by processing data locally on the clients. This results in low latency and computation overhead in making handoff decisions and other networking operations. We evaluate the performance of our proposed PC-SSL in the mmWave 5G throughput prediction use-case based on a real dataset. The results demonstrate that our proposal outperforms conventional approaches and achieves a comparable performance to centralized, vanilla split learning.more » « less
-
null (Ed.)Fast networks and the desire for high resource utilization in data centers and the cloud have driven disaggregation. Application compute is separated from storage, but this leads to high overheads when data must move over the network for simple operations on it. Alternatively, systems could allow applications to run application logic within storage via user-defined functions. Unfortunately, this ties provisioning and utilization of storage and compute resources together again. We present a new approach to executing storage-level functions in an in-memory key-value store that avoids this problem by dynamically deciding where to execute functions over data. Users write storage functions that are logically decoupled from storage, but storage servers choose where to run invocations of these functions physically. By using a server-internal cost model and observing function execution, servers choose to directly run inexpensive functions, while preferring to execute functions with high CPU-cost at client machines. We show that with this approach storage servers can reduce network request processing costs, avoid server compute bottlenecks, and improve aggregate storage system throughput. We realize our approach on an in-memory key-value store that executes 3.2 million strict serializable user-defined storage functions per second with 100 us response times. When running a mix of logic from different applications, it provides throughput better than running that logic purely at storage servers (85% more) or purely at clients (10% more). For our workloads, it also reduces latency (up to 2x) and transactional aborts (up to 33%) over pure client-side execution.more » « less
-
In urban environments, tall buildings or structures can pose limits on the direct channel link between a base station (BS) and an Internet-of-Thing device (IoTD) for wireless communication. Unmanned aerial vehicles (UAVs) with a mounted reconfigurable intelligent surface (RIS), denoted as UAV-RIS, have been introduced in recent works to enhance the system throughput capacity by acting as a relay node between the BS and the IoTDs in wireless access networks. Uncoordinated UAVs or RIS phase shift elements will make unnecessary adjustments that can significantly impact the signal transmission to IoTDs in the area. The concept of age of information (AoI) is proposed in wireless network research to categorize the freshness of the received update message. To minimize the average sum of AoI (ASoA) in the network, two model-free deep reinforcement learning (DRL) approaches – Off-Policy Deep Q-Network (DQN) and On-Policy Proximal Policy Optimization (PPO) – are developed to solve the problem by jointly optimizing the RIS phase shift, the location of the UAV-RIS, and the IoTD transmission scheduling for large-scale IoT wireless networks. Analysis of loss functions and extensive simulations is performed to compare the stability and convergence performance of the two algorithms. The results reveal the superiority of the On-Policy approach, PPO, over the Off-Policy approach, DQN, in terms of stability, convergence speed, and under diverse environment settingsmore » « less
-
Wide Area Measurement Systems (WAMS) use an underlying communication network to collect and analyze data from devices in the power grid, aimed to improve grid operations. For WAMS to be effective, the communication network needs to support low packet latency and low packet losses. Internet Protocol (IP), the pervasive technology used in today’s communication networks uses loop-free best-paths for data forwarding, which increases the load on these paths causing delays and losses in delivery. Information-Centric Networking (ICN), a new networking paradigm, designed to enable a data-centric information sharing, natively supports the concurrent use of multiple transmission interfaces, in-networking caching, as well as per-packet security and can provide better application support. In this paper, we present , an ICN-based network architecture for wide area smart grid communications. We demonstrate through simulations that achieves low latency and 100% data delivery even during network congestion by leveraging multiple available paths; thus significantly improving communication resiliency in comparison to an IP-based approach. can be used immediately on today’s Internet as an overlay.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1016/j.icte.2023.04.004
