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

Dima Krymskiy

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

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

Computer networks · 1Applied, interdisciplinary, general and emerging computing · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Computer networks
1 paper
Network measurement and analytics · 100%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › deadline scheduling
EDF scheduling
0.112005
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005
Embedded and real-time systems
real-time scheduling
0.112005
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005
Network measurement and analytics › network performance measurement
network performance monitoring
0.012005
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005

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

on-demand scheduling · 0.1offline scheduling · 0.1earliest-deadline-first heuristic · 0.1
YearPublicationVenuePosition
2005 Active and passive measurements on campus, regional and national network backbone paths
abstract
It has become a common practice for Internet service providers (ISPs) to instrument their networks with network measurement infrastructures (NMIs). These NMIs support network-wide "active" and "passive" measurement data collection and analysis to: 1) identify end-to-end performance bottlenecks in network paths and 2) broadly understand Internet traffic characteristics, on an ongoing basis. In this paper, we present our analysis of the active and passive measurement data collected along network backbone paths within typical campus, regional and national networks which carry traffic of cutting-edge Internet applications such as high-quality voice and video conferencing, multimedia streaming and distributed file sharing. The active measurement data has been obtained by using "ActiveMon" software, which we have developed and deployed along the above network backbone paths. The passive measurement data has been obtained using SNMP, Syslog and NetFlow data available at the intermediate routers located at strategic points along the same network backbone paths. Our analysis of the measurement data includes studying notable trends, network events and relative performance issues of the network backbone paths which are reflected in the active and passive measurement data collected regularly over several months. Our results thus provide valuable insights regarding traffic dynamics in the different academic network backbones and can be used for better design and control of networks and also to develop traffic source models based on empirical data from real-networks.
Prasad Calyam, Dima Krymskiy, Mukundan Sridharan, Paul Schopis
ICCCN2
2005 Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
abstract
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies like denial of service attacks. For this purpose, Internet service providers (ISPs) have started to instrument their networks with network measurement infrastructures (NMIs) that periodically run active measurement tasks using measurement servers located at strategic points in their networks. However, one problem that most network engineers have overlooked is the measurement conflict problem. Since active measurement tasks actively inject test packets to collect measurements along network paths, running multiple active measurements at the same time over the same path could result in misleading reports of network performance. We call this phenomenon a measurement conflict. Our recent observation of such measurement conflict motivates us to form a measurement task scheduling problem of meeting periodicity requirements, where real-time scheduling algorithms can play a role. The scheduling problem, however, is not exactly same as any of the existing scheduling problems in the realtime literature, because the problem involves multiple measurement servers running multiple measurement tasks whose conflict dependency propagates along the chains of paths. For this problem, we propose to use an EDF (earliest deadline first) heuristic but allowing "concurrent executions" if possible, to construct an offline schedule for a given measurement task set. Also, we propose a novel mechanism to flexibly use the offline schedule for minimizing the response time of dynamic on-demand measurement jobs. Further, we implement and deploy our scheduling algorithms in a real working NMI for monitoring Internet 2 Abilene network.
Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, Dima Krymskiy
RTSS4