Before revision:  While our proposed Directional Laplacian Centrality may be applied to any graph , we study its effectiveness in identifying important Internet Protocol addresses in network flow data.
After revision:  To build intuition about our measure we show how it identifies the most central vertices in standard network data sets and compare to other graph centrality measures. Finally, we focus our attention on studying its effectiveness in identifying important Internet Protocol addresses in network flow data.