What is he best known for?
The fields of study he is best known for:
- Computer network
- The Internet
- Telecommunications
Emilio Leonardi mostly deals with Computer network, Distributed computing, Throughput, Scheduling and Packet switching.
In general Computer network study, his work on Network packet often relates to the realm of Grid computing, thereby connecting several areas of interest.
His work deals with themes such as Multimedia, Search engine indexing, Cluster analysis and Cache, which intersect with Distributed computing.
His studies deal with areas such as Wireless ad hoc network, Stochastic geometry models of wireless networks, Network topology and Wireless network as well as Throughput.
The concepts of his Scheduling study are interwoven with issues in Delay-tolerant networking, Queueing theory and Digital television.
Emilio Leonardi has researched Packet switching in several fields, including Matching, Xcast, Heuristics, Fast packet switching and Heuristic.
His most cited work include:
- Temporal locality in today's content caching: why it matters and how to model it (153 citations)
- A unified approach to the performance analysis of caching systems (133 citations)
- On the stability of input-queued switches with speed-up (126 citations)
What are the main themes of his work throughout his whole career to date?
Computer network, Distributed computing, Scheduling, Network packet and Network topology are his primary areas of study.
He interconnects Throughput and Wavelength-division multiplexing in the investigation of issues within Computer network.
His Throughput study incorporates themes from Wireless ad hoc network and Topology.
His Distributed computing study incorporates themes from Static routing, Scalability, The Internet and Cache.
His Network packet research includes elements of Quality of service, Communication channel and Ring network.
His study in Network topology is interdisciplinary in nature, drawing from both Telecommunications network, Interconnection and Topology.
He most often published in these fields:
- Computer network (57.86%)
- Distributed computing (36.79%)
- Scheduling (21.74%)
What were the highlights of his more recent work (between 2012-2021)?
- Cache (9.70%)
- Computer network (57.86%)
- Distributed computing (36.79%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Cache, Computer network, Distributed computing, Theoretical computer science and Scalability.
His Cache research incorporates elements of Content and Recommender system.
His biological study spans a wide range of topics, including Wireless, Wireless network and Upload.
Emilio Leonardi has included themes like Popularity, Scheduling, Network packet and Small cell in his Distributed computing study.
The concepts of his Scheduling study are interwoven with issues in Queue, Bottleneck, Queueing theory and Markov chain.
His Scalability research includes themes of Real-time computing, The Internet, Information-centric networking and SIMPLE.
Between 2012 and 2021, his most popular works were:
- Temporal locality in today's content caching: why it matters and how to model it (153 citations)
- A unified approach to the performance analysis of caching systems (133 citations)
- A Unified Approach to the Performance Analysis of Caching Systems (94 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- The Internet
- Telecommunications
His primary scientific interests are in Cache, Computer network, Distributed computing, Theoretical computer science and Cache algorithms.
The study incorporates disciplines such as Dependency and Server in addition to Cache.
The study of Computer network is intertwined with the study of Wireless network in a number of ways.
As a part of the same scientific study, Emilio Leonardi usually deals with the Distributed computing, concentrating on The Internet and frequently concerns with SIMPLE, Scalability and Quality of experience.
His studies in Theoretical computer science integrate themes in fields like Poisson distribution, Locality of reference and Social network.
His Cache algorithms research is multidisciplinary, incorporating perspectives in Algorithm and Upper and lower bounds.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
