András Gulyás

Orcid: 0000-0003-2906-8319

According to our database1, András Gulyás authored at least 52 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Random Walk for Generalization in Goal-Directed Human Navigation on Wikipedia.
Proceedings of the Complex Networks and Their Applications XI, 2022

2021
Analysis of Routing Entropy in Hyperbolic Trees.
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2021

2020
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces.
IEEE/ACM Trans. Netw., 2020

2019
An Extensible Automated Failure Localization Framework Using NetKAT, Felix, and SDN Traceroute.
Future Internet, 2019

2017
A Little Less Interaction, A Little More Action: A Modular Framework for Network Troubleshooting.
CoRR, 2017

Routes Obey Hierarchy in Complex Networks.
CoRR, 2017

Geometric explanation of the rich-club phenomenon in complex networks.
CoRR, 2017

On Measuring the Geographic Diversity of Internet Routes.
IEEE Commun. Mag., 2017

2016
Network Coding as a Service.
CoRR, 2016

2015
Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding.
IEEE/ACM Trans. Netw., 2015

On the Scalability of Routing With Policies.
IEEE/ACM Trans. Netw., 2015

Deductive Way of Reasoning about the Internet AS Level Topology.
CoRR, 2015

Service Provider DevOps network capabilities and tools.
CoRR, 2015

Initial Service Provider DevOps concept, capabilities and proposed tools.
CoRR, 2015

On lower estimating internet queuing delay.
Proceedings of the 38th International Conference on Telecommunications and Signal Processing, 2015

One tool to rule them all: a modular troubleshooting framework for SDN (and other) networks.
Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research, 2015

Towards the 5G Revolution: A Software Defined Network Architecture Exploiting Network Coding as a Service.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

EPOXIDE: A Modular Prototype for SDN Troubleshooting.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

Towards 48-fold cabling complexity reduction in large flattened butterfly networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
Complex Networks as Nash Equilibria of Navigation Games.
CoRR, 2014

ESCAPE: extensible service chain prototyping environment using mininet, click, NETCONF and POX.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Reducing cabling complexity in large flattened butterfly networks by an order of magnitude.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

On the Computational Complexity of Policy Routing.
Proceedings of the Advances in Communication Networking, 2014

SDN based testbeds for evaluating and promoting multipath TCP.
Proceedings of the IEEE International Conference on Communications, 2014

An Information-Theoretic Approach to Routing Scalability.
Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 2014

Towards Unified Programmability of Cloud and Carrier Infrastructure.
Proceedings of the Third European Workshop on Software Defined Networks, 2014

Multi-layered Service Orchestration in a Multi-domain Network Environment.
Proceedings of the Third European Workshop on Software Defined Networks, 2014

2013
Compact policy routing.
Distributed Comput., 2013

Free-scaling your data center.
Comput. Networks, 2013

Incrementally upgradable data center architecture using hyperbolic tessellations.
Comput. Networks, 2013

A large-scale multipath playground for experimenters and early adopters.
Proceedings of the ACM SIGCOMM 2013 Conference, 2013

Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology.
Proceedings of the Advances in Communication Networking, 2013

2012
On greedy network formation.
SIGMETRICS Perform. Evaluation Rev., 2012

Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches.
Proceedings of the ACM SIGCOMM 2012 Conference, 2012

Brief announcement: network formation games can give rise to realistic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Poincaré: A Hyperbolic Data Center Architecture.
Proceedings of the 32nd International Conference on Distributed Computing Systems Workshops (ICDCS 2012 Workshops), 2012

Stateless multi-stage dissemination of information: Source routing revisited.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

Heterogeneous Testbeds, Tools and Experiments -Measurement Requirements Perspective.
Proceedings of the Measurement Methodology and Tools - First European Workshop, 2012

On QoS Support to Ofelia and OpenFlow.
Proceedings of the European Workshop on Software Defined Networking, 2012

OpenFlow Virtualization Framework with Advanced Capabilities.
Proceedings of the European Workshop on Software Defined Networking, 2012

2011
Incentivizing the global wireless village.
Comput. Networks, 2011

Wireless Adapter Sleep Scheduling Based on Video QoE: How to Improve Battery Life When Watching Streaming Video?
Proceedings of 20th International Conference on Computer Communications and Networks, 2011

2010
The Skeleton of the Internet.
Proceedings of the Global Communications Conference, 2010

2009
New stochastic network calculus for loss analysis.
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2006
A stochastic extension of network calculus for workload loss examinations.
IEEE Commun. Lett., 2006

Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus.
Proceedings of the NETWORKING 2006, 2006

A Probabilistic Network Calculus for Characterizing Long-run Network Behavior.
Proceedings of IEEE International Conference on Communications, 2006

2005
Parsimonious estimates of bandwidth requirement for quality of service packet networks.
Perform. Evaluation, 2005

A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems.
Proceedings of the NETWORKING 2005: Networking Technologies, 2005

Dependency criteria on regulated inputs for buffer overflow approximation.
Proceedings of IEEE International Conference on Communications, 2005

2004
Distribution-free conservative bounds for QoS measures.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

Buffer overflow estimation in network elements, multiplexing independent regulated inputs [packet switched networks].
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004


  Loading...