2006 - IEEE Fellow For contributions to the use of game theory for network quality of service and survivability.
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 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.
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.
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.
QoS routing in networks with inaccurate information: theory and algorithms
Roch A. Guérin;Ariel Orda.
IEEE ACM Transactions on Networking (1999)
QoS routing mechanisms and OSPF extensions
R.A. Guerin;A. Orda;D. Williams.
global communications conference (1997)
QoS Routing Mechanisms and OSPF Extensions
G. Apostolopoulos;S. Kama;D. Williams;R. Guerin.
QoS Routing Mechanisms and OSPF Extensions (1999)
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Ariel Orda;Raphael Rom.
Journal of the ACM (1990)
Competitive routing in multiuser communication networks
Ariel Orda;Raphael Rom;Nahum Shimkin.
IEEE ACM Transactions on Networking (1993)
QoS routing in networks with uncertain parameters
D.H. Lorenz;A. Orda.
international conference on computer communications (1998)
Achieving network optima using Stackelberg routing strategies
Yannis A. Korilis;Aurel A. Lazar;Ariel Orda.
IEEE ACM Transactions on Networking (1997)
QoS based routing in networks with inaccurate information: theory and algorithms
R. Guerin;A. Orda.
international conference on computer communications (1997)
Architecting noncooperative networks
Y.A. Korilis;A.A. Lazar;A. Orda.
IEEE Journal on Selected Areas in Communications (1995)
Routing with end-to-end QoS guarantees in broadband networks
IEEE ACM Transactions on Networking (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: