Andras Gulyas

Andras Gulyas

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 July 2015 in Nature Communications
Verified
Journal Article
Open access
PDF file
AGAndras Gulyas
Andras Gulyas
JBJózsef J. Bíró
József J. Bíró
AKAttila Kőrösi
Attila Kőrösi
GRGábor Rétvári
Gábor Rétvári
DKDmitri Krioukov
Dmitri Krioukov
Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

11 May 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MCMáté Csigi
Máté Csigi
AKAttila Kőrösi
Attila Kőrösi
JBJózsef Bíró
József Bíró
ZHZalán Heszberger
Zalán Heszberger
YMYury Malkov
Yury Malkov
AGAndras Gulyas
Andras Gulyas
The rich club organization (the presence of highly connected hub core in a network) influences many structural and functional characteristics of networks including topology, the efficiency of paths and distribution of load. Despite its major role, the literature contains only a very limited set of models capable of generating networks with realistic rich club structure. One possible reason is that the rich club organization is a divisive property among complex networks which exhibit great diversity, in contrast to other metrics (e.g. diameter, clustering or degree distribution) which seem to behave very similarly across many networks. Here we propose a simple yet powerful geometry-based growing model which can generate realistic complex networks with high rich club diversity by controlling a single geometric parameter. The growing model is validated against the Internet, protein-protein interaction, airport and power grid networks.

13 August 2012 in ACM SIGCOMM Computer Communication Review
Verified
Journal Article
Open access
FNFelicián Németh
Felicián Németh
ÁSÁdám Stipkovits
Ádám Stipkovits
BSBalázs Sonkoly
Balázs Sonkoly
AGAndras Gulyas
Andras Gulyas
The limited capabilities of the switches renders the implementation of unorthodox routing and forwarding mechanisms as a hard task in OpenFlow. Our high level goal is therefore to inspect the possibilities of slightly smartening up the OpenFlow switches. As a first step in this direction we demonstrate (with Bloom filters, greedy routing and network coding) that a very limited computational capability enables us to natively support experimental technologies while preserving performance. We distribute the demos in source files and as a ready-to-experiment VM image to promote further improvements and evaluations.

3 August 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
ACAttila Csoma
Attila Csoma
AKAttila Kőrösi
Attila Kőrösi
GRGábor Rétvári
Gábor Rétvári
ZHZalán Heszberger
Zalán Heszberger
JBJózsef Bíró
József Bíró
AGAndras Gulyas
Andras Gulyas
The last two decades of network science have discovered stunning similarities in the topological characteristics of real life networks (many biological, social, transportation and organizational networks) on a strong empirical basis. However our knowledge about the operational paths used in these networks is very limited, which prohibits the proper understanding of the principles of their functioning. Today, the most widely adopted hypothesis about the structure of the operational paths is the shortest path assumption. Here we present a striking result that the paths in various networks are significantly stretched compared to their shortest counterparts. Stretch distributions are also found to be extremely similar. This phenomenon is empirically confirmed on four networks from diverse areas of life. We also identify the high-level path selection rules nature seems to use when picking its paths.

1 September 2014
Verified
Conference Paper
Open access
ACAttila Csoma
Attila Csoma
BSBalázs Sonkoly
Balázs Sonkoly
LCLevente Csikor
Levente Csikor
FNFelician Nemeth
Felician Nemeth
AGAndras Gulyas
Andras Gulyas
SSSahel Sahhaf
Sahel Sahhaf
In this demo, we show a novel method to multi-layer service orchestration in a multi-domain network. This method is a basic implementation of the three layered concept with multi-layer orchestration designed by the UNIFY project. A global orchestrator is capable of instantiating service elements, i.e., virtual network functions (VNFs), in separate domains. Dedicated local orchestrators indifferent infrastructure domains are responsible for setting up new VNF instances and configuring the underlying network. Our implementation is based on the ESCAPE prototyping framework and an OpenStack (OS) data center with the OpenDaylight (ODL) controller.

1 July 2011
Verified
Conference Paper
Closed access
MCMarton Csernai
Marton Csernai
AGAndras Gulyas
Andras Gulyas
Power management is a critical issue for mobile devices, where a significant portion of the total system energy can be often consumed by heavy wireless network activity. In this paper we present a framework that reduces the energy consumption of wireless mobile devices during streaming video content over Wireless LAN networks by utilizing the power saving mechanisms defined in the IEEE 802.11e standard. The framework allows video applications to directly optimize the overall energy efficiency by controlling the sleep cycles of wireless network adapters based on video QoE. The framework employs a simple QoE estimation algorithm that estimates the user level video quality, and adjusts the sleep intervals of the wireless adapter to maintain video quality while maximizing power efficiency. As an important part of our paper the building and configuration steps of a working testbed system is carefully described, which demonstrates the availability and efficiency of the U-APSD power saving technology at hand. A preliminary evaluation of the proposed framework supports that by enabling the WMM Power Saving feature 20-30% of total system energy can be saved even in case of asynchronous video traffic.