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

Steven M. Carter

dblp:66/5128 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—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 · 46% Wireless networking · 23% Optical networks · 23%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical network control plane
advance reservation
0.112006
Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks · INFOCOM 2006
Wireless networking › scheduling › network resource scheduling
bandwidth scheduling
0.112006
Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks · INFOCOM 2006
Routing and switching › qos routing
constrained shortest path
0.112006
Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks · INFOCOM 2006
Routing and switching
path computation
0.112006
Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks · INFOCOM 2006

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

bellman-ford extension · 0.1algebraic path computation · 0.1
YearPublicationVenuePosition
2006 Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks
abstract
A control-plane architecture for supporting advance reservation of dedicated bandwidth channels on a switched network infrastructure is described including the front-end web interface, user and token management scheme, bandwidth scheduler, and signaling daemon. A path computation algorithm for bandwidth scheduling is proposed based on an extension of Bellman-Ford algorithm to an algebraic structure on sequences of disjoint non-negative real intervals. An implementation of this architecture for UltraScience Net is briefly described.
Nageswara S. V. Rao, Chase Qishi Wu, Steven M. Carter, William R. Wing, Amitabha Banerjee, Dipak Ghosal, Biswanath Mukherjee
INFOCOM4