Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Bandwidth scheduling in overlay networks with linear capacity constraints
Chase Q. Wu
Center for Big Data
Data Science
Computer Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bandwidth scheduling in overlay networks with linear capacity constraints'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Capacity Constraints
100%
Bandwidth Scheduling
100%
Overlay Networks
100%
Network Infrastructure
25%
Scheduling Algorithm
25%
Scheduling Problem
25%
Data Transfer
25%
Multiple Users
25%
High-speed Networks
25%
Advance Reservation
25%
Heuristic Algorithms
25%
Optimal Strategy
25%
Big Data Transfer
25%
Dedicated Channel
25%
NP-complete
25%
Relaxation Method
25%
Link Capacity
25%
Network Resource Utilization
25%
Fixed Bandwidth
25%
Path Computation
25%
Bandwidth Availability
25%
IP Networks
25%
Advance Scheduling
25%
Greedy Strategy
25%
Shared Bottleneck
25%
Computer Science
Capacity Constraint
100%
Bandwidth Scheduling
100%
Overlay Network
100%
Path Bandwidth
50%
Network Resource
25%
Network Infrastructure
25%
Scheduling Problem
25%
Big Data
25%
Resource Utilisation
25%
Scheduling Algorithm
25%
Heuristic Algorithm
25%
Optimal Strategy
25%
Link Capacity
25%
Performance Network
25%
Greedy Strategy
25%