H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 31 Citations 8,484 115 World Ranking 7636 National Ranking 132

Research.com Recognitions

Awards & Achievements

2006 - IEEE Fellow For contributions to the use of game theory for network quality of service and survivability.

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • The Internet
  • Operating system

The scientist’s investigation covers issues in Distributed computing, Quality of service, Computer network, Routing and Mathematical optimization. His Distributed computing research incorporates themes from Link-state routing protocol, Routing protocol and Computational complexity theory. His Quality of service study combines topics in areas such as Node, Unicast, Multicast and Open Shortest Path First.

His Routing research is multidisciplinary, relying on both Network management, Network topology, Network performance and Flow network. His work in the fields of Mathematical optimization, such as Nash equilibrium, overlaps with other areas such as Uniqueness. Ariel Orda has researched Nash equilibrium in several fields, including Counterexample and Price of anarchy.

His most cited work include:

  • Competitive routing in multiuser communication networks (515 citations)
  • QoS Routing Mechanisms and OSPF Extensions (488 citations)
  • Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (426 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Distributed computing, Computer network, Mathematical optimization, Quality of service and Routing. The concepts of his Distributed computing study are interwoven with issues in Scalability, Resource allocation, Network topology, Cloud computing and Routing protocol. Computer network connects with themes related to Approximation algorithm in his study.

His Mathematical optimization research focuses on Game theory and how it relates to Price of anarchy and The Internet. While the research belongs to areas of Quality of service, he spends his time largely on the problem of Node, intersecting his research to questions surrounding Algorithm. His study focuses on the intersection of Nash equilibrium and fields such as Network performance with connections in the field of Network management.

He most often published in these fields:

  • Distributed computing (42.78%)
  • Computer network (42.78%)
  • Mathematical optimization (26.80%)

What were the highlights of his more recent work (between 2013-2021)?

  • Distributed computing (42.78%)
  • Computer network (42.78%)
  • Load balancing (7.73%)

In recent papers he was focusing on the following fields of study:

Ariel Orda mainly focuses on Distributed computing, Computer network, Load balancing, Cloud computing and Mathematical optimization. His Distributed computing research includes themes of Resource allocation, Network topology, Logical topology, Completion time and Shared resource. He works mostly in the field of Computer network, limiting it down to topics relating to Heterogeneous network and, in certain cases, Multi-agent system, Complex network and Reliability, as a part of the same area of interest.

His Load balancing study incorporates themes from Cooperative game theory, Queue and Server. His Mathematical optimization study frequently intersects with other fields, such as Routing. His study looks at the intersection of Quality of service and topics like Spanning tree with Tree, Steiner tree problem and Node.

Between 2013 and 2021, his most popular works were:

  • dRMT: Disaggregated Programmable Switching (56 citations)
  • Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers (34 citations)
  • Network formation games with heterogeneous players and the internet structure (22 citations)

In his most recent research, the most cited papers focused on:

  • Computer network
  • The Internet
  • Operating system

His primary scientific interests are in Distributed computing, Computer network, Cloud computing, Quality of service and Survivability. His work often combines Distributed computing and Load management studies. His Policy-based routing, Node and Dynamic Source Routing study in the realm of Computer network connects with subjects such as Energy consumption.

He combines subjects such as Virtual machine and Load balancing with his study of Cloud computing. His Load balancing study combines topics from a wide range of disciplines, such as Testbed, Real-time computing and Traffic engineering. His Quality of service study integrates concerns from other disciplines, such as Fault tolerance, Unicast, Bottleneck and Spanning tree.

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.

Top Publications

QoS routing in networks with inaccurate information: theory and algorithms

Roch A. Guérin;Ariel Orda.
IEEE ACM Transactions on Networking (1999)

926 Citations

QoS routing mechanisms and OSPF extensions

R.A. Guerin;A. Orda;D. Williams.
global communications conference (1997)

872 Citations

QoS Routing Mechanisms and OSPF Extensions

G. Apostolopoulos;S. Kama;D. Williams;R. Guerin.
QoS Routing Mechanisms and OSPF Extensions (1999)

811 Citations

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Ariel Orda;Raphael Rom.
Journal of the ACM (1990)

712 Citations

Competitive routing in multiuser communication networks

Ariel Orda;Raphael Rom;Nahum Shimkin.
IEEE ACM Transactions on Networking (1993)

699 Citations

QoS routing in networks with uncertain parameters

D.H. Lorenz;A. Orda.
IEEE ACM Transactions on Networking (1998)

473 Citations

QoS based routing in networks with inaccurate information: theory and algorithms

R. Guerin;A. Orda.
international conference on computer communications (1997)

391 Citations

Achieving network optima using Stackelberg routing strategies

Yannis A. Korilis;Aurel A. Lazar;Ariel Orda.
IEEE ACM Transactions on Networking (1997)

375 Citations

Architecting noncooperative networks

Y.A. Korilis;A.A. Lazar;A. Orda.
IEEE Journal on Selected Areas in Communications (1995)

312 Citations

Routing with end-to-end QoS guarantees in broadband networks

Ariel Orda.
IEEE ACM Transactions on Networking (1999)

281 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Ariel Orda

Eitan Altman

Eitan Altman

French Institute for Research in Computer Science and Automation - INRIA

Publications: 68

Fernando A. Kuipers

Fernando A. Kuipers

Delft University of Technology

Publications: 33

Paul G. Spirakis

Paul G. Spirakis

University of Liverpool

Publications: 27

Tamer Basar

Tamer Basar

University of Illinois at Urbana-Champaign

Publications: 26

Guoliang Xue

Guoliang Xue

Arizona State University

Publications: 25

Marwan Krunz

Marwan Krunz

University of Arizona

Publications: 24

Tim Roughgarden

Tim Roughgarden

Columbia University

Publications: 23

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 19

Klara Nahrstedt

Klara Nahrstedt

University of Illinois at Urbana-Champaign

Publications: 18

Piet Van Mieghem

Piet Van Mieghem

Delft University of Technology

Publications: 18

Nirwan Ansari

Nirwan Ansari

New Jersey Institute of Technology

Publications: 17

Yuval Shavitt

Yuval Shavitt

Tel Aviv University

Publications: 14

Athanasios V. Vasilakos

Athanasios V. Vasilakos

Luleå University of Technology

Publications: 14

Shashi Shekhar

Shashi Shekhar

University of Minnesota

Publications: 14

Shigang Chen

Shigang Chen

University of Florida

Publications: 13

Something went wrong. Please try again later.