Dejan M. Novakovic

dblp:15/5855 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 3 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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
4 papers
Cloud and datacenter computing · 57% Performance modeling and evaluation · 19% Energy-efficient computing · 12%
Computer networks
2 papers
Network management and operations · 46% Routing and switching · 41% Datacenter networks · 14%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
virtualization
0.322013
DeepDive: Transparently Identifying and Managing Performance Interference in Virtualized Environments · USENIX ATC 2013
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Cloud and datacenter computing
cluster resource management and scheduling
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Cloud and datacenter computing
resource allocation
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Performance modeling and evaluation › workload characterization
workload classification
0.112012
DejaVu: accelerating resource allocation in virtualized environments · ASPLOS 2012
Network management and operations › fault management
fault diagnosis
0.112011
Online testing of federated and heterogeneous distributed systems · SIGCOMM 2011
Distributed systems
distributed system testing
0.112011
Online testing of federated and heterogeneous distributed systems · SIGCOMM 2011
Energy-efficient computing › power management › energy-efficient networking
network power management
0.112011
Identifying and using energy-critical paths · CoNEXT 2011
Routing and switching › inter-domain routing
BGP
0.012011
Online testing of federated and heterogeneous distributed systems · SIGCOMM 2011
Routing and switching
energy-aware routing
0.012011
Identifying and using energy-critical paths · CoNEXT 2011
Routing and switching
traffic engineering
0.012011
Identifying and using energy-critical paths · CoNEXT 2011

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

fault detection · 0.2workload signatures · 0.1caching · 0.1online testing · 0.1on-line testing · 0.1
YearPublicationVenuePosition
2013 DeepDive: Transparently Identifying and Managing Performance Interference in Virtualized Environments
Dejan M. Novakovic, Nedeljko Vasic, Stanko Novakovic, Dejan Kostic, Ricardo Bianchini
USENIX ATC1
2012 DejaVu: accelerating resource allocation in virtualized environments
abstract
Effective resource management of virtualized environments is a challenging task. State-of-the-art management systems either rely on analytical models or evaluate resource allocations by running actual experiments. However, both approaches incur a significant overhead once the workload changes. The former needs to re-calibrate and re-validate models, whereas the latter has to run a new set of experiments to select a new resource allocation. During the adaptation period, the system may run with an inefficient configuration. In this paper, we propose DejaVu - a framework that (1) minimizes the resource management overhead by identifying a small set of workload classes for which it needs to evaluate resource allocation decisions, (2) quickly adapts to workload changes by classifying workloads using signatures and caching their preferred resource allocations at runtime, and (3) deals with interference by estimating an "interference index". We evaluate DejaVu by running representative network services on Amazon EC2. DejaVu achieves more than 10x speedup in adaptation time for each workload change relative to the state-of-the-art. By enabling quick adaptation, DejaVu saves up to 60% of the service provisioning cost. Finally, DejaVu is easily deployable as it does not require any extensive instrumentation or human intervention.
Nedeljko Vasic, Dejan M. Novakovic, Svetozar Miucin, Dejan Kostic, Ricardo Bianchini
ASPLOS2
2011 Identifying and using energy-critical paths
abstract
The power consumption of the Internet and datacenter networks is already significant, and threatens to shortly hit the power delivery limits while the hardware is trying to sustain ever-increasing traffic requirements. Existing energy-reduction approaches in this domain advocate recomputing network configuration with each substantial change in demand. Unfortunately, computing the minimum network subset is computationally hard and does not scale. Thus, the network is forced to operate with diminished performance during the recomputation periods. In this paper, we propose REsPoNse, a framework which overcomes the optimality-scalability trade-off. The insight in REsPoNse is to identify a few energy-critical paths off-line, install them into network elements, and use a simple online element to redirect the traffic in a way that enables large parts of the network to enter a low-power state. We evaluate REsPoNse with real network data and demonstrate that it achieves the same energy savings as the existing approaches, with marginal impact on network scalability and application performance.
Nedeljko Vasic, Prateek Bhurat, Dejan M. Novakovic, Marco Canini, Satyam Shekhar, Dejan Kostic
CoNEXT3
2011 Online testing of federated and heterogeneous distributed systems
abstract
DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with an open-source BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, policy conflicts and programming errors.
Marco Canini, Vojin Jovanovic, Daniele Venzano, Dejan M. Novakovic, Dejan Kostic
SIGCOMM4
2002 The influence of the channel estimation error on the closed loop transmit diversity algorithms performance
abstract
In this paper the influence of the channel estimation error on the performance of the closed loop Tx diversity algorithms for WCDMA is studied for a high number of Tx antennas. The analysed algorithms are generalised closed loop Tx diversity, all-antenna Tx diversity and one-antenna selection Tx diversity. It was shown that generalised closed loop Tx diversity algorithm is more robust to channel estimation errors that all-antenna Tx diversity algorithm. This is valid for both uncorrelated fading and for correlated fading between Tx antennas. The one-antenna selection Tx diversity algorithm is also robust to the channel estimation errors, but its performance is worse than that of generalised closed loop Tx diversity algorithm.
Dejan M. Novakovic, Markku Juntti, Miroslav L. Dukic
PIMRC1
2001 Integration of transmit power control, transmit diversity and receive beamforming
abstract
In this paper an algorithm for joint power control, transmit diversity and receive beamforming is proposed where transmit diversity and receive beamforming weight vectors and downlink power allocations are calculated jointly such that signal to interference ratio at each mobile is above threshold. Since in the frequency division duplex network uplink and downlink are not reciprocal, transmit diversity weight vectors are determined using partial phase combining and only few bits are fed back from mobile to base station. It has been shown that this algorithm offers considerable savings in the total transmitted power and significantly improves the downlink capacity in a network where only high data rate users use the proposed algorithm with two antennas at the mobile terminal.
Dejan M. Novakovic
ICC1