Mark Dilman

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:81/6626 · DBLP profile ↗

← Back

2ranked-venue papers

2as first author

0since 2021 · last 2002

—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

Network management and operations · 72% Network measurement and analytics · 17% Internet architecture and protocols · 11%

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

Topic	Weight	Papers	Last	Evidence papers
Network management and operations network monitoring	0.1	2	2002	Efficient reactive monitoring · IEEE J. Sel. Areas Commun. 2002 Efficient Reactive Monitoring · INFOCOM 2001
Network management and operations › network monitoring reactive monitoring	0.1	2	2002	Efficient reactive monitoring · IEEE J. Sel. Areas Commun. 2002 Efficient Reactive Monitoring · INFOCOM 2001
Internet architecture and protocols › network architecture design › layered architecture › protocol layering › network layer IP network	0.0	2	2002	Efficient reactive monitoring · IEEE J. Sel. Areas Commun. 2002 Efficient Reactive Monitoring · INFOCOM 2001

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

statistical characterization · 0.1polling · 0.0event-driven reporting · 0.0polling and event-driven reporting · 0.0

Year	Publication	Venue	Position
2002	Efficient reactive monitoring abstract Networks are monitored in order to ensure that the system operates within desirable parameters. The increasing complexity of networks and services provided by them increases this need for monitoring. Monitoring consists of measuring properties of the network, and of inferring an aggregate predicate from these measurements. Conducting such monitoring introduces traffic overhead that may reduce the overall effective throughput. This paper studies ways to minimize the monitoring communication overhead in IP networks. We develop and analyze several monitoring algorithms that achieve significant reduction in the management overhead while maintaining the functionality. The main idea is to combine global polling with local event driven reporting. The amount of traffic saving depends on the statistical characterization of the monitored data. We indicate the specific statistical factors that affect the saving and show how to choose the right algorithm for the type, of monitored data. In particular, our results show that for Internet traffic our algorithms can save more than 90% of the monitoring traffic. Mark Dilman, Danny Raz	IEEE J. Sel. Areas Commun.	1
2001	Efficient Reactive Monitoring abstract Networks are monitored in order to ensure that the system operates within desirable parameters. The increasing complexity of networks and services provided by them increases this need for monitoring. Monitoring consists of measuring properties of the network, and of inferring an aggregate predicate from these measurements. Conducting such monitoring introduces traffic overhead that may reduce the overall effective throughput. This paper studies ways to minimize the monitoring communication overhead in IP networks. We develop and analyze several monitoring algorithms that achieve significant reduction in the management overhead while maintaining the functionality. The main idea is to combine global polling with local event driven reporting. The amount of traffic saving depends on the statistical characterization of the monitored data. We indicate the specific statistical factors that affect the saving and show how to choose the right algorithm for the type of monitored data. In particular our results show that for Internet traffic our algorithms can save more than 90% of the monitoring traffic. Mark Dilman, Danny Raz	INFOCOM	1