Attila Korösi

According to our database1, Attila Korösi authored at least 29 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Pricing games of NFV infrastructure providers.
Telecommun. Syst., 2021

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

2019
Tuple space explosion: a denial-of-service attack against a software packet classifier.
Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, 2019

Resource provisioning for highly reliable and ultra-responsive edge applications.
Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019

2017
Diversity coding-based survivable routing with QoS and differential delay bounds.
Opt. Switch. Netw., 2017

Routes Obey Hierarchy in Complex Networks.
CoRR, 2017

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

Optimal resource pooling over legacy equal-split load balancing schemes.
Comput. Networks, 2017

Packing strictly-shortest paths in a tree for QoS-aware routing.
Proceedings of the 2017 IFIP Networking Conference, 2017

2016
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond.
IEEE/ACM Trans. Netw., 2016

Dataplane Specialization for High-performance OpenFlow Software Switching.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

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

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

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

Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm.
Proceedings of the Advances in Communication Networking, 2014

Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously.
Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

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

2013
Memory size bounds of prefix DAGs
CoRR, 2013

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

Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing.
Proceedings of the IFIP Networking Conference, 2013, Brooklyn, 2013

Discriminatory Processor Sharing from Optimization Point of View.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2013

2012
On greedy network formation.
SIGMETRICS Perform. Evaluation Rev., 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

Compressing IP forwarding tables for fun and profit.
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

2010
TrueVod: Streaming or Progressive Downloading?
IEEE Commun. Lett., 2010

Modeling the Content Popularity Evolution in Video-on-Demand Systems.
Proceedings of the Access Networks - 5th International ICST Conference on Access Networks, 2010

2009
High quality P2P-Video-on-Demand with download bandwidth limitation.
Proceedings of the 17th International Workshop on Quality of Service, 2009

2007
Stochastic Model of Finite Buffer Priority Queuing System with Multi-type Batch Arrival and General Rejection.
Proceedings of the Seventh International Conference on Computer and Information Technology (CIT 2007), 2007


  Loading...