The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ariel Orda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Routing and Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:215-228 [Conf]
  2. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    A Structural Linearization Principle for Processes. [Citation Graph (0, 0)][DBLP]
    CAV, 1993, pp:491-504 [Conf]
  3. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    Modelling Asynchrony with a Synchronous Model. [Citation Graph (0, 0)][DBLP]
    CAV, 1995, pp:339-352 [Conf]
  4. Joseph Naor, Ariel Orda, Yael Petruschka
    Dynamic Storage Allocation with Known Durations. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:378-387 [Conf]
  5. Ariel Orda, Raphael Rom
    Packet Duplication and Elimination in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    ICCC, 1986, pp:666-669 [Conf]
  6. Ariel Orda, Raphael Rom
    Distributed shortest-path protocols for time-dependent networks. [Citation Graph (0, 0)][DBLP]
    ICCC, 1988, pp:439-445 [Conf]
  7. Ariel Orda, Raphael Rom
    Packet Duplication and Elimination in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1986, pp:401-404 [Conf]
  8. Ron Banner, Ariel Orda
    The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks. [Citation Graph (0, 0)][DBLP]
    ICNP, 2004, pp:2-11 [Conf]
  9. Eitan Altman, Ariel Orda, Nahum Shimkin
    Bandwidth Allocation for Guaranteed versus Best Effort Service Categories. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:617-624 [Conf]
  10. Israel Ben-Shahar, Ariel Orda, Nahum Shimkin
    Best-Effort Resource Sharing by Users with QoS Requirements. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:883-890 [Conf]
  11. Roch Guérin, Ariel Orda
    Networks with Advance Reservations: The Routing Perspective. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:118-127 [Conf]
  12. Roch Guérin, Ariel Orda
    QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:75-83 [Conf]
  13. Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
    The Designer's Perspective to Noncooperative Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:562-570 [Conf]
  14. Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
    The Role of the Manager in a Noncooperative Network. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1996, pp:1285-1293 [Conf]
  15. Yannis A. Korilis, Ariel Orda
    Incentive Compatible Pricing Strategies for QoS Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:891-899 [Conf]
  16. Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis
    Virtual Path Bandwidth Allocation in Multi-User Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:312-320 [Conf]
  17. David Lee, Lavy Libman, Ariel Orda
    Path Protection and Blocking Probability Minimization in Optical Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  18. Lavy Libman, Ariel Orda
    Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  19. Lavy Libman, Ariel Orda
    Atomic Resource Sharing in Noncooperative Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:1006-1013 [Conf]
  20. Dean H. Lorenz, Ariel Orda
    QoS Routing in Networks with Uncertain Parameters. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:3-10 [Conf]
  21. Dean H. Lorenz, Ariel Orda
    Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:246-253 [Conf]
  22. Dean H. Lorenz, Ariel Orda, Danny Raz
    Optimal Partition of QoS Requirements for Many-to-Many Connections. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  23. Joseph Naor, Ariel Orda, Raphael Rom
    Scheduled Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:579-586 [Conf]
  24. Ariel Orda
    Routing with End to End QoS Guarantees in Broadband Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:27-34 [Conf]
  25. Ariel Orda, Giovanni Pacifici, Dimitrios E. Pendarakis
    An Adaptive Virtual Path Allocation Policy for Broadband Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1996, pp:329-336 [Conf]
  26. Ariel Orda, Raphael Rom
    Location of Central Nodes in Time Varying Computer Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1989, pp:193-199 [Conf]
  27. Ariel Orda, Raphael Rom
    Optimal Routing with Packet Fragmentation in Computer Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:602-609 [Conf]
  28. Ariel Orda, Raphael Rom, Nahum Shimkin
    Competitive Routing in Multi-User Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:964-971 [Conf]
  29. Ariel Orda, Alexander Sprintson
    QoS Routing: The Precomputation Perspective. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:128-136 [Conf]
  30. Ariel Orda, Alexander Sprintson
    A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  31. Ariel Orda, Alexander Sprintson
    Efficient Algorithms for Computing Disjoint QoS Paths. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  32. Ariel Orda, Nahum Shimkin
    Incentive Pricing in Multi-Class Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:659-666 [Conf]
  33. Ariel Orda, Moshe Sidi, Raphael Rom
    Minimum Delay Routing in Stochastic Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:608-616 [Conf]
  34. Ariel Orda, Ben-Ami Yassour
    Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2005, pp:426-437 [Conf]
  35. Ron Banner, Ariel Orda
    Multipath Routing Algorithms for Congestion Minimization. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2005, pp:536-548 [Conf]
  36. Fernando A. Kuipers, Ariel Orda, Danny Raz, Piet Van Mieghem
    A Comparison of Exact and epsilon-Approximation Algorithms for Constrained Routing. [Citation Graph (0, 0)][DBLP]
    Networking, 2006, pp:197-208 [Conf]
  37. Idit Keidar, Roie Melamed, Ariel Orda
    EquiCast: scalable multicast with selfish users. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:63-71 [Conf]
  38. Ariel Orda
    QoS Routing: Challenges and Solution Approaches. [Citation Graph (0, 0)][DBLP]
    QSHINE, 2005, pp:- [Conf]
  39. Erez Biton, Ariel Orda
    QoS Provision and Routing with Stochastic Guarantees. [Citation Graph (0, 0)][DBLP]
    QSHINE, 2004, pp:112-119 [Conf]
  40. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Non-cooperative multicast and facility location games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:72-81 [Conf]
  41. Michael Luby, Joseph Naor, Ariel Orda
    Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:724-732 [Conf]
  42. Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:293-304 [Journal]
  43. Lavy Libman, Ariel Orda
    Optimal sliding-window strategies in networks with long round-trip delays. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:46, n:2, pp:219-235 [Journal]
  44. Ariel Orda, Raphael Rom
    Multihoming in Computer Networks: A Topology-Design Approach. [Citation Graph (0, 0)][DBLP]
    Computer Networks and ISDN Systems, 1989, v:18, n:2, pp:133-141 [Journal]
  45. Joseph Naor, Ariel Orda, Yael Petruschka
    Dynamic storage allocation with known durations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:203-213 [Journal]
  46. Ariel Orda, Raphael Rom
    Distributed Shortest-Path Protocols for Time-Dependent Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1996, v:10, n:1, pp:49-62 [Journal]
  47. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    A Structural Linearization Principle for Processes. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1994, v:5, n:3, pp:227-244 [Journal]
  48. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    Modelling Asynchrony with a Synchronous Model. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1999, v:15, n:3, pp:175-199 [Journal]
  49. Michael Merritt, Ariel Orda, Sonia R. Sachs
    Formal Verification of a Distributed Computer System. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1997, v:10, n:1, pp:93-125 [Journal]
  50. Ariel Orda, Michael Merritt
    Efficient Test & Set Constructions for Faulty Shared Memory. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:1, pp:41-46 [Journal]
  51. Ariel Orda, Raphael Rom
    Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:607-625 [Journal]
  52. Joseph Naor, Ariel Orda, Raphael Rom
    Scheduled Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  53. Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
    Architecting Noncooperative Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1995, v:13, n:7, pp:1241-1251 [Journal]
  54. Ariel Orda, Raphael Rom
    Optimal packet fragmentation and routing in computer networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:11-28 [Journal]
  55. Israel Ben-Shahar, Ariel Orda, Nahum Shimkin
    Dynamic service sharing with heterogeneous preferences. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2000, v:35, n:1-4, pp:83-103 [Journal]
  56. Eitan Altman, Ariel Orda, Nahum Shimkin
    Bandwidth allocation for guaranteed versus best effort service categories. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2000, v:36, n:1-3, pp:89-105 [Journal]
  57. Michael Luby, Joseph Naor, Ariel Orda
    Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:155-166 [Journal]
  58. Lavy Libman, Ariel Orda
    Atomic Resource Sharing in Noncooperative Networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2001, v:17, n:4, pp:385-409 [Journal]
  59. Ariel Orda, Nahum Shimkin
    Incentive pricing in multiclass systems. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:2-4, pp:241-267 [Journal]
  60. Yigal Bejerano, Yuri Breitbart, Ariel Orda, Rajeev Rastogi, Alexander Sprintson
    Algorithms for computing QoS paths with restoration. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:3, pp:648-661 [Journal]
  61. Roch Guérin, Ariel Orda
    Computing shortest paths for any number of hops. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:5, pp:613-620 [Journal]
  62. Roch Guérin, Ariel Orda
    QoS routing in networks with inaccurate information: theory and algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1999, v:7, n:3, pp:350-364 [Journal]
  63. Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
    Achieving network optima using Stackelberg routing strategies. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1997, v:5, n:1, pp:161-173 [Journal]
  64. Lavy Libman, Ariel Orda
    Optimal retrial and timeout strategies for accessing network resources. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:4, pp:551-564 [Journal]
  65. Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis
    Virtual path bandwidth allocation in multiuser networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1997, v:5, n:6, pp:861-871 [Journal]
  66. Dean H. Lorenz, Ariel Orda
    Optimal partition of QoS requirements on unicast paths and multicst trees. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:1, pp:102-114 [Journal]
  67. Dean H. Lorenz, Ariel Orda
    QoS routing in networks with uncertain parameters. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1998, v:6, n:6, pp:768-778 [Journal]
  68. Lavy Libman, Ariel Orda
    The designer's perspective to atomic noncooperative networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1999, v:7, n:6, pp:875-884 [Journal]
  69. Ariel Orda
    Routing with end-to-end QoS guarantees in broadband networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1999, v:7, n:3, pp:365-374 [Journal]
  70. Ariel Orda, Raphael Rom, Moshe Sidi
    Minimum delay routing in stochastic networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1993, v:1, n:2, pp:187-198 [Journal]
  71. Ariel Orda, Raphael Rom, Nahum Shimkin
    Competitive routing in multiuser communication networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1993, v:1, n:5, pp:510-521 [Journal]
  72. Ariel Orda, Alexander Sprintson
    Precomputation schemes for QoS routing. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2003, v:11, n:4, pp:578-591 [Journal]
  73. Ariel Orda, Alexander Sprintson
    A scalable approach to the partition of QoS requirements in unicast and multicast. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:5, pp:1146-1159 [Journal]
  74. Dean H. Lorenz, Ariel Orda, Danny Raz, Yuval Shavitt
    Efficient QoS partition and routing of unicast and multicast. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:16, n:6, pp:1336-1347 [Journal]
  75. Alexander Sprintson, Marcelo Yannuzzi, Ariel Orda, Xavier Masip-Bruin
    Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1820-1828 [Conf]
  76. Ron Banner, Ariel Orda
    Bottleneck Routing Games in Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  77. Mehmet Karaul, Yannis A. Korilis, Ariel Orda
    A market-based architecture for management of geographically dispersed, replicated Web servers. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2000, v:28, n:1-2, pp:191-204 [Journal]
  78. Ron Banner, Ariel Orda
    Multipath routing algorithms for congestion minimization. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:413-424 [Journal]
  79. Ron Banner, Ariel Orda
    The power of tuning: a novel approach for the efficient design of survivable networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:4, pp:737-749 [Journal]

  80. Quasi-opportunistic Supercomputing in Grid Environments. [Citation Graph (, )][DBLP]


  81. Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks. [Citation Graph (, )][DBLP]


  82. Multi-Objective Topology Control in Wireless Networks. [Citation Graph (, )][DBLP]


  83. Topology Design and Control: A Game-Theoretic Perspective. [Citation Graph (, )][DBLP]


  84. Protecting Against Network Infections: A Game Theoretic Perspective. [Citation Graph (, )][DBLP]


  85. Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. [Citation Graph (, )][DBLP]


  86. Designing Low-Capacity Backup Networks for Fast Restoration. [Citation Graph (, )][DBLP]


  87. Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. [Citation Graph (, )][DBLP]


  88. Maximum-lifetime routing: system optimization & game-theoretic perspectives. [Citation Graph (, )][DBLP]


  89. Non-cooperative Cost Sharing Games Via Subsidies. [Citation Graph (, )][DBLP]


  90. EquiCast: Scalable multicast with selfish users. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002