Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Eduard Glatz is active.

Publication


Featured researches published by Eduard Glatz.


acm special interest group on data communication | 2013

Estimating internet address space usage through passive measurements

Alberto Dainotti; Karyn Benson; Alistair King; kc claffy; Michael G. Kallitsis; Eduard Glatz; Xenofontas A. Dimitropoulos

One challenge in understanding the evolution of Internet infrastructure is the lack of systematic mechanisms for monitoring the extent to which allocated IP addresses are actually used. Address utilization has been monitored via actively scanning the entire IPv4 address space. We evaluate the potential to leverage passive network traffic measurements in addition to or instead of active probing. Passive traffic measurements introduce no network traffic overhead, do not rely on unfiltered responses to probing, and could potentially apply to IPv6 as well. We investigate two challenges in using passive traffic for address utilization inference: the limited visibility of a single observation point; and the presence of spoofed IP addresses in packets that can distort results by implying faked addresses are active. We propose a methodology for removing such spoofed traffic on both darknets and live networks, which yields results comparable to inferences made from active probing. Our preliminary analysis reveals a number of promising findings, including novel insight into the usage of the IPv4 address space that would expand with additional vantage points.


Computing | 2014

Visualizing big network traffic data using frequent pattern mining and hypergraphs

Eduard Glatz; Stelios Mavromatidis; Bernhard Ager; Xenofontas A. Dimitropoulos

Visualizing communication logs, like NetFlow records, is extremely useful for numerous tasks that need to analyze network traffic traces, like network planning, performance monitoring, and troubleshooting. Communication logs, however, can be massive, which necessitates designing effective visualization techniques for large data sets. To address this problem, we introduce a novel network traffic visualization scheme based on the key ideas of (1) exploiting frequent itemset mining (FIM) to visualize a succinct set of interesting traffic patterns extracted from large traces of communication logs; and (2) visualizing extracted patterns as hypergraphs that clearly display multi-attribute associations. We demonstrate case studies that support the utility of our visualization scheme and show that it enables the visualization of substantially larger data sets than existing network traffic visualization schemes based on parallel-coordinate plots or graphs. For example, we show that our scheme can easily visualize the patterns of more than 41 million NetFlow records. Previous research has explored using parallel-coordinate plots for visualizing network traffic flows. However, such plots do not scale to data sets with thousands of even millions of flows.


internet measurement conference | 2012

Classifying internet one-way traffic

Eduard Glatz; Xenofontas A. Dimitropoulos

Internet background radiation (IBR) is a very interesting piece of Internet traffic as it is the result of attacks and misconfigurations. Previous work has primarily analyzed IBR traffic to large unused IP address blocks called network telescopes. In this work, we build new techniques for monitoring one-way traffic in live networks with the main goals of 1) expanding our understanding of this interesting type of traffic towards live networks as well as of 2) making it useful for detecting and analyzing the impact of outages. Our first contribution is a classification scheme for dissecting one-way traffic into useful classes, including one-way traffic due to unreachable services, scanning, peer-to-peer applications, and backscatter. Our classification scheme is helpful for monitoring IBR traffic in live networks solely based on flow level data. After thoroughly validating our classifier, we use it to analyze a massive data-set that covers 7.41 petabytes of traffic from a large backbone network to shed light into the composition of one-way traffic. We find that the main sources of one-way traffic are malicious scanning, peer-to-peer applications, and outages. In addition, we report a number of interesting observations including that one-way traffic makes a very large fraction, i.e., between 34% and 67%, of the total number of flows to the monitored network, although it only accounts for only 3.4% of the number of packets, which suggests a new conceptual model for Internet traffic in which IBR is dominant in terms of flows. Finally, we demonstrate the utility of one-way traffic of the particularly interesting class of unreachable services for monitoring network and service outages by analyzing the impact of interesting events we detected in the network of our university.


IEEE Journal on Selected Areas in Communications | 2016

Lost in Space: Improving Inference of IPv4 Address Space Utilization

Alberto Dainotti; Karyn Benson; Alistair King; Bradley Huffaker; Eduard Glatz; Xenofontas A. Dimitropoulos; Philipp Richter; Alessandro Finamore; Alex C. Snoeren

One challenge in understanding the evolution of the Internet infrastructure is the lack of systematic mechanisms for monitoring the extent to which allocated IP addresses are actually used. In this paper, we advance the science of inferring IPv4 address space utilization by proposing a novel taxonomy and analyzing and correlating results obtained through different types of measurements. We have previously studied an approach based on passive measurements that can reveal used portions of the address space unseen by active approaches. In this paper, we study such passive approaches in detail, extending our methodology to new types of vantage points and identifying traffic components that most significantly contribute to discovering used IPv4 network blocks. We then combine the results we obtained through passive measurements together with data from active measurement studies, as well as measurements from Border Gateway Protocol and additional data sets available to researchers. Through the analysis of this large collection of heterogeneous data sets, we substantially improve the state of the art in terms of: 1) understanding the challenges and opportunities in using passive and active techniques to study address utilization and 2) knowledge of the utilization of the IPv4 space.


Science | 2016

Digital discrimination: Political bias in Internet service provision across ethnic groups

Nils B. Weidmann; Suso Benitez-Baleato; Philipp Hunziker; Eduard Glatz; Xenofontas A. Dimitropoulos

The global expansion of the Internet is frequently associated with increased government transparency, political rights, and democracy. However, this assumption depends on marginalized groups getting access in the first place. Here we document a strong and persistent political bias in the allocation of Internet coverage across ethnic groups worldwide. Using estimates of Internet penetration obtained through network measurements, we show that politically excluded groups suffer from significantly lower Internet penetration rates compared with those in power, an effect that cannot be explained by economic or geographic factors. Our findings underline one of the central impediments to “liberation technology,” which is that governments still play a key role in the allocation of the Internet and can, intentionally or not, sabotage its liberating effects.


visualization for computer security | 2010

Visualizing host traffic through graphs

Eduard Glatz

Gaining an overview of host activities is hard when a host is busily exchanging hundreds or thousands of flows over a network. This makes investigating traffic of a suspicious host a tedious task for a security analyst. We propose a novel host traffic visualization technique that reduces this cognitive burden by i) representing traffic through an annotated k-partite graph reflecting familiar Berkeley socket model semantics, ii) employing a host role summarization for effective removal of ephemeral traffic features, and iii) providing classification and filtering techniques for unwanted traffic, which are important for identifying the functional role of port numbers and for visualization. We present the open-source tool HAPviewer and demonstrate how it can visualize a large number of flows through a compact and easily interpretable graph.


traffic monitoring and analysis | 2015

How Dangerous Is Internet Scanning

Elias Raftopoulos; Eduard Glatz; Xenofontas A. Dimitropoulos; Alberto Dainotti

Internet scanning is a de facto background traffic noise that is not clear if it poses a dangerous threat, i.e., what happens to scanned hosts? what is the success rate of scanning? and whether the problem is worth investing significant effort and money on mitigating it, e.g., by filtering unwanted traffic? In this work we take a first look into Internet scanning from the point of view of scan repliers using a unique combination of data sets which allows us to estimate how many hosts replied to scanners and whether they were subsequently attacked in an actual network. To contain our analysis, we focus on a specific interesting scanning event that was orchestrated by the Sality botnet during February 2011 which scanned the entire IPv4 address space. By analyzing unsampled NetFlow records, we show that 2 % of the scanned hosts actually replied to the scanners. Moreover, by correlating scan replies with IDS alerts from the same network, we show that significant exploitation activity followed towards the repliers, which eventually led to an estimated 8 % of compromised repliers. These observations suggest that Internet scanning is dangerous: in our university network, at least 142 scanned hosts were eventually compromised. World-wide, the number of hosts that were compromised in response to the studied event is likely much larger.


passive and active network measurement | 2015

Transparent Estimation of Internet Penetration from Network Observations

Suso Benitez-Baleato; Nils B. Weidmann; Petros Gigis; Xenofontas A. Dimitropoulos; Eduard Glatz; Brian Trammell

The International Telecommunications Union (ITU) and the Organization for Economic Cooperation and Development (OECD) provide Internet penetration statistics, which are collected from official national sources worldwide, and they are widely used to inform policy-makers and researchers about the expansion of digital technologies. Nevertheless, these statistics are derived with methodologies, which are often opaque and inconsistent across countries. Even more, regimes may have incentives to misreport such statistics. In this work, we make a first attempt to evaluate the consistency of the ITU/OECD Internet penetration statistics with an alternative indicator of Internet penetration, which can be measured with a consistent methodology across countries and relies on public data. We compare, in particular, the ITU and OECD statistics with measurements of the used IPv4 address space across countries and find very high correlations ranging between 0.898 and 0.978 for all years between 2006 and 2010. We also observe that the level of consistency drops for less developed or less democratic countries. Besides, we show that measurements of the used IPv4 address space can serve as a more timely Internet penetration indicator with sub-national granularity, using two large developing countries as case studies.


international conference on communications | 2009

Telephony over Metropolitan Area Ad Hoc Networks: From Concept to Field Test

Eduard Glatz; Ulrich Fiedler

Self-organizing multi-radio mesh networks can be used to establish metropolitan ad hoc telephony networks in disaster recovery situations and public safety settings such as after a flood or a terrorist attack. These networks can be employed to enable forces to extend the remaining circuit- switched communication infrastructure. This paper introduces a system architecture, a self-organized topology construction and channel allocation algorithm and its implementation in a distributed protocol. The architecture relies on commercially available IEEE 802.16-2004 (WiMAX) equipment that can be employed to build routers and gateways to a wired network. The topology construction and maintenance are based on a modified Dijkstra shortest path algorithm that maximizes a combined metric of path qualities and gateway load. Path qualities are derived from link qualities determined by SINR measurements. The channel allocation greedily allocates the locally least-interfered channel. The protocol includes four sub- protocols: a join protocol, a hello protocol, a leave protocol, and a conflict resolution protocol to resolve inconsistencies in topology data across the network. The proposed architecture, algorithms, and protocol have been assessed via extensive simulations and implemented on hardware. Both, simulation results and field tests confirm their applicability/usability.


traffic monitoring and analysis | 2015

How Dangerous Is Internet Scanning? A Measurement Study of the Aftermath of an Internet-Wide Scan

Elias Raftopoulos; Eduard Glatz; Xenofontas A. Dimitropoulos; Alberto Dainotti

Collaboration


Dive into the Eduard Glatz's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Alistair King

University of California

View shared research outputs
Top Co-Authors

Avatar

Karyn Benson

University of California

View shared research outputs
Top Co-Authors

Avatar

Philipp Richter

Technical University of Berlin

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge