Surajit Dey

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

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

Systems, architecture and hardware · 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
Transport protocols and congestion control · 70% Network optimization and economics · 23% Content delivery and video streaming · 7%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › distributed congestion control
distributed rate control
0.011992
On Flow Control in Multimedia Networks · HPDC 1992
Transport protocols and congestion control
flow control
0.011992
On Flow Control in Multimedia Networks · HPDC 1992
Transport protocols and congestion control
rate-based flow control
0.011992
On Flow Control in Multimedia Networks · HPDC 1992
Network optimization and economics
resource allocation
0.011992
On Flow Control in Multimedia Networks · HPDC 1992
Content delivery and video streaming
multimedia transmission
0.011992
On Flow Control in Multimedia Networks · HPDC 1992

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

numerical methods · 0.0distributed algorithm · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1992 On Flow Control in Multimedia Networks
abstract
A flow control procedure is presented for virtual circuit computer networks with multimedia data traffic. It is assumed that the data packets belong to different priority groups. Power is used as the performance measure for a virtual circuit (VC). The input rate controller of every virtual circuit selects a throughput which maximizes its own objective function. A distributed algorithm is given which can be executed by the input rate controllers of the VC's without the global knowledge of the network. It is shown that the algorithm coverages to the optimum of the objective function of every virtual circuit and the solution is shown to be independent of the initial throughputs. Some network examples are solved by analytical and numerical methods.>
Pramod K. Varshney, Surajit Dey
HPDC2