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