dblp.uni-trier.dewww.uni-trier.de

Ariel Orda

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
87EEValentin Kravtsov, David Carmeli, Werner Dubitzky, Ariel Orda, Assaf Schuster, Mark Silberstein, Benny Yoshpa: Quasi-opportunistic Supercomputing in Grid Environments. ICA3PP 2008: 233-244
86EEMarcelo 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
85EERon Banner, Ariel Orda: Multi-Objective Topology Control in Wireless Networks. INFOCOM 2008: 448-456
84EENiv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349
2007
83EEAlexander Sprintson, Marcelo Yannuzzi, Ariel Orda, Xavier Masip-Bruin: Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks. INFOCOM 2007: 1820-1828
82EELiane Lewin-Eytan, Joseph Naor, Ariel Orda: Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc 2007: 160-169
81EERon Banner, Ariel Orda: Bottleneck Routing Games in Communication Networks. IEEE Journal on Selected Areas in Communications 25(6): 1173-1179 (2007)
80EEChandra 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)
79EERon Banner, Ariel Orda: Multipath routing algorithms for congestion minimization. IEEE/ACM Trans. Netw. 15(2): 413-424 (2007)
78EERon 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
77EEChandra 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
76EERon Banner, Ariel Orda: Bottleneck Routing Games in Communication Networks. INFOCOM 2006
75EEFernando A. Kuipers, Ariel Orda, Danny Raz, Piet Van Mieghem: A Comparison of Exact and epsilon-Approximation Algorithms for Constrained Routing. Networking 2006: 197-208
74EEIdit Keidar, Roie Melamed, Ariel Orda: EquiCast: scalable multicast with selfish users. PODC 2006: 63-71
73EELavy 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)
72EEDean 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
71EEAriel Orda, Ben-Ami Yassour: Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. MobiHoc 2005: 426-437
70EERon Banner, Ariel Orda: Multipath Routing Algorithms for Congestion Minimization. NETWORKING 2005: 536-548
69EEAriel Orda: QoS Routing: Challenges and Solution Approaches. QSHINE 2005
68EEYigal 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)
67EEAriel 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
66EERon Banner, Ariel Orda: The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks. ICNP 2004: 2-11
65EEAriel Orda, Alexander Sprintson: Efficient Algorithms for Computing Disjoint QoS Paths. INFOCOM 2004
64EEDavid Lee, Lavy Libman, Ariel Orda: Path Protection and Blocking Probability Minimization in Optical Networks. INFOCOM 2004
63EEErez Biton, Ariel Orda: QoS Provision and Routing with Stochastic Guarantees. QSHINE 2004: 112-119
62EELiane Lewin-Eytan, Joseph Naor, Ariel Orda: Admission Control in Networks with Advance Reservations. Algorithmica 40(4): 293-304 (2004)
61EELavy Libman, Ariel Orda: Optimal sliding-window strategies in networks with long round-trip delays. Computer Networks 46(2): 219-235 (2004)
2003
60EEDean H. Lorenz, Ariel Orda, Danny Raz: Optimal Partition of QoS Requirements for Many-to-Many Connections. INFOCOM 2003
59EELavy Libman, Ariel Orda: Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays. INFOCOM 2003
58EEAriel Orda, Alexander Sprintson: Precomputation schemes for QoS routing. IEEE/ACM Trans. Netw. 11(4): 578-591 (2003)
2002
57EELiane Lewin-Eytan, Joseph Naor, Ariel Orda: Routing and Admission Control in Networks with Advance Reservations. APPROX 2002: 215-228
56EEAriel Orda, Alexander Sprintson: A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast. INFOCOM 2002
55EEDean H. Lorenz, Ariel Orda: Optimal partition of QoS requirements on unicast paths and multicst trees. IEEE/ACM Trans. Netw. 10(1): 102-114 (2002)
54EELavy Libman, Ariel Orda: Optimal retrial and timeout strategies for accessing network resources. IEEE/ACM Trans. Netw. 10(4): 551-564 (2002)
53EERoch 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
51EERoch Guérin, Ariel Orda: Networks with Advance Reservations: The Routing Perspective. INFOCOM 2000: 118-127
50EEAriel Orda, Alexander Sprintson: QoS Routing: The Precomputation Perspective. INFOCOM 2000: 128-136
49EEMehmet 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)
40EERoch Guérin, Ariel Orda: QoS routing in networks with inaccurate information: theory and algorithms. IEEE/ACM Trans. Netw. 7(3): 350-364 (1999)
39EEAriel Orda: Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Trans. Netw. 7(3): 365-374 (1999)
38EELavy 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
34EEDean H. Lorenz, Ariel Orda: QoS routing in networks with uncertain parameters. IEEE/ACM Trans. Netw. 6(6): 768-778 (1998)
33EEJoseph 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)
27EEYannis A. Korilis, Aurel A. Lazar, Ariel Orda: Achieving network optima using Stackelberg routing strategies. IEEE/ACM Trans. Netw. 5(1): 161-173 (1997)
26EEAurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis: Virtual path bandwidth allocation in multiuser networks. IEEE/ACM Trans. Netw. 5(6): 861-871 (1997)
25EEAriel Orda, Michael Merritt: Efficient Test & Set Constructions for Faulty Shared Memory. Inf. Process. Lett. 62(1): 41-46 (1997)
24EEAriel 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)
20EEMichael 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
9EEAriel Orda, Raphael Rom, Moshe Sidi: Minimum delay routing in stochastic networks. IEEE/ACM Trans. Netw. 1(2): 187-198 (1993)
8EEAriel 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
6EEAriel 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

Coauthor Index

1Eitan Altman [35] [46]
2Ron Banner [66] [70] [76] [78] [79] [81] [85]
3Yigal Bejerano [68]
4Israel Ben-Shahar [43] [47]
5Erez Biton [63]
6Yuri Breitbart [68]
7Niv Buchbinder [84]
8David Carmeli [87]
9Chandra Chekuri [77] [80]
10Julia Chuzhoy [77] [80]
11Werner Dubitzky [87]
12Roch Guérin [29] [40] [51] [53]
13Mehmet Karaul [49]
14Idit Keidar [74]
15Yannis A. Korilis [15] [17] [23] [27] [42] [49]
16Valentin Kravtsov [87]
17Fernando A. Kuipers [75]
18Robert P. Kurshan [12] [13] [19] [41]
19Aurel A. Lazar [15] [17] [18] [23] [26] [27]
20David Lee [64]
21Liane Lewin-Eytan [57] [62] [77] [80] [82] [84]
22Lavy Libman [31] [38] [52] [54] [59] [61] [64] [73]
23Dean H. Lorenz [34] [36] [44] [55] [60] [72]
24Michael Luby [14] [20]
25Eva Marín-Tordera [86]
26Xavier Masip-Bruin [83] [86]
27Roie Melamed [74]
28Michael Merritt [12] [13] [19] [25] [28] [41]
29Piet Van Mieghem [75]
30Joseph Naor (Seffi Naor) [14] [16] [20] [32] [33] [48] [57] [62] [77] [80] [82] [84]
31Giovanni Pacifici [22]
32Dimitrios E. Pendarakis [18] [22] [26]
33Yael Petruschka [32] [48]
34Rajeev Rastogi [68]
35Danny Raz [60] [72] [75]
36Raphael Rom [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [16] [21] [24] [33]
37Sonia R. Sachs [12] [13] [19] [28] [41]
38Assaf Schuster [87]
39René Serral-Gracià [86]
40Yuval Shavitt [72]
41Nahum Shimkin [8] [10] [30] [35] [43] [45] [46] [47]
42Moshe Sidi [7] [9]
43Mark Silberstein [87]
44Alexander Sprintson [50] [56] [58] [65] [67] [68] [83] [86]
45Marcelo Yannuzzi [83] [86]
46Ben-Ami Yassour [71]
47Benny Yoshpa [87]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)