Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
Demand-aware network designs of bounded degree
Chen Avin
, Kaushik Mondal
, Stefan Schmid
Research output
:
Contribution to journal
›
Article
›
peer-review
16
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Demand-aware network designs of bounded degree'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Network Design
100%
Bounded Degree
100%
Demand-aware Networks
100%
Data Center Interconnect
50%
Traffic Pattern
50%
Asymptotically Optimal
25%
Bounded Doubling Dimension
25%
Maximum Degree
25%
Worst-case Performance
25%
Expected Path Length
25%
Request Distribution
25%
Communication Patterns
25%
Family of Distributions
25%
Network Design Problem
25%
Sparse Distribution
25%
Network Design Algorithm
25%
Discrete-time Communication
25%
Shortest Routing
25%
Routing Path
25%
Workload Patterns
25%
Node Set
25%
Locally Bounded
25%
Demand-aware
25%
Bounded-degree Network
25%
Computer Science
Network Design
100%
Traffic Pattern
66%
Network Design Problem
33%
Communicating Node
33%
Optimal Demand
33%
Shortest Path Routing
33%
Entropy
33%