NDLI: Efficient online coflow routing and scheduling

Please wait, while we are loading the content...

Towards distributed ensemble clustering for networked sensing systems: a novel geometric approach

Throughput-optimal broadcast in wireless networks with dynamic topology

Mobility resilience and overhead constrained adaptation in directional 60 GHz WLANs: protocol design and system implementation

Charge me if you can: charging path optimization and scheduling in mobile networks

Fast and reliable unknown tag detection in large-scale RFID systems

Efficient online coflow routing and scheduling

WiFinger: leveraging commodity WiFi for fine-grained finger gesture recognition

Full-duplex delay-and-forward relaying

Posted pricing for robust crowdsensing

An efficient approximation algorithm for online multi-tier multi-cell user association

$P^{2}-SAS:$ preserving users' privacy in centralized dynamic spectrum access systems

Coexistence features of LTE-U for spectrum sharing with collocated Wi-Fi: demo

Towards secure spectrum auction: both bids and bidder locations matter: poster

Joint sensor duty cycle scheduling with coverage guarantee

A node-based CSMA algorithm for improved delay performance in wireless networks

Hybrid routing in wireless networks with diverse connectivity

On LTE-WiFi coexistence and inter-operator spectrum sharing in unlicensed bands: altruism, cooperation and fairness

Joint property estimation for multiple RFID tag sets using snapshots of variable lengths

System intelligence: model, bounds and algorithms

Monitoring vital signs using millimeter wave

Joint selection and transmission scheduling of point-to-point communication requests in multi-channel wireless networks

First learn then earn: optimizing mobile crowdsensing campaigns through data-driven user profiling

Asymptotically optimal algorithm for online reconfiguration of edge-clouds

Analog man-in-the-middle attack against link-based packet source identification

Multi-channel access and rendezvous in CRNs: demo

Anonymous category-level joint tag estimation: poster

Throughput characterization of node-based scheduling in multihop wireless networks: a novel application of the Gallai-Edmonds structure theorem

IQ-Hopping: distributed oblivious channel selection for wireless networks

GAVEL: strategy-proof ascending bid auction for dynamic licensed shared access

Distributed coordination maximization over networks: a stochastic approximation approach

On the capacity regions of single-channel and multi-channel full-duplex links

High-rate WiFi broadcasting in crowded scenarios via lightweight coordination of multiple access points

INCEPTION: incentivizing privacy-preserving data aggregation for mobile crowd sensing systems

Self-adaptive network architecture reconfiguration in CRNs: demo

LocalCoin: An ad-hoc payment scheme for areas with high connectivity: poster

Throughput-optimal multi-hop broadcast algorithms

How can I guard my AP?: non-intrusive user identification for mobile devices using WiFi signals

Deploying carrier-grade WiFi: offload traffic, not money

Anonymous-query based rate control for wireless multicast: approaching optimality with constant feedback

Understanding the impact of limited channel state information on massive MIMO network performances

Supporting real-time wireless traffic through a high-throughput side channel

Full-duplex wireless based on a small-form-factor analog self-interference canceller: demo

Rate maximization under reactive jamming attacks: poster

4G LTE-assisted distributed Device-to-Device communication using android smartphones: demo

Reducing computational complexity of coded caching by partitioning users into groups: poster

Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster

Solving the crowdsourcing dilemma using the zero-determinant strategy: poster

$P^{2}hub$ private personal data hub for mobile devices: poster

Integration of different cryptographic techniques for real-time V2V communication: poster

Context aware dynamic log chunking for mobile healthcare applications: poster

Analysis of region of interest (RoI) of multimedia content using eye-tracker: poster

Towards in-situ sensor network assisted remote sensing of crop parameters: poster

Adaptive non-binary classification for network centric handover in heterogeneous networks: poster

Real time capable UWB wireless network sniffer: poster

PotatoMesh: a solar powered WSN testbed: poster

The accuracy of Android energy measurements for offloading computational expensive tasks: poster

The privacy leaky bucket: your mobile devices: poster

Indoor localization using multi-range beaconing: poster

Geo-spatial resource allocation for heterogeneous vehicular communications: poster

Efficient online coflow routing and scheduling

Content Provider	ACM Digital Library
Author	Li, Yupeng Tan, Haisheng Zhang, Chenzi Zhou, Jipeng Chen, Guihai Lau, Francis C. M. Jiang, Shaofeng H.-C.
Abstract	A coflow is a collection of related parallel flows that occur typically between two stages of a multi-stage compute task in a network, such as shuffle flows in MapReduce. The coflow abstraction allows applications to convey their semantics to the network so that application-level requirements (e.g., minimizing the completion time of the slowest flow) can be better satisfied. In this paper, we study the routing and scheduling of multiple coflows to minimize the average coflow completion time (CCT). We first propose a rounding-based randomized approximation algorithm, called OneCoflow, for single coflow routing and scheduling. The multiple coflow problem is more challenging as coexisting coflows will compete for the same network resources such as link bandwidths. To minimize the average CCT, we derive an online multiple coflow routing and scheduling algorithm, called OMCoflow, and prove that it has a reasonably good competitive ratio. To the best of our knowledge, this is the first online algorithm with theoretical performance guarantees which considers routing and scheduling simultaneously for multi-coflows. Compared with existing methods, OMCoflow runs more efficiently, and it avoids the problem of frequently rerouting the flows. Extensive simulations on a Facebook data trace show that OMCoflow outperforms the state-of-the-art heuristic schemes significantly (e.g., reducing the average CCT by up to 41.8% and the execution time by up to 99.2% against RAPIER [28]).
Starting Page	161
Ending Page	170
Page Count	10
File Format	PDF
ISBN	9781450341844
DOI	10.1145/2942358.2942367
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-07-05
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Data center networks Routing and scheduling Coflow Online algorithm
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Rapier: Integrating routing and scheduling for coflow-aware data center networks

RAPIER: Integrating Routing and Scheduling for Coflow-aware Data Center Networks

Integrating routing and scheduling for coflow-aware data center networks

Efficient coflow scheduling with Varys

Efficient Coflow Scheduling Without Prior Knowledge

A partial-decentralized coflow scheduling scheme in data center networks

Joint Coflow Optimization for Data Center Networks

Efficient Coflow Scheduling in Hybrid-Switched Data Center Networks

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

Efficient online coflow routing and scheduling

Similar Documents

Rapier: Integrating routing and scheduling for coflow-aware data center networks

RAPIER: Integrating Routing and Scheduling for Coflow-aware Data Center Networks

Integrating routing and scheduling for coflow-aware data center networks

Efficient coflow scheduling with Varys

Efficient Coflow Scheduling Without Prior Knowledge

A partial-decentralized coflow scheduling scheme in data center networks

Joint Coflow Optimization for Data Center Networks

Efficient Coflow Scheduling in Hybrid-Switched Data Center Networks

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

Efficient online coflow routing and scheduling