Demo Data from EDBT 2026 / reviewers in the wild / expert
Fugui Wang
dblp:20/5615
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2002
0000-0002-8349-8398ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 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
1 paper |
Internet architecture and protocols · 91% Transport protocols and congestion control · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › quality of service
differentiated services |
0.0 | 1 | 2000 | A random early demotion and promotion marker for assured services · IEEE J. Sel. Areas Commun. 2000 |
Internet architecture and protocols › integrated services
guaranteed service |
0.0 | 1 | 2000 | A random early demotion and promotion marker for assured services · IEEE J. Sel. Areas Commun. 2000 |
Internet architecture and protocols
packet marking |
0.0 | 1 | 2000 | A random early demotion and promotion marker for assured services · IEEE J. Sel. Areas Commun. 2000 |
Transport protocols and congestion control
TCP |
0.0 | 1 | 2000 | A random early demotion and promotion marker for assured services · IEEE J. Sel. Areas Commun. 2000 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | An efficient bandwidth management scheme for real-time Internet applications
Fugui Wang, Prasant Mohapatra, Sarit Mukherjee, Dennis Bushmitch |
Comput. Commun. | 1 |
| 2001 | Using differentiated services to support Internet telephony
Fugui Wang, Prasant Mohapatra |
Comput. Commun. | 1 |
| 2000 | A random early demotion and promotion marker for assured servicesabstractThe differentiated services (DiffServ) model, proposed to evolve the current best-effort Internet to a quality-of-service-aware Internet, provides packet level service differentiation on a per-hop basis. The end-to-end service differentiation may be provided by extending the per-hop behavior over multiple network domains through service level agreements between domains. The edge routers of each of the domains monitor the aggregate flow of the incoming packets and demote packets when the aggregate incoming traffic exceeds the negotiated interdomain service agreement. A demoted packet may encounter other edge routers on its path that have sufficient resources to route the packet with its original marking. In this paper, we propose a random early demotion and promotion (REDP) technique that works at the aggregate traffic level and allows (1) fair demotion of packets belonging to different flows, and (2) easy and fair detection and promotion of the demoted packets. Using early and random decisions on packets REDP ensures fairness in promotion and demotion. It uses a three color marking mechanism, reserving one color fur differentiating between a demoted packet and a packet with the original out-of-profile marking. We experiment with the proposed REDP scheme using the ns2 simulator for both TCP and UDP streams. The results demonstrate the fairness of REDP scheme in demoting and promoting packets. Furthermore, we show a variety of results that demonstrates that REDP provides better assured services compared to the previously proposed RIO scheme with or without the provision of promotion. Fugui Wang, Prasant Mohapatra, Sarit Mukherjee, Dennis Bushmitch |
IEEE J. Sel. Areas Commun. | 1 |