Works (56)

Updated: November 7th, 2024 05:01

2024 article

FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet

Gu, H., Li, Z., Yu, R., Wang, X., Zhou, F., Liu, J., & Xue, G. (2024, September 13). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 9.

By: H. Gu n, Z. Li n, R. Yu n, X. Wang n, F. Zhou n, J. Liu n, G. Xue*

author keywords: Quantum networks; Quantum entanglement; Protocols; Photonics; Routing; Qubit; Topology; Quantum network; entanglement routing; entanglement fidelity; network optimization; approximation algorithm
Sources: Web Of Science, NC State University Libraries
Added: September 23, 2024

2024 journal article

FMPTCP: Achieving High Bandwidth Utilization and Low Latency in Data Center Networks

IEEE TRANSACTIONS ON COMMUNICATIONS, 72(1), 317–333.

author keywords: TCPIP; Multipath channels; Routing; Resource management; Delays; Bandwidth; FCC; Multi-path TCP; data center network; congestion control; multi-path routing
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: April 22, 2024

2024 article

Fence: Fee-Based Online Balance-Aware Routing in Payment Channel Networks

Wang, X., Yu, R., Yang, D., Xue, G., Gu, H., Li, Z., & Zhou, F. (2023, October 16). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 10.

By: X. Wang n, R. Yu n, D. Yang*, G. Xue*, H. Gu n, Z. Li n, F. Zhou n

author keywords: Routing; Throughput; Blockchains; Bitcoin; Security; Scalability; Privacy; Blockchain; payment channel network; routing; online algorithm; competitive analysis
Sources: Web Of Science, NC State University Libraries
Added: November 13, 2023

2024 article

Thor: A Virtual Payment Channel Network Construction Protocol over Cryptocurrencies

IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, pp. 771–780.

By: Q. Wei*, D. Yang*, R. Yu n & G. Xue*

author keywords: Cryptocurrency; payment channel network; virtual payment channel
Sources: Web Of Science, NC State University Libraries
Added: November 4, 2024

2024 article

UFinAKA: Fingerprint-Based Authentication and Key Agreement With Updatable Blind Credentials

Wang, M., Chen, J., He, K., Yu, R., Du, R., & Qian, Z. (2023, September 13). IEEE-ACM TRANSACTIONS ON NETWORKING, Vol. 9.

By: M. Wang*, J. Chen*, K. He*, R. Yu*, R. Du n & Z. Qian*

author keywords: Fingerprint; authentication and key agreement; updatable; privacy-preserving
Sources: Web Of Science, NC State University Libraries, ORCID
Added: October 16, 2023

2024 article

VeriEdge: Verifying and Enforcing Service Level Agreements for Pervasive Edge Computing

IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, pp. 2149–2158.

By: X. Wang n, R. Yu n, D. Yang*, H. Gu n & Z. Li n

author keywords: Edge computing; service-level agreement; verifiable computing; service verification; lightweight
Source: Web Of Science
Added: November 4, 2024

2024 conference paper

VeriEdge: Verifying and Enforcing Service Level Agreements for Pervasive Edge Computing

IEEE INFOCOM, 1–10.

By: X. Wang, R. Yu, D. Yang, H. Gu & Z. Li

Source: ORCID
Added: February 22, 2024

2023 journal article

A Vehicular Trust Blockchain Framework With Scalable Byzantine Consensus

IEEE TRANSACTIONS ON MOBILE COMPUTING, 23(5), 4440–4452.

author keywords: Blockchains; Peer-to-peer computing; Trust management; Scalability; Computational modeling; Consensus protocol; Throughput; blockchain; multi-shard consensus; Byzantine fault-tolerance; TEE
Sources: Web Of Science, NC State University Libraries, ORCID
Added: February 1, 2024

2023 conference paper

Dynamic Queuing Analysis and Buffer Management for Entanglement Swapping Buffers with Noise

Proceedings of the 1st Workshop on Quantum Networks and Distributed Quantum Computing.

By: Z. Li n, H. Gu n, X. Wang n & R. Yu n

TL;DR: This paper analyzes the dynamic queuing process for a pair of link-level quantum buffers in entanglement swapping and derives a closed-form buffering time distribution for every incomingEntanglement with respect to the real-time buffer backlog that reveals the probability that entanglements will be discarded due to low fidelity and helps design an active buffer management policy. (via Semantic Scholar)
Source: ORCID
Added: February 1, 2024

2023 conference paper

EA-Market: Empowering Real-Time Big Data Applications with Short-Term Edge SLA Leases

2023 32nd International Conference on Computer Communications and Networks (ICCCN).

TL;DR: EA-Market is designed, an online combinatorial auction mechanism that achieves a competitive social welfare, while guaranteeing truthfulness, budget balance, individual rationality, and computational efficiency in real-time big data applications with throughput and latency goals. (via Semantic Scholar)
Source: ORCID
Added: February 1, 2024

2023 conference paper

ESDI: Entanglement Scheduling and Distribution in the Quantum Internet

2023 32nd International Conference on Computer Communications and Networks (ICCCN).

By: H. Gu n, R. Yu n, Z. Li n, X. Wang n & F. Zhou n

TL;DR: A general optimization framework for entanglement scheduling and distribution called ESDI is designed, and a probabilistic protocol to implement the optimized solutions in a general buffered quantum network is developed. (via Semantic Scholar)
Source: ORCID
Added: February 1, 2024

2023 journal article

EdAR: An Experience-Driven Multipath Scheduler for Seamless Handoff in Mobile Networks

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 22(10), 6839–6852.

author keywords: MPTCP; scheduler; handoff; experience-driven; deep reinforcement learning
TL;DR: Evaluation results show that EdAR outperforms the state-of-the-art MPTCP schedulers in most network scenarios, and in mobile networks with frequent handoffs, EdAR brings $2\times $ improvement in terms of the overall goodput. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: ORCID, Web Of Science, NC State University Libraries
Added: August 19, 2023

2023 article

FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet

Gu, H., Li, Z., Yu, R., Wang, X., Zhou, F., Liu, J., & Xue, G. (2023, January). (Vol. 1, pp. 1–13). Vol. 1, pp. 1–13. http://arxiv.org/abs/2301.08269

By: H. Gu, Z. Li, R. Yu, X. Wang, F. Zhou, J. Liu, G. Xue

Source: ORCID
Added: February 1, 2024

2023 conference paper

INSPIRE: Instance-Level Privacy-Preserving Transformation for Vehicular Camera Videos

2023 32nd International Conference on Computer Communications and Networks (ICCCN).

TL;DR: An INStance-level PrIvacy-pREserving (INSPIRE) video transformation framework for vehicular camera videos that leverages deep neural network models to detect and replace sensitive object instances in vehicular videos with their non-existent counterparts and is robust against model inversion attacks. (via Semantic Scholar)
Source: ORCID
Added: February 1, 2024

2023 conference paper

Qubit Recycling in Entanglement Distillation

IEEE International Conference on Quantum Computing and Engineering (QCE). https://arxiv.org/abs/2307.05702

By: S. Pelletier, R. Yu, G. Rouskas & J. Liu

Source: ORCID
Added: February 1, 2024

2022 article

FedAegis: Edge-Based Byzantine-Robust Federated Learning for Heterogeneous Data

2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), pp. 3005–3010.

By: F. Zhou n, R. Yu n, Z. Li n, H. Gu n & X. Wang n

Contributors: F. Zhou n, R. Yu n, Z. Li n, H. Gu n & X. Wang n

author keywords: Federated learning; edge computing; data heterogeneity; Byzantine robustness; distributionally robust optimization
TL;DR: Experiments show that the proposed FedAegis algorithm can achieve convergence and high accuracy under heterogeneous data and various attack scenarios, while state-of-the-art defenses and robustness mechanisms are non-converging or have reduced average and/or worst-case accuracy. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: ORCID, Web Of Science, NC State University Libraries
Added: December 4, 2022

2022 journal article

On Topology Design for the Quantum Internet

IEEE NETWORK, 36(5), 64–70.

By: R. Yu n, R. Dutta n & J. Liu n

author keywords: Protocols; Network topology; Quantum entanglement; Buildings; Prototypes; Communication channels; Internet
TL;DR: The capacity and performance of various candidate topologies for the quantum Internet are characterized, in terms of the rate of entanglement distribution between source-destination pairs and the fidelity of entangled pairs, respectively. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: March 13, 2023

2022 journal article

Principles and Practices for Application-Network Co-Design in Edge Computing

IEEE NETWORK, 37(5), 137–144.

By: R. Yu n & G. Xue*

author keywords: Edge computing; Cloud computing; Costs; Quality of service; Throughput; Stakeholders; Resource management; Real-time systems; Low latency communication; Autonomous systems; Metaverse; Design engineering; Application software; Autonomous driving; Augmented virtuality; Virtual reality
TL;DR: A new conceptual framework is described, called the application-network co-design approach, to align and direct efforts across application, computing and networking domains towards fully fledged edge computing. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: February 1, 2024

2022 journal article

TAFS: A Truthful Auction for IoT Application Offloading in Fog Computing Networks

IEEE INTERNET OF THINGS JOURNAL, 10(4), 3252–3263.

By: L. Sun*, G. Xue* & R. Yu n

Contributors: R. Yu n

author keywords: Edge computing; Cloud computing; Resource management; Internet of Things; Delays; Task analysis; Real-time systems; Application offloading; double auction; edge computing; fog computing; incentive mechanism
TL;DR: The design of a double auction mechanism, namely, truthful auction for the fog system (TAFS), which provides incentives for FNs to satisfy as many application demands as possible with guaranteed performance, is addressed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: December 4, 2022

2022 article

Why Riding the Lightning? Equilibrium Analysis for Payment Hub Pricing

IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), pp. 5409–5414.

By: X. Wang n, H. Gu n, Z. Li n, F. Zhou n, R. Yu n & D. Yang*

Event: IEEE

author keywords: Payment channel network; game theory; price-setting competition; Bertrand competition
TL;DR: This paper applies equilibrium analysis to the price-setting game between two payment hubs in the PCN with limited channel capacities and partial overlap demand and analyzes existence of pure Nash Equilibriums (NEs) and bounds on the equilibrium revenue under various cases, and proposes an algorithm to find all pure NEs. (via Semantic Scholar)
Sources: ORCID, Web Of Science, NC State University Libraries
Added: December 4, 2022

2021 article

Counter-Collusion Smart Contracts for Watchtowers in Payment Channel Networks

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021).

By: Y. Zhang*, D. Yang*, G. Xue* & R. Yu n

TL;DR: This work leverages smart contracts through economic approaches to counter collusions for watchtowers in PCNs to bring distrust between the watchtower and the counterparty, so that rational parties do not collude or cheat. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: November 23, 2021

2021 article

Data-Driven Edge Resource Provisioning for Inter-Dependent Microservices with Dynamic Load

2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM).

By: R. Yu n, S. Lo n, F. Zhou n & G. Xue*

author keywords: Edge computing; microservice; load balancing; resource provisioning; robustness; data-driven
TL;DR: Simulations with real-world datasets have validated that the proposed edge resource provisioning model provides the important robustness crucially needed in MSAs, and performs superiorly compared to baselines that neglect either network or inter-dependency constraints. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: May 23, 2022

2021 article

Edge-Assisted Collaborative Perception in Autonomous Driving: A Reflection on Communication Design

2021 ACM/IEEE 6TH SYMPOSIUM ON EDGE COMPUTING (SEC 2021), pp. 371–375.

By: R. Yu, D. Yang & H. Zhang

author keywords: Autonomous Driving; Collaborative Perception; Edge Computing; Cellular-V2X; Sensing-based SPS; NS-3
TL;DR: This paper shows the performance gap between distributed and centralized C-V2X scheduling in terms of achievable throughput and communication efficiency, and proposes an architecture that lever-ages the power of edge computing such as road-side units for central communication scheduling. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: June 27, 2022

2020 article

A Blockchain-based Vehicle-trust Management Framework Under a Crowdsourcing Environment

2020 IEEE 19TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2020), pp. 1950–1955.

author keywords: Vehicular crowdsourcing networks; trust management; blockchain; trusted execution environment
TL;DR: A blockchain-based trust management scheme for VCNs to provide a decentralized and trusted service management and introduces TEM-based Proof of Trust to support blockchain maintenance, which works together with an efficient consensus algorithm Zyzzyva for improved scalability. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 16, 2021

2020 conference paper

EARS: Enabling Private Feedback Updates in Anonymous Reputation Systems

2020 IEEE Conference on Communications and Network Security (CNS).

TL;DR: EARS, an anonymous reputation system that ensures user anonymity while supporting all core functionalities (including feedback update) of a reputation system both efficiently and practically, and without the need of a fully trusted central authority is proposed. (via Semantic Scholar)
Source: ORCID
Added: August 27, 2021

2020 journal article

Robust Revocable Anonymous Authentication for Vehicle to Grid Communications

IEEE Transactions on Intelligent Transportation Systems (T-ITS), 21(11), 4845–4857.

author keywords: Smart grid; V2G communications; anonymous authentication; revocable anonymity
Sources: Web Of Science, NC State University Libraries
Added: November 29, 2020

2020 conference paper

Robust resource provisioning in time-varying edge networks

Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc).

Ruozhou Yu

TL;DR: This paper proposes a time-varying stochastic model to capture the time-dependent and uncertain demand and network dynamics in an edge network, and applies a novel robustness model that accounts for both expected and worst-case performance of a service. (via Semantic Scholar)
Source: ORCID
Added: March 7, 2021

2019 conference paper

Load Balancing for Interdependent IoT Microservices

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

Ruozhou Yu

TL;DR: A fully polynomial-time approximation scheme for the QoS-aware load balancing problem, based on a novel abstraction that captures a realization of the application’s internal logic and achieves enhanced QoS compared to heuristic solutions. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2019 conference paper

P4PCN: Privacy-Preserving Path Probing for Payment Channel Networks

2019 IEEE Global Communications Conference (GLOBECOM).

Ruozhou Yu

TL;DR: P4PCN is proposed, a cryptographic protocol for anonymous active probing without knowing the identities or public keys of the intermediate nodes, while hiding the locations of sender and recipient as well as any path-related information, which is lightweight and scales with the number of hops a probe explores. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2019 journal article

Provisioning QoS-Aware and Robust Applications in Internet of Things: A Network Perspective

IEEE/ACM Transactions on Networking, 27(5), 1931–1944.

By: R. Yu n, G. Xue* & X. Zhang*

author keywords: IoT; QoS; robustness; placement and routing; approximation algorithms
TL;DR: This paper studies the problem of resource provisioning for real-time IoT applications, i.e., applications that process concurrent data streams from data sources in the network, and proposes fully polynomial-time approximation schemes for three of the four versions, and a randomized algorithm for the forth. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: December 30, 2019

2018 conference paper

Application Provisioning in Fog Computing-enabled Internet-of-Things: A Network Perspective

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

Ruozhou Yu

TL;DR: This paper considers IoT applications that receive continuous data streams from multiple sources in the network, and study joint application placement and data routing to support all data streams with both bandwidth and delay guarantees. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2018 conference paper

CoinExpress: A Fast Payment Routing Mechanism in Blockchain-Based Payment Channel Networks

2018 27th International Conference on Computer Communication and Networks (ICCCN).

Ruozhou Yu

TL;DR: This paper investigates the problem of payment routing in PCN, proposes a novel distributed dynamic routing mechanism called CoinExpress, and shows that the proposed mechanism is able to achieve outstanding payment acceptance ratio with low routing overhead. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2018 conference paper

Deploying Robust Security in Internet of Things

2018 IEEE Conference on Communications and Network Security (CNS).

Ruozhou Yu

TL;DR: This paper proposes a stochastic model to capture both the expected and worst-case security risks of an IoT system, and proposes a framework to efficiently address the optimal robust deployment of security mechanisms in IoT. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2018 magazine article

The Fog of Things Paradigm: Road toward On-Demand Internet of Things

(2018, September). IEEE Communications Magazine.

Ruozhou Yu

TL;DR: The concept of FoT is introduced, a paradigm for on-demand IoT that features the incorporation of fog computing power, which empowers not only the IoT applications, but more importantly the scalable and efficient management of the system itself. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2018 conference paper

Transmitting and Sharing: A Truthful Double Auction for Cognitive Radio Networks

2018 IEEE International Conference on Communications (ICC).

Ruozhou Yu

TL;DR: It is proved that TDSA-PS is truthful, individually rational, budget-balanced, and computationally efficient, as a Truthful Double Spectrum Auction with transmitting Primary users Sharing. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2017 conference paper

An Approach to QoS-based Task Distribution in Edge Computing Networks for IoT Applications

2017 IEEE International Conference on Edge Computing (EDGE).

Ruozhou Yu

author keywords: computing; task distribution; quality-of-service; IoT applications
TL;DR: Simulation results are presented to show the improvement of using this approach on the increase of the number of tasks to be completed in the edge computing network, and the quality of-service (QoS) requirements of the tasks completed in that network are satisfied. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2017 journal article

Countermeasures Against False-Name Attacks on Truthful Incentive Mechanisms for Crowdsourcing

IEEE Journal on Selected Areas in Communications.

Ruozhou Yu

author keywords: Game theory; crowdsourcing; incentive mechanism; false-name proofness; truthfulness
TL;DR: A Truthful Auction with countermeasures against False-name Attacks (TAFA) is designed as an auction-based incentive mechanism for crowdsourcing and it is proved that TAFA is truthful, individually rational, budget-balanced, and computationally efficient. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2017 journal article

HSDRAN: Hierarchical Software-Defined Radio Access Network for Distributed Optimization

IEEE Transactions on Vehicular Technology.

Ruozhou Yu

author keywords: Distributed optimization; mobile 5G HetNets; radio access network; software-defined networking
TL;DR: The proposed architecture leverages the hierarchical structure of radio access networks, deploying additional local controllers near the network edge, and offloads control tasks from the central controller to local controllers with limited overhead introduced. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2017 journal article

QoS-Aware and Reliable Traffic Steering for Service Function Chaining in Mobile Networks

IEEE Journal on Selected Areas in Communications.

Ruozhou Yu

author keywords: Software-defined networking; mobile networks; service function chaining; quality-of-service; reliability
TL;DR: This paper defines and forms the traffic steering problem for service function chaining in mobile networks, which turns out to be $\mathcal {NP}$ -hard, and develops a fast approximation scheme for the problem, and evaluates its performance via extensive simulation experiments. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2017 conference paper

Robust Incentive Tree Design for Mobile Crowdsensing

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

Ruozhou Yu

author keywords: Crowdsensing; Mobile Networks; Wireless Networks; Incentive Mechanism; Sybil-proofness; Truthfulness
TL;DR: RIT is designed as a Robust Incentive Tree mechanism for mobile crowdsensing which combines the advantages of auctions and incentive trees and it is proved that RIT is truthful and sybil-proof with probability at least H, for any given H in (0,1). (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2017 conference paper

Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers

IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

Ruozhou Yu

TL;DR: This paper formally defines the survivable virtual cluster embedding problem, and proposes a novel algorithm, which computes the most resource-efficient embedding given a tenant request, which is several orders faster than the optimal solution yet able to achieve similar performance. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2017 journal article

The Critical Network Flow Problem: Migratability and Survivability

IEEE/ACM Transactions on Networking.

Ruozhou Yu

author keywords: Critical network flow; traffic engineering; bandwidth guarantee; flow migration; survivability
TL;DR: A new network abstraction, termed critical network flow, which models the bandwidth requirement of modern Internet applications and services and presents a polynomial-time optimal algorithm for each case, including the basic case with no transient network state considered, the cases with network reconfiguration, and the case with survivability against link failures. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2016 conference paper

Enhancing software-defined RAN with collaborative caching and scalable video coding

2016 IEEE International Conference on Communications (ICC).

Ruozhou Yu

author keywords: Software-defined radio access network; collaborative video caching; Scalable Video Coding; 5G mobile networks
TL;DR: This paper enables the controller with the capability to adaptively select the bitrates of videos received by users, in order to maximize the number and quality of video requests that can be served, meanwhile minimizing the transmission cost. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2016 conference paper

Non-Preemptive Coflow Scheduling and Routing

2016 IEEE Global Communications Conference (GLOBECOM).

Ruozhou Yu

TL;DR: An offline optimization framework for co flow scheduling, as well as two subroutines for coflow routing using single-path routing and multi-path routed respectively are proposed, which can greatly reduce coflow completion time compared to coflow-agnostic solutions, and are also computationally efficient. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2016 conference paper

QoS Correlation-Aware Service Composition for Unified Network-Cloud Service Provisioning

2016 IEEE Global Communications Conference (GLOBECOM).

Ruozhou Yu

TL;DR: This paper addresses the challenging problem of QoS correlation-aware network and Cloud service composition as a multi-constraint optimal path problem and proposes a novel algorithm to solve it. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2015 conference paper

A Sybil-Proof and Time-Sensitive Incentive Tree Mechanism for Crowdsourcing

2015 IEEE Global Communications Conference (GLOBECOM).

Ruozhou Yu

author keywords: Crowdsourcing; Submodular Contribution; Time-sensitivity; Sybil-proofness
Source: ORCID
Added: March 29, 2020

2015 journal article

DCloud: Deadline-Aware Resource Allocation for Cloud Computing Jobs

IEEE Transactions on Parallel and Distributed Systems.

Ruozhou Yu

author keywords: Cloud computing; bandwidth guarantee; resource allocation
TL;DR: DCloud is presented, which leverages the (soft) deadlines of cloud computing jobs to enable flexible and efficient resource utilization in data centers and can accept much more jobs than existing solutions, and significantly increase the cloud provider's revenue with less cost for individual tenants. (via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth (OpenAlex)
Source: ORCID
Added: March 29, 2020

2015 journal article

Joint Scheduling and Beamforming Coordination in Cloud Radio Access Networks With QoS Guarantees

IEEE Transactions on Vehicular Technology.

Ruozhou Yu

author keywords: Beamforming; cloud radio access network (C-RAN); multiuser multiple-input multiple-output (MIMO); scheduling; wireless networks
TL;DR: A dynamic user-centric scheduling algorithm is developed to form user groups and cluster RRHs into VBSs by exploiting the nonuniform distribution of users, and an iterative transmit beamformer optimization algorithm is devised to coordinate the transmit beamforming among the V BSs to mitigate the intracell and intercell interference, hence further enhancing the overall system utility. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Source: ORCID
Added: March 29, 2020

2015 journal article

Keep Your Promise: Mechanism Design Against Free-Riding and False-Reporting in Crowdsourcing

IEEE Internet of Things Journal.

Ruozhou Yu

author keywords: Crowdsourcing; false-reporting; free-riding; game theory; incentive mechanisms
TL;DR: This paper designs and proves that DFF is semi-truthful, which discourages dishonest behavior such as free-riding and false-reporting when the rest of the individuals are honest, while guaranteeing transaction-wise budget-balance and computational efficiency. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2015 magazine article

Network function virtualization in the multi-tenant cloud

(2015, May). IEEE Network.

Ruozhou Yu

TL;DR: Opportunities and challenges that network function virtualization brings to the multi-tenant cloud are discussed and a cloud architecture that exploits virtual network functions is proposed that exploitsvirtual network functions. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2015 conference paper

TSA: A framework of truthful spectrum auctions under the physical interference model

2015 IEEE International Conference on Communications (ICC).

Ruozhou Yu

TL;DR: A framework of truthful double auctions, named TSA, is designed for spectrum sharing in cognitive radio networks and it is proved that TSA guarantees all the desired economic properties: individual rationality, budget-balance, computational efficiency, and truthfulness. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2015 conference paper

Towards Min-Cost Virtual Infrastructure Embedding

2015 IEEE Global Communications Conference (GLOBECOM).

Ruozhou Yu

author keywords: Cloud resource allocation; data center virtualization; virtual infrastructure embedding
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2015 conference paper

Truthful incentive mechanisms for crowdsourcing

2015 IEEE Conference on Computer Communications (INFOCOM).

Ruozhou Yu

TL;DR: This work designs an incentive mechanism for each of the three models of crowdsourcing, and proves that these incentive mechanisms are individually rational, budget-balanced, computationally efficient, and truthful. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2014 conference paper

You better be honest: Discouraging free-riding and false-reporting in mobile crowdsourcing

2014 IEEE Global Communications Conference.

Ruozhou Yu

TL;DR: It is proved that EFF eliminates the existence of free-riding and false-reporting, while guaranteeing truthfulness, individual rationality, budget-balance, and computational efficiency, and DFF is semi-truthful, which discourages dishonest behavior when the rest of the individuals are honest. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

2012 journal article

Modeling and Algorithms for QoS-Aware Service Composition in Virtualization-Based Cloud Computing

IEICE Transactions on Communications.

Ruozhou Yu

author keywords: cloud service provisioning; network virtualization; quality of service; service composition; approximation algorithm
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Source: ORCID
Added: March 29, 2020

2012 conference paper

QoS-aware service selection in virtualization-based Cloud computing

2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS).

Ruozhou Yu

TL;DR: This paper presents an improved model for Cloud service provisioning based on the previous Network-Cloud proposal, and proposes a procedure with several QoS-aware service selection algorithms for composing different services offered by a Cloud. (via Semantic Scholar)
Source: ORCID
Added: March 29, 2020

Employment

Updated: March 29th, 2020 11:20

2019 - present

North Carolina State University Raleigh, NC, US
Assistant Professor Computer Science

Education

Updated: March 29th, 2020 11:20

Arizona State University Tempe, Arizona, US
PhD CIDSE

Beijing University of Posts and Telecommunications Beijing, Beijing, CN
BS Computer Science and Technology

Funding History

Funding history based on the linked ORCID record. Updated: August 26th, 2021 14:32

grant July 1, 2021 - June 30, 2026
CAREER: WolfPack: An Application-Network Co-Design Framework for Performance-Guaranteed Real-time Applications at the Network Edge
Directorate for Computer & Information Science & Engineering
grant October 1, 2020 - September 30, 2023
Collaborative Research: CNS Core: Small: Robust Resource Planning and Orchestration to Satisfy End-to-End SLA Requirements in Mobile Edge Networks
Directorate for Computer & Information Science & Engineering

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.