pith. sign in

arxiv: 2310.14283 · v5 · submitted 2023-10-22 · 💻 cs.NI · cs.DC· cs.PF· cs.SY· eess.SY

Bandwidth Efficient Livestreaming in Mobile Wireless Networks: A Peer-to-Peer ACIDE Solution

Andrei Negulescu , Weijia Shang This is my paper

Pith reviewed 2026-05-24 06:25 UTC · model grok-4.3

classification 💻 cs.NI cs.DCcs.PFcs.SYeess.SY
keywords livestreamingpeer-to-peer communicationbandwidth efficiencymobile wireless networksuser clusteringoptimization problemsACIDE model
0
0 comments X

The pith

Clustering users by livestream interest and exchanging divided packages reduces wireless bandwidth while serving more peers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes an Active Control in an Intelligent and Distributed Environment (ACIDE) model for livestreaming in mobile wireless networks. Users with the same interest are grouped into clusters where only one package copy is sent from the base station and then divided into blocks for peer-to-peer exchange. This setup minimizes the bandwidth required for continuous playback by optimizing block sizes and maximizes the number of peers per cluster for a given bandwidth using a greedy approach to the NP-complete selection problem. A sympathetic reader would care because it directly addresses bandwidth depletion in high-density areas, potentially allowing more users to access live streams without additional infrastructure.

Core claim

The ACIDE model groups users with identical livestream interest in a cluster of n peers. Instead of sending n copies of a livestream package, only one copy is sent to the cluster. A package is divided into n blocks. Each user receives one block from the base station and the remaining n-1 blocks from the other peers. Optimal block sizes are found to minimize wireless bandwidth for continuous play, and a greedy strategy solves the NP-complete problem of maximizing the number of admitted peers for fixed bandwidth.

What carries the argument

Interest-based user clusters with package division into blocks and peer-to-peer block exchange, plus two optimization problems for block sizes and peer admission.

If this is right

  • Bandwidth usage scales with one copy per cluster rather than one per user.
  • Cluster size can be increased up to the point where block exchange times fit within playback constraints.
  • More total users can be served in dense areas under the same base station bandwidth limit.
  • The greedy peer selection provides a practical approximation to the optimal cluster composition.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If P2P links prove reliable, this could apply to other delay-sensitive media distributions.
  • Real-world tests might need to account for mobility disrupting clusters.
  • Combining with cellular offloading techniques could further improve efficiency.
  • The model leaves open how to initially form clusters based on interest detection.

Load-bearing premise

Peer-to-peer communications between users in the cluster can be established and maintained without incurring extra costs, delays, or reliability issues that would violate the continuous live media play guarantee on all peers.

What would settle it

An experiment where P2P block transfers in a mobile cluster cause playback interruptions due to delays or disconnections, despite optimized block sizes.

Figures

Figures reproduced from arXiv: 2310.14283 by Andrei Negulescu, Weijia Shang.

Figure 1
Figure 1. Figure 1: ACIDE P2P cluster configured for Phase 1, n=5 to peers. An important result is that for a very large number of peers and if the average peer upload bandwidth is large the minimum allocated bandwidth is getting closer to the multicast bandwidth. We propose a feasible solution to an NP-Complete problem of maximizing the number of peers for a reserved bandwidth, such that a continuous livestream media play is… view at source ↗
Figure 3
Figure 3. Figure 3: Livestream media packages 1 1 ... ... P P P k  [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Package Pk1 distribution in the dynamic case Because Nu u Nu u avg avg     1 1  , the time T2 of Case1 is less than the time T2 of Case2. Clearly, 1,min ,max N bw bw  . If 1,min bw BW  and N,max bw BW  the Algorithm 2 ends its execution and BW bw BW bw    1,min ,max N . This means that N N  1 is the maximum number of peers using the largest amount of reserved bandwidth BW. □ The maximum numbe… view at source ↗
Figure 6
Figure 6. Figure 6: Allocated bandwidth bw variation with n and S T [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 5
Figure 5. Figure 5: Block sizes and bandwidth allocated to n=5 peers A. Simulation Methods and Setup Description GNU Octave, a set of tools designed for solving linear algebra problems, has been used for simulation. A delay bound of T = 200ms and cluster sizes of n{5,10,15,20,40,60,80,100,120} peers have been chosen for the bandwidth optimization simulation. For each n, the upload and download bandwidth ranges U n( ) and D n… view at source ↗
Figure 8
Figure 8. Figure 8: points out that 0,2 1,2 bw bw bw    12.71 kbps for P2 and 0,3 1,3 bw bw bw    12.08 kbps for P3 . Because more peers are added to the cluster and avg u is getting larger, the times for Phase 2 are T T T 2,1 2,2 2,3   and bw bw bw 1,1 1,2 1,3   . For n = 60, since T0 2,  0 we notice a bw increase from 12.34 kbps in the static case to 12.71 kbps in the dynamic case. Similarly, for n = 120, bw is i… view at source ↗
read the original abstract

In mobile wireless networks, livestreaming in high user density areas presents two typical challenges: the wireless bandwidth is depleted and the number of users is limited. In this study, a media distribution model utilizing peer to peer communications, Active Control in an Intelligent and Distributed Environment, is proposed for bandwidth efficient livestreaming. The basic idea is to group users with identical livestream interest in a cluster of n peers. Instead of sending n copies of a livestream package, only one copy is sent to the cluster. A package is divided into n blocks. Each user receives one block from the base station and the remaining n-1 blocks from the other peers. Two optimization problems are addressed. The first problem is minimizing the bandwidth needed to guarantee a continuous live media play on all peers. A solution is proposed to find the optimal block sizes such that the wireless bandwidth is minimized. The second problem is maximizing the number of peers admitted to a cluster, given a fixed wireless bandwidth. This problem is NP-complete and a greedy strategy is proposed to calculate a feasible solution for peer selection. The proposed model improves the bandwidth efficiency and allows more users to be served.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 0 minor

Summary. The paper proposes a peer-to-peer model called ACIDE for bandwidth-efficient livestreaming in mobile wireless networks. Users sharing the same livestream interest are clustered into groups of n peers. Instead of transmitting n copies from the base station, a single copy is sent to the cluster and divided into n blocks; each peer receives one block directly from the base station and obtains the remaining n-1 blocks from other cluster members via P2P links. Two optimization problems are formulated: (1) minimizing the required wireless bandwidth subject to a continuous-playback constraint by choosing optimal block sizes, and (2) maximizing the number of admitted peers for a fixed bandwidth budget, which is shown to be NP-complete and solved via a greedy heuristic.

Significance. If the underlying assumptions hold and the optimizations can be realized without hidden latency or reliability penalties, the approach could materially reduce base-station load in dense mobile scenarios and increase the number of supported users. The manuscript, however, contains no equations, proofs, simulation results, or implementation details, so the practical significance cannot yet be evaluated.

major comments (3)
  1. [Abstract] Abstract and model description: the claim that optimal block sizes 'guarantee a continuous live media play on all peers' is load-bearing for the bandwidth-minimization result, yet the manuscript provides neither the objective function, the playback-deadline constraint, nor any model of P2P transmission latency, scheduling, or wireless interference. Without these, it is impossible to verify that the derived block sizes actually satisfy the continuity requirement.
  2. [Abstract] Abstract: the P2P exchange of n-1 blocks is asserted to incur no extra wireless cost or delay that would violate the live-playback guarantee, but no accounting for link establishment, synchronization, mobility-induced outages, or MAC-layer contention appears. This assumption directly determines whether the claimed bandwidth saving is realized.
  3. [Abstract] Abstract: the admission problem is stated to be NP-complete and a greedy strategy is offered, but no approximation ratio, worst-case performance bound, or even small-scale validation against an exact solver is supplied. Consequently the claim that the heuristic 'allows more users to be served' remains unsupported.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments. We acknowledge that the current manuscript is high-level and omits the detailed formulations, assumptions, and validations needed to substantiate the claims. We will undertake a major revision to address each point.

read point-by-point responses

  1. Referee: [Abstract] Abstract and model description: the claim that optimal block sizes 'guarantee a continuous live media play on all peers' is load-bearing for the bandwidth-minimization result, yet the manuscript provides neither the objective function, the playback-deadline constraint, nor any model of P2P transmission latency, scheduling, or wireless interference. Without these, it is impossible to verify that the derived block sizes actually satisfy the continuity requirement.

    Authors: We agree that the abstract alone does not allow verification. The revised manuscript will present the full optimization problem: minimize base-station bandwidth subject to per-peer playback deadline constraints derived from block reception times. We will explicitly model P2P transmission latencies under the assumption of dedicated short-range links with fixed capacities, and include the resulting closed-form block-size solution. revision: yes

  2. Referee: [Abstract] Abstract: the P2P exchange of n-1 blocks is asserted to incur no extra wireless cost or delay that would violate the live-playback guarantee, but no accounting for link establishment, synchronization, mobility-induced outages, or MAC-layer contention appears. This assumption directly determines whether the claimed bandwidth saving is realized.

    Authors: The model isolates cellular bandwidth savings and treats P2P exchanges as zero-cost to the base station. We accept that overheads from link setup, mobility, and contention are unmodeled. The revision will add an assumptions section discussing these factors and will note any resulting adjustments to the continuity constraints or bandwidth savings. revision: yes

  3. Referee: [Abstract] Abstract: the admission problem is stated to be NP-complete and a greedy strategy is offered, but no approximation ratio, worst-case performance bound, or even small-scale validation against an exact solver is supplied. Consequently the claim that the heuristic 'allows more users to be served' remains unsupported.

    Authors: We will include a formal NP-completeness proof by reduction from the maximum independent set problem. The revision will also contain a performance analysis of the greedy heuristic together with simulation results on small instances comparing it against an exact ILP solver to quantify the improvement in admitted peers. revision: yes

Circularity Check

0 steps flagged

No circularity: optimizations derived directly from cluster model without reduction to inputs

full rationale

The paper defines a P2P cluster model (one package copy to n peers, divided into n blocks with one from BS and n-1 exchanged) and then states two optimization problems solved from that model: minimizing wireless bandwidth subject to continuous playback via choice of block sizes, and maximizing admitted peers under fixed bandwidth via a greedy heuristic for the NP-complete selection problem. No equations, parameters, or results are shown to be fitted to subsets of the target data and then renamed as predictions; no self-citations are invoked as load-bearing uniqueness theorems; the derivations remain self-contained against the stated assumptions and do not collapse by construction to the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Based solely on the abstract; the model relies on unstated assumptions about P2P reliability and introduces a new named framework without external grounding.

axioms (1)
  • domain assumption Peers can exchange blocks reliably via P2P without consuming additional base station bandwidth or causing delays that interrupt continuous playback.
    This underpins the entire block-sharing mechanism described in the abstract.
invented entities (1)
  • ACIDE (Active Control in an Intelligent and Distributed Environment) no independent evidence
    purpose: The proposed media distribution model and framework for P2P livestreaming.
    Newly introduced term for the clustering and block-sharing approach, with no independent evidence or prior references provided.

pith-pipeline@v0.9.0 · 5746 in / 1354 out tokens · 37545 ms · 2026-05-24T06:25:06.714936+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages · 1 internal anchor

  1. [1]

    https://www.sfchronicle.com/bayarea/article/robotaxi-backup- 18293208.php

    Neelakandan L, Cano R., Cruise blames Outside Lands for driverless car traffic fiasco in San Francisco, San Francisco Chronicle, 2023 Aug 13. https://www.sfchronicle.com/bayarea/article/robotaxi-backup- 18293208.php

    work page 2023

  2. [2]

    https://www.latimes.com/california/story/2023-08-12/cruise-robotaxis- come-to-a-standstill

    Mitchell R., San Francisco’s North Beach streets clogged as long line of Cruise robotaxis come to a standstill, Los Angeles Times, 2023 Aug 12. https://www.latimes.com/california/story/2023-08-12/cruise-robotaxis- come-to-a-standstill

    work page 2023

  3. [3]

    Multipoint communication: A survey of protocols, functions, and mechanisms

    Diot C, Dabbous W, Crowcroft J. Multipoint communication: A survey of protocols, functions, and mechanisms. IEEE journal on selected areas in communications. 1997 Apr;15(3):277-90

    work page 1997

  4. [4]

    An optimal media distribution algorithm in P2P- based IPTV

    Cui H, Su X, Shang W. An optimal media distribution algorithm in P2P- based IPTV. In2008 Third International Conference on Communications and Networking in China 2008 Aug 25 (pp. 360-364). IEEE

    work page 2008

  5. [5]

    Optimal dissemination of layered videos in P2P- Based IPTV networks

    Cui H, Su X, Shang W. Optimal dissemination of layered videos in P2P- Based IPTV networks. In2009 IEEE International Conference on Multimedia and Expo 2009 Jun 28 (pp. 738-741). IEEE

    work page 2009

  6. [6]

    Negulescu, W

    A. Negulescu, W. Shang, Active Admission Control in a P2P Distributed Environment for Capacity Efficient Livestreaming in Mobile Wireless Networks, 2023 International Conference on Computational Science and Computational Intelligence (CSCI), Las Vegas, NV, USA, December 2023, pp. 941-948, doi: 10.1109/CSCI62032.2023.00157

    work page doi:10.1109/csci62032.2023.00157 2023

  7. [7]

    Leiserson, Ronald L

    Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.,2022 Introduction to algorithms. MIT press

    work page 2022

  8. [8]

    Two-layer hybrid peer-to-peer networks

    Duan Z, Tian C, Zhou M, Wang X, Zhang N, Du H, Wang L. Two-layer hybrid peer-to-peer networks. Peer-to-Peer Networking and Applications. 2017 Nov;10(6):1304-22

    work page 2017

  9. [9]

    Optimized P2P streaming for wireless distributed networks

    Maccari L, Facchi N, Baldesi L, Cigno RL. Optimized P2P streaming for wireless distributed networks. Pervasive and Mobile Computing. 2017 Dec 1;42:335-50

    work page 2017

  10. [10]

    On reducing mesh delay for peer-to-peer live streaming

    Ren D, Li YT, Chan SH. On reducing mesh delay for peer-to-peer live streaming. In IEEE INFOCOM 2008-The 27th Conference on Computer Communications 2008 Apr 13 (pp. 1058-1066). IEEE

    work page 2008

  11. [11]

    The capacity of wireless networks

    Gupta P, Kumar PR. The capacity of wireless networks. IEEE Transactions on information theory. 2000 Mar;46(2):388-404

    work page 2000

  12. [12]

    The capacity of smartphone peer-to-peer networks

    Dinitz M, Halldórsson MM, Newport C, Weaver A. The capacity of smartphone peer-to-peer networks. arXiv preprint arXiv:1908.01894. 2019 Aug 5

    work page arXiv 1908

  13. [13]

    A framework for distributed bandwidth allocation in peer-to-peer networks

    Koutsopoulos I, Iosifidis G. A framework for distributed bandwidth allocation in peer-to-peer networks. Performance Evaluation. 2010 Apr 1;67(4):285-98

    work page 2010

  14. [14]

    A novel bandwidth allocation scheme for elastic and inelastic services in peer-to-peer networks

    Li S, Yuan K, Zhang Y, Sun W. A novel bandwidth allocation scheme for elastic and inelastic services in peer-to-peer networks. IAENG International Journal of Computer Science. 2019 Jun 1;46(2):163-9

    work page 2019

  15. [15]

    Fundamental limits of caching

    Maddah-Ali MA, Niesen U. Fundamental limits of caching. IEEE Transactions on information theory. 2014 Mar 11;60(5):2856-67

    work page 2014

  16. [16]

    Coded caching over multicast routing networks

    Bayat M, Wan K, Caire G. Coded caching over multicast routing networks. IEEE Transactions on Communications. 2021 Feb 24;69(6):3614-27

    work page 2021

  17. [17]

    AG-MS: A user grouping scheme for DASH multicast over wireless networks

    Yuan Y, Zhang Z, Liu D. AG-MS: A user grouping scheme for DASH multicast over wireless networks. In2017 IEEE 85th Vehicular Technology Conference (VTC Spring) 2017 Jun 4 (pp. 1-5). IEEE

    work page 2017

  18. [18]

    A low-complexity cache-aided multi- antenna content delivery scheme

    Zhao J, Amiri MM, Gündüz D. A low-complexity cache-aided multi- antenna content delivery scheme. In2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2019 Jul 2 (pp. 1-5). IEEE

    work page 2019

  19. [19]

    Three-user D2D coded caching with two random requesters and one sender

    Wang W, Liu N, Kang W. Three-user D2D coded caching with two random requesters and one sender. IEEE Transactions on Communications. 2023 Aug 31

    work page 2023

  20. [20]

    Seamless multimedia delivery within a heterogeneous wireless networks environment: Are we there yet?

    Trestian R, Comsa IS, Tuysuz MF. Seamless multimedia delivery within a heterogeneous wireless networks environment: Are we there yet?. IEEE Communications Surveys & Tutorials. 2018 Jan 4;20(2):945-77

    work page 2018

  21. [21]

    Multi-technology management of heterogeneous wireless networks

    De Schepper T, Famaey J, Latré S. Multi-technology management of heterogeneous wireless networks. In NOMS 2020-2020 IEEE/IFIP Network Operations and Management Symposium 2020 Apr 20 (pp. 1- 6). IEEE

    work page 2020

  22. [22]

    Strategies and demonstration to support multiple wireless protocols with a single RF front-end

    Mohamed M, Handagala S, Xu J, Leeser M, Onabajo M. Strategies and demonstration to support multiple wireless protocols with a single RF front-end. IEEE Wireless Communications. 2020 Jun 5;27(3):88-95

    work page 2020

  23. [23]

    Location-aware network selection mechanism in heterogeneous wireless networks

    Bi T, Muntean GM. Location-aware network selection mechanism in heterogeneous wireless networks. In2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) 2017 May 1 (pp. 583-588). IEEE

    work page 2017

  24. [24]

    Low complexity content replication through clustering in Content-Delivery Networks

    Gkatzikis L, Sourlas V, Fischione C, Koutsopoulos I. Low complexity content replication through clustering in Content-Delivery Networks. Computer Networks. 2017 Jul 5;121:137-51

    work page 2017

  25. [25]

    Content delivery networks: state of the art, trends, and future roadmap

    Zolfaghari B, Srivastava G, Roy S, Nemati HR, Afghah F, Koshiba T, Razi A, Bibak K, Mitra P, Rai BK. Content delivery networks: state of the art, trends, and future roadmap. ACM Computing Surveys (CSUR). 2020 Apr 16;53(2):1-34

    work page 2020

  26. [26]

    Survey on peer- assisted content delivery networks

    Anjum N, Karamshuk D, Shikh-Bahaei M, Sastry N. Survey on peer- assisted content delivery networks. Computer Networks. 2017 Apr 7;116:79-95

    work page 2017

  27. [27]

    Qos provisionings for device-to-device content delivery in cellular networks

    Xu Y, Liu F. Qos provisionings for device-to-device content delivery in cellular networks. IEEE Transactions on Multimedia. 2017 May 2;19(11):2597-608

    work page 2017

  28. [28]

    Mobility-aware cross-layer routing for peer-to-peer networks

    Deokate B, Lal C, Trček D, Conti M. Mobility-aware cross-layer routing for peer-to-peer networks. Computers and Electrical Engineering. 2019 Jan 1;73:209–26

    work page 2019

  29. [29]

    An efficient hypercube labeling schema for dynamic Peer-to-Peer networks

    Toce A, Mowshowitz A, Kawaguchi A, Stone P, Dantressangle P, Bent G. An efficient hypercube labeling schema for dynamic Peer-to-Peer networks. J Parallel Distrib Comput. 2017 Apr 1;102:186–98

    work page 2017

  30. [30]

    Newton-Raphson Consensus under asynchronous and lossy communications for peer-to-peer networks

    Bof N, Carli R, Notarstefano G, Schenato L, Varagnolo D. Newton- Raphson Consensus under asynchronous and lossy communications for peer-to-peer networks. 2017 Jul 28; Available from: http://arxiv.org/abs/1707.09178

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  31. [31]

    Resource discovery in the peer to peer networks using an inverted ant colony optimization algorithm

    Asghari S, Navimipour NJ. Resource discovery in the peer to peer networks using an inverted ant colony optimization algorithm. Peer Peer Netw Appl. 2019 Jan 1;12(1):129–42

    work page 2019

  32. [32]

    A token-based incentive mechanism for video streaming applications in peer-to-peer networks

    Aslani R, Hakami V, Dehghan M. A token-based incentive mechanism for video streaming applications in peer-to-peer networks. Multimed Tools Appl. 2018 Jun 1;77(12):14625–53

    work page 2018

  33. [33]

    Capsearch: capacity-based search in highly dynamic peer-to-peer networks

    Disterhoft A, Graffi K. Capsearch: capacity-based search in highly dynamic peer-to-peer networks. In:Proceedings-International Conference on Advanced Information Networking and Applications, AINA. Institute of Electrical and Electronics Engineers Inc.; 2017. p. 621–30

    work page 2017

  34. [34]

    Node Cooperation Analysis in Mobile Peer-to-peer Networks

    Qu D, Wu S, Liang D, Zheng J, Kang L, Shen H. Node Cooperation Analysis in Mobile Peer-to-peer Networks. InICC 2020 IEEE International Conference on Communications (ICC)2020 Jun 7(pp.1-6)

    work page 2020

  35. [35]

    Efficient data dissemination for Wi-Fi peer-to-peer networks by unicasting among Wi-Fi P2P groups

    Pan MS, Lin YP. Efficient data dissemination for Wi-Fi peer-to-peer networks by unicasting among Wi-Fi P2P groups. Wireless Networks. 2018 Nov 1;24(8):3063–81

    work page 2018

  36. [36]

    QoE in pull based P2P-TV systems: Overlay topology design tradeoffs

    Fortuna R, Leonardi E, Mellia M, Meo M, Traverso S. QoE in pull based P2P-TV systems: Overlay topology design tradeoffs. In: 2010 IEEE 10th International Conference on Peer-to-Peer Computing, P2P 2010 – Proceedings. 2010

    work page 2010

  37. [37]

    Dynamic Resource Allocation for Scalable Video Multirate Multicast over Wireless Networks

    Chen S, Yang B, Yang J, Hanzo L. Dynamic Resource Allocation for Scalable Video Multirate Multicast over Wireless Networks. IEEE Trans Veh Technol. 2020 Sep 1;69(9):10227–41

    work page 2020

  38. [38]

    An Optimized Hybrid Unicast/Multicast Adaptive Video Streaming Scheme over MBMS- Enabled Wireless Networks

    Guo J, Gong X, Liang J, Wang W, Que X. An Optimized Hybrid Unicast/Multicast Adaptive Video Streaming Scheme over MBMS- Enabled Wireless Networks. IEEE Transactions on Broadcasting. 2018 Dec 1;64(4):791–802

    work page 2018

  39. [39]

    XORs in The Air: Practical Wireless Network Coding

    Katti S, Rahul H, Hu Dina Katabi W, Crowcroft J. XORs in The Air: Practical Wireless Network Coding. 2006

    work page 2006

  40. [40]

    A Hybrid Unicast-Multicast Network Selection for Video Deliveries in Dense Heterogeneous Network Environments

    Araniti G, Scopelliti P, Muntean GM, Iera A. A Hybrid Unicast-Multicast Network Selection for Video Deliveries in Dense Heterogeneous Network Environments. IEEE Transactions on Broadcasting. 2019 Mar 1;65(1):83–93

    work page 2019

  41. [41]

    An Improved Delay-Resistant and Reliable Hybrid Overlay for Peer-to-Peer Video Streaming in Wired and Wireless Networks

    Maheswari BU, Ramesh TK. An Improved Delay-Resistant and Reliable Hybrid Overlay for Peer-to-Peer Video Streaming in Wired and Wireless Networks. IEEE Access. 2018;6:56539–50

    work page 2018

  42. [42]

    Device-to-Device Communications Enabled Multicast Scheduling for mmWave Small Cells Using Multi- Level Codebooks

    Niu Y, Yu L, Li Y, Zhong Z, Ai B. Device-to-Device Communications Enabled Multicast Scheduling for mmWave Small Cells Using Multi- Level Codebooks. IEEE Trans Veh Technol. 2019 Mar 1;68(3):2724–38

    work page 2019

  43. [43]

    Not taken for granted: Configuring scalable live video streaming under throughput fluctuations in mobile edge networks

    Jiang Y, Sun B, Tsang DH. Not taken for granted: Configuring scalable live video streaming under throughput fluctuations in mobile edge networks. IEEE Transactions on Vehicular Technology. 2021 Feb 11;70(3):2771-82

    work page 2021

  44. [44]

    AMuSe: Adaptive multicast services to very large groups-project overview

    Bejerano Y, Gupta V, Gutterman C, Zussman G. AMuSe: Adaptive multicast services to very large groups-project overview. In2016 25th International Conference on Computer Communication and Networks (ICCCN) 2016 Aug 1 (pp. 1-9). IEEE

    work page 2016

  45. [45]

    A low- latency MPTCP scheduler for live video streaming in mobile networks

    Xing Y, Xue K, Zhang Y, Han J, Li J, Liu J, Li R. A low- latency MPTCP scheduler for live video streaming in mobile networks. IEEE Transactions on Wireless Communications. 2021 May 25;20(11):7230-42

    work page 2021

  46. [46]

    Periodic Transmissions in Random Access Networks: Stressed Period and Delay

    Chen G, Zhang L, Liew SC. Periodic Transmissions in Random Access Networks: Stressed Period and Delay. IEEE Transactions on Communications. 2023 May 5

    work page 2023

  47. [47]

    Dual pricing optimization for live video streaming in mobile edge computing with joint user association and resource management

    Chen WY, Chou PY, Wang CY, Hwang RH, Chen WT. Dual pricing optimization for live video streaming in mobile edge computing with joint user association and resource management. IEEE Transactions on Mobile Computing. 2021 Jun 14

    work page 2021

  48. [48]

    Context-aware Mobile Edge Resource Allocation in OFDMA Downlink System

    Zhang P, Tian H, Zhao P, Fan S. Context-aware Mobile Edge Resource Allocation in OFDMA Downlink System. IEEE Transactions on Network Science and Engineering. 2022 Nov 24. Andrei Negulescu received his Dipl. Ing. in Electronics and Telecommunications from University Politehnica Bucharest, and his M.A.Sc. in Electrical Engineering from Ecole Polytechnique M...

    work page 2022

  49. [49]

    She received Research Initiation Award in 1991 and Career Award in 1995 form National Science Foundation

    Before that, she was on faculty of the Center for Advanced Computer Studies, University of SW Louisiana for three and half years. She received Research Initiation Award in 1991 and Career Award in 1995 form National Science Foundation. She was a Clare Boothe Luce Professor between 1994 and 2000. Her research interests include parallel processing, computer...

    work page 1991