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

D.-L. Pham

dblp:13/3348 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 2 · 2 first-author

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
2 papers
Internet architecture and protocols · 67% Routing and switching · 33%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › quality of service
differentiated services
0.122006
A New Scheduler for Real-Time Applications in Differentiated Services Networks · INFOCOM 2006
A new scheduler for real-time applications in differentiated services networks · INFOCOM 2005
Internet architecture and protocols
quality of service
0.122006
A New Scheduler for Real-Time Applications in Differentiated Services Networks · INFOCOM 2006
A new scheduler for real-time applications in differentiated services networks · INFOCOM 2005
Routing and switching › service disciplines
scheduling and dropping mechanisms
0.122006
A New Scheduler for Real-Time Applications in Differentiated Services Networks · INFOCOM 2006
A new scheduler for real-time applications in differentiated services networks · INFOCOM 2005
Embedded and real-time systems
real-time scheduling
0.022006
A New Scheduler for Real-Time Applications in Differentiated Services Networks · INFOCOM 2006
A new scheduler for real-time applications in differentiated services networks · INFOCOM 2005

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

simulation · 0.1
YearPublicationVenuePosition
2006 A New Scheduler for Real-Time Applications in Differentiated Services Networks
D.-L. Pham, Shinji Sugawara, Tetsuya Miki
INFOCOM1
2005 A new scheduler for real-time applications in differentiated services networks
abstract
In this paper we propose a new scheduler. Deadline fair sharing (DFS), which consists of link scheduling and dropping mechanisms to provide absolute delay and loss guarantees in DiffServ networks. The scheduling mechanism uses dynamic weight associated with each class to schedule the packets and to make a dropping decision when an absolute delay guarantee violation occurs. The dropping mechanism drops packets and detects the onset of an early violation for absolute loss guarantee. When an early violation for the absolute loss guarantee of a class is detected, the scheduling mechanism gives that class more priority for transmitting its packets to prevent that violation. The simulation results show that the proposed scheduler can provide a wide range of absolute loss and delay bounds under various traffic load conditions without controlling the traffic.
D.-L. Pham, Shinji Sugawara, Tetsuya Miki
INFOCOM1