13 citations · 30 across the 5 of their papers we have counts for
7 papers
Coarse-Grained Topology Estimation via Graph Sampling
Maciej Kurant, Minas Gjoka, Yan Wang +3
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this ar…
Towards Unbiased BFS Sampling
Maciej Kurant, Athina Markopoulou, Patrick Thiran
Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration techniques is that a…
Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks
M. Kurant, M. Gjoka, C. T. Butts +1
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately define…
Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC
Maciej Kurant
We consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses…
Survivable Routing in IP-over-WDM Networks in the Presence of Multiple Failures
Maciej Kurant, Patrick Thiran
Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology…
Layered Complex Networks
Maciej Kurant, Patrick Thiran
Many complex networks are only a part of larger systems, where a number of coexisting topologies interact and depend on each other. We introduce a layered model to facilitate the d…