Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Edward Crabbe

dblp:142/3830 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 62% Network optimization and economics · 38%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
traffic management
0.212013
Scalable Multi-Class Traffic Management in Data Center Backbone Networks · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics › resource allocation
network utility maximization
0.012013
Scalable Multi-Class Traffic Management in Data Center Backbone Networks · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics
resource allocation
0.012013
Scalable Multi-Class Traffic Management in Data Center Backbone Networks · IEEE J. Sel. Areas Commun. 2013

Methods — techniques the papers use, named apart from their topics

semi-centralized control · 0.2optimization · 0.2decomposition · 0.2
YearPublicationVenuePosition
2013 Scalable Multi-Class Traffic Management in Data Center Backbone Networks
abstract
Large online service providers (OSPs) often build private backbone networks to interconnect data centers in multiple locations. These data centers house numerous applications that produce multiple classes of traffic with diverse performance objectives. Applications in the same class may also have differences in relative importance to the OSP's core business. By controlling both the hosts and the routers, an OSP can perform both application rate-control and network routing. However, centralized management of both rates and routes does not scale due to excessive message-passing between the hosts, routers, and management systems. Similarly, fully-distributed approaches do not scale and converge slowly. To overcome these issues, we investigate two semi-centralized designs that lie at practical points along the spectrum between fully-distributed and fully-centralized solutions. We achieve scalability by distributing computation across multiple tiers of an optimization machinery. Our first design uses two tiers, representing the backbone and classes, to compute class-level link bandwidths and application sending rates. Our second design has an additional tier representing individual data centers. Using optimization, we show that both designs provably maximize the aggregate utility over all traffic classes. Simulations on realistic backbones show that the 3-tier design is more scalable, but converges slower than the 2-tier design.
Amitava Ghosh, Sangtae Ha, Edward Crabbe, Jennifer Rexford
IEEE J. Sel. Areas Commun.3