74 citations · 103 across the 4 of their papers we have counts for
4 papers
Empirical Time Complexity of Generic Dijkstra Algorithm
Piotr Jurkiewicz, Edyta Biernacka, Jerzy Domżał +1
Generic Dijkstra is a novel algorithm for finding the optimal shortest path in both wavelength-division multiplexed networks (WDM) and elastic optical networks (EON), claimed to ou…
Boundaries of Flow Table Usage Reduction Algorithms Based on Elephant Flow Detection
Piotr Jurkiewicz
The majority of Internet traffic is caused by a relatively small number of flows (so-called elephant flows). This phenomenon can be exploited to facilitate traffic engineering: res…
Flow length and size distributions in campus Internet traffic
Piotr Jurkiewicz, Grzegorz Rzym, Piotr Boryło
The efficiency of flow-based networking mechanisms strongly depends on traffic characteristics and should thus be assessed using accurate flow models. For example, in the case of a…
Testing Implementation of FAMTAR: Adaptive Multipath Routing
Piotr Jurkiewicz, Robert Wójcik, Jerzy Domżał +1
Flow-Aware Multi-Topology Adaptive Routing (FAMTAR) is a new approach to multipath and adaptive routing in IP networks which enables automatic use of alternative paths when the pri…