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

Sujit Guptan

dblp:71/6468 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—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
Network optimization and economics · 70% Routing and switching · 30%

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

TopicWeightPapersLastEvidence papers
Routing and switching
adaptive routing
0.011997
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing · IEEE/ACM Trans. Netw. 1997
Network optimization and economics › network design
capacity planning
0.011997
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing · IEEE/ACM Trans. Netw. 1997
Network optimization and economics
multiservice loss networks
0.011997
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing · IEEE/ACM Trans. Netw. 1997
Network optimization and economics
admission control
0.011997
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing · IEEE/ACM Trans. Netw. 1997

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

simulation · 0.0multicommodity flow · 0.0
YearPublicationVenuePosition
1997 Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing
abstract
We address a multiservice, multirate loss network environment with dynamic routing. In this setting, we consider multiple traffic load periods (multihour) during the day, and by observing network dynamics, we present a network dimensioning model that consists of two steps: a bandwidth estimation step, followed by a multicommodity flow model for multiple services and traffic loads. For network operations, we discuss a probabilistic admission control policy and three multiservice routing schemes. We have used a ten-node network with multiple asymmetric traffic data sets (partially extracted from an actual network) for our study. It was found that the capacity obtained using the analytic network dimensioning model provides a good estimate of network capacity required for meeting the grade-of-service goal for each service type in each traffic load period; this observation is based on a simulated network environment that uses the proposed admission control and the dynamic routing schemes. Our observation suggests that it may not be not necessary for the dimensioning model to explicitly incorporate an admission control policy, but admission control is needed for network operation to provide desirable grade-of-service.
Deep Medhi, Sujit Guptan
IEEE/ACM Trans. Netw.2