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

Chidambaram Muthu

dblp:39/7757 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—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
Routing and switching · 77% Datacenter networks · 23%

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

TopicWeightPapersLastEvidence papers
Routing and switching › load sharing
dynamic load balancing
0.112009
Multipath load-adaptive routing: putting the emphasis on robustness and simplicity · ICNP 2009
Datacenter networks
load balancing
0.112009
Multipath load-adaptive routing: putting the emphasis on robustness and simplicity · ICNP 2009
Routing and switching
multipath routing
0.112009
Multipath load-adaptive routing: putting the emphasis on robustness and simplicity · ICNP 2009
Routing and switching
routing
0.112009
Multipath load-adaptive routing: putting the emphasis on robustness and simplicity · ICNP 2009
Routing and switching
traffic engineering
0.012009
Multipath load-adaptive routing: putting the emphasis on robustness and simplicity · ICNP 2009

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

flow-level simulation · 0.1
YearPublicationVenuePosition
2009 Multipath load-adaptive routing: putting the emphasis on robustness and simplicity
abstract
We propose a routing and load-balancing approach with the primary goal of being robust to sudden topological changes and significant traffic matrix variations. The proposed method load-balances traffic over several routes in an adaptive way based on its local view of the load in the network. The focus is on robustness and simplicity, rather than optimality, and so it does not rely on a given traffic matrix, nor it is tuned to a specific topology. Instead, we aim to achieve a satisfactory routing under a wide range of traffic and topology scenarios based on each node's independent operation. The scheme avoids the instability risks of previous load-responsive routing schemes, it does not load the control plane with congestion-related signaling, and it can be implemented on top of existing routing protocols. In this paper, we present the proposed scheme, discuss how it aims to meet the objectives of robustness and load-responsiveness, and evaluate its performance under diverse traffic loads and topological changes with flow-level simulations.
Amund Kvalbein, Constantinos Dovrolis, Chidambaram Muthu
ICNP3