default search action
Ariel Orda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j72]Mohammad Nassar, Ori Rottenstreich, Ariel Orda:
CFTO: Communication-Aware Fairness in Blockchain Transaction Ordering. IEEE Trans. Netw. Serv. Manag. 21(1): 490-506 (2024) - [c99]Yekaterina Podiatchev, Ariel Orda, Ori Rottenstreich:
Survivable Payment Channel Networks. COMSNETS 2024: 479-487 - [i17]Aviad Navon, Juri Belikov, Ariel Orda, Yoash Levron:
On the Stability of Strategic Energy Storage Operation in Wholesale Electricity Markets (Extended Version). CoRR abs/2402.02428 (2024) - [i16]Yekaterina Podiatchev, Ariel Orda, Ori Rottenstreich:
Survivable Payment Channel Networks. IACR Cryptol. ePrint Arch. 2024: 1393 (2024) - 2022
- [j71]Maria Potop-Butucaru, Ariel Orda, Maurice Herlihy, Stefano Secci:
Special issue on blockchain networks and distributed protocols. Ann. des Télécommunications 77(1-2): 1-2 (2022) - [j70]Ran Ben Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard:
Memento: Making Sliding Windows Efficient for Heavy Hitters. IEEE/ACM Trans. Netw. 30(4): 1440-1453 (2022) - [c98]Mohammad Nassar, Ori Rottenstreich, Ariel Orda:
Communication-aware Fairness in Blockchain Transaction Ordering. HPSR 2022: 175-182 - [e2]Fernando Kuipers, Ariel Orda:
SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22 - 26, 2022. ACM 2022, ISBN 978-1-4503-9420-8 [contents] - 2021
- [j69]Shay Vargaftik, Isaac Keslassy, Ariel Orda, Yaniv Ben-Itzhak:
RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods. Mach. Learn. 110(10): 2835-2866 (2021) - [j68]Ariel Orda, Ori Rottenstreich:
Enforcing Fairness in Blockchain Transaction Ordering. Peer-to-Peer Netw. Appl. 14(6): 3660-3673 (2021) - [j67]Gal Mendelson, Shay Vargaftik, Katherine Barabash, Dean H. Lorenz, Isaac Keslassy, Ariel Orda:
AnchorHash: A Scalable Consistent Hash. IEEE/ACM Trans. Netw. 29(2): 517-528 (2021) - [c97]Gal Mendelson, Shay Vargaftik, Dean H. Lorenz, Kathy Barabash, Isaac Keslassy, Ariel Orda:
Load balancing with JET: just enough tracking for connection consistency. CoNEXT 2021: 191-204 - [c96]Aviad Navon, Ariel Orda, Yoash Levron, Juri Belikov:
Effects of Economic Shocks on Power Systems: COVID-19 as a Case Study. ISGT-Europe 2021: 1-5 - [e1]Samson Lasaulce, Panayotis Mertikopoulos, Ariel Orda:
Network Games, Control and Optimization - 10th International Conference, NetGCooP 2020, Cargèse, France, September 22-24, 2021, Proceedings. Communications in Computer and Information Science 1354, Springer 2021, ISBN 978-3-030-87472-8 [contents] - 2020
- [j66]Zhenpeng Shi, Azer Bestavros, Ariel Orda, David Starobinski:
A Game-Theoretic Analysis of Shared/Buy-in Computing Systems. IEEE Open J. Commun. Soc. 1: 190-204 (2020) - [j65]Shay Vargaftik, Isaac Keslassy, Ariel Orda:
LSQ: Load Balancing in Large-Scale Heterogeneous Systems With Multiple Dispatchers. IEEE/ACM Trans. Netw. 28(3): 1186-1198 (2020) - [c95]Diego Kiedanski, Ana Busic, Daniel Kofman, Ariel Orda:
Efficient distributed solutions for sharing energy resources at the local level: a cooperative game approach. CDC 2020: 2634-2641 - [c94]Diego Kiedanski, Ariel Orda, Daniel Kofman:
Discrete and stochastic coalitional storage games. e-Energy 2020: 351-362 - [c93]Diego Kiedanski, Daniel Kofman, Ariel Orda:
Design of a Combinatorial Double Auction for Local Energy Markets. NetGCooP 2020: 315-320 - [c92]Belma Turkovic, Jorik Oostenbrink, Fernando A. Kuipers, Isaac Keslassy, Ariel Orda:
Sequential Zeroing: Online Heavy-Hitter Detection on Programmable Hardware. Networking 2020: 422-430 - [c91]Diego Kiedanski, Ariel Orda, Daniel Kofman:
Combflex: a linear combinatorial auction for local energy markets. SmartGridComm 2020: 1-7 - [i15]Shay Vargaftik, Isaac Keslassy, Ariel Orda:
LSQ: Load Balancing in Large-Scale Heterogeneous Systems with Multiple Dispatchers. CoRR abs/2003.02368 (2020) - [i14]Ido Zoref, Ariel Orda:
An Efficient Algorithm for Finding Sets of Optimal Routes. CoRR abs/2008.10406 (2020)
2010 – 2019
- 2019
- [j64]Gideon Blocq, Ariel Orda:
Coalitions in Routing Games: A Worst-Case Perspective. IEEE Trans. Netw. Sci. Eng. 6(4): 857-870 (2019) - [c90]Diego Kiedanski, Ariel Orda, Daniel Kofman:
The effect of ramp constraints on coalitional storage games. e-Energy 2019: 226-238 - [c89]Ariel Orda, Ori Rottenstreich:
Enforcing Fairness in Blockchain Transaction Ordering. IEEE ICBC 2019: 368-375 - [c88]Diego Kiedanski, Daniel Kofman, Ariel Orda, José Horta, Alvaro Otero:
Exploiting Flexibility in Irrigation While Maintaining Optimal Crop Productivity. SmartGridComm 2019: 1-7 - 2018
- [j63]Eli A. Meirom, Constantine Caramanis, Shie Mannor, Ariel Orda, Sanjay Shakkottai:
Detecting Cascades from Weak Signatures. IEEE Trans. Netw. Sci. Eng. 5(4): 313-325 (2018) - [j62]Jose Yallouz, Ori Rottenstreich, Péter Babarczi, Avi Mendelson, Ariel Orda:
Minimum-Weight Link-Disjoint Node-"Somewhat Disjoint" Paths. IEEE/ACM Trans. Netw. 26(3): 1110-1122 (2018) - [c87]Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard:
Memento: making sliding windows efficient for heavy hitters. CoNEXT 2018: 254-266 - [i13]Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard:
Memento: Making Sliding Windows Efficient for Heavy Hitters. CoRR abs/1810.02899 (2018) - [i12]Gal Mendelson, Shay Vargaftik, Katherine Barabash, Dean H. Lorenz, Isaac Keslassy, Ariel Orda:
AnchorHash: A Scalable Consistent Hash. CoRR abs/1812.09674 (2018) - 2017
- [j61]Eli A. Meirom, Shie Mannor, Ariel Orda:
Strategic Formation of Heterogeneous Networks. IEEE J. Sel. Areas Commun. 35(3): 751-763 (2017) - [j60]Jose Yallouz, Ariel Orda:
Tunable QoS-Aware Network Survivability. IEEE/ACM Trans. Netw. 25(1): 139-149 (2017) - [j59]Shay Vargaftik, Isaac Keslassy, Ariel Orda:
No Packet Left Behind: Avoiding Starvation in Dynamic Topologies. IEEE/ACM Trans. Netw. 25(4): 2571-2584 (2017) - [c86]Gal Cohensius, Shie Mannor, Reshef Meir, Eli A. Meirom, Ariel Orda:
Proxy Voting for Better Outcomes. AAMAS 2017: 858-866 - [c85]Shay Vargaftik, Isaac Keslassy, Ariel Orda:
Stable user-defined priorities. INFOCOM 2017: 1-9 - [c84]Jose Yallouz, János Tapolcai, Attila Körösi, Kristóf Bérczi, László Gyimóthi, Ariel Orda:
Packing strictly-shortest paths in a tree for QoS-aware routing. Networking 2017: 1-9 - [c83]Sharad Chole, Andy Fingerhut, Sha Ma, Anirudh Sivaraman, Shay Vargaftik, Alon Berger, Gal Mendelson, Mohammad Alizadeh, Shang-Tse Chuang, Isaac Keslassy, Ariel Orda, Tom Edsall:
dRMT: Disaggregated Programmable Switching. SIGCOMM 2017: 1-14 - 2016
- [j58]Jose Yallouz, Ori Rottenstreich, Ariel Orda:
Tunable Survivable Spanning Trees. IEEE/ACM Trans. Netw. 24(3): 1853-1866 (2016) - [j57]Gideon Blocq, Ariel Orda:
How Good is Bargained Routing? IEEE/ACM Trans. Netw. 24(6): 3493-3507 (2016) - [j56]Amir Nahir, Ariel Orda, Danny Raz:
Replication-Based Load Balancing. IEEE Trans. Parallel Distributed Syst. 27(2): 494-507 (2016) - [c82]Shay Vargaftik, Katherine Barabash, Yaniv Ben-Itzhak, Ofer Biran, Isaac Keslassy, Dean H. Lorenz, Ariel Orda:
Composite-Path Switching. CoNEXT 2016: 329-343 - [c81]Jose Yallouz, Ori Rottenstreich, Péter Babarczi, Avi Mendelson, Ariel Orda:
Optimal link-disjoint node-"somewhat disjoint" paths. ICNP 2016: 1-10 - [c80]Amir Nahir, Ariel Orda, Danny Raz:
Reversing the supermarket: A distributed approach for handling elasticity in the cloud. NOMS 2016: 87-95 - [c79]Shay Vargaftik, Isaac Keslassy, Ariel Orda, Katherine Barabash, Yaniv Ben-Itzhak, Ofer Biran, Dean H. Lorenz:
Optics in Data Centers: Adapting to Diverse Modern Workloads. SYSTOR 2016: 28:1 - [i11]Gideon Blocq, Ariel Orda:
How Good is Bargained Routing? CoRR abs/1601.04314 (2016) - [i10]Eli A. Meirom, Shie Mannor, Ariel Orda:
Strategic Formation of Heterogeneous Networks. CoRR abs/1604.08179 (2016) - [i9]Michael Keslassy, Ariel Orda:
Establishing Multiple Survivable Connections (Extended Version). CoRR abs/1605.04434 (2016) - [i8]Jose Yallouz, Ariel Orda:
Tunable QoS-Aware Network Survivability. CoRR abs/1608.08660 (2016) - [i7]Gal Cohensius, Shie Mannor, Reshef Meir, Eli A. Meirom, Ariel Orda:
Proxy Voting for Better Outcomes. CoRR abs/1611.08308 (2016) - 2015
- [j55]Majid Ghaderi, Dennis Goeckel, Ariel Orda, Mostafa Dehghan:
Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers. IEEE Trans. Mob. Comput. 14(7): 1433-1448 (2015) - [j54]Amir Nahir, Ariel Orda, Danny Raz:
Workload Factoring: A Game-Theoretic Perspective. IEEE/ACM Trans. Netw. 23(6): 1998-2009 (2015) - [c78]Jose Yallouz, Gideon Blocq, Yoram Revah, Aviran Kadosh, Ariel Orda:
"Don't let the stack get stuck": A novel approach for designing efficient stackable routers. HPSR 2015: 56-63 - [c77]Amir Nahir, Ariel Orda, Danny Raz:
Resource allocation and management in Cloud Computing. IM 2015: 1078-1084 - [c76]Eli A. Meirom, Shie Mannor, Ariel Orda:
Formation games of reliable networks. INFOCOM 2015: 1760-1768 - [c75]Gideon Blocq, Ariel Orda:
"Beat-Your-Rival" Routing Games. SAGT 2015: 231-243 - [c74]Eli A. Meirom, Chris Milling, Constantine Caramanis, Shie Mannor, Sanjay Shakkottai, Ariel Orda:
Localized Epidemic Detection in Networks with Overwhelming Noise. SIGMETRICS 2015: 441-442 - 2014
- [j53]Amir Nahir, Ariel Orda, Ari Freund:
Topology Design of Communication Networks: A Game-Theoretic Perspective. IEEE/ACM Trans. Netw. 22(2): 405-414 (2014) - [c73]Fernando A. Kuipers, Song Yang, Stojan Trajanovski, Ariel Orda:
Constrained Maximum Flow in Stochastic Networks. ICNP 2014: 397-408 - [c72]Eli A. Meirom, Shie Mannor, Ariel Orda:
Network formation games with heterogeneous players and the internet structure. EC 2014: 735-752 - [c71]Jose Yallouz, Ori Rottenstreich, Ariel Orda:
Tunable survivable spanning trees. SIGMETRICS 2014: 315-327 - [i6]Eli A. Meirom, Chris Milling, Constantine Caramanis, Shie Mannor, Ariel Orda, Sanjay Shakkottai:
Localized epidemic detection in networks with overwhelming noise. CoRR abs/1402.1263 (2014) - [i5]Eli A. Meirom, Shie Mannor, Ariel Orda:
Formation Games of Reliable Networks. CoRR abs/1412.8501 (2014) - 2013
- [j52]Xavi Masip, Ariel Orda, Svetoslav Duhovnikov:
Guest editorial. Opt. Switch. Netw. 10(3): 259-260 (2013) - [c70]Amir Nahir, Ariel Orda, Danny Raz:
Schedule first, manage later: Network-aware load balancing. INFOCOM 2013: 510-514 - [c69]Jose Yallouz, Ariel Orda:
Tunable QoS-aware network survivability. INFOCOM 2013: 944-952 - [c68]Majid Ghaderi, Dennis Goeckel, Ariel Orda, Mostafa Dehghan:
Efficient wireless security through jamming, coding and routing. SECON 2013: 505-513 - [i4]Majid Ghaderi, Dennis Goeckel, Ariel Orda, Mostafa Dehghan:
Efficient Wireless Security Through Jamming, Coding and Routing. CoRR abs/1304.2688 (2013) - [i3]Eli A. Meirom, Shie Mannor, Ariel Orda:
Formation Games and the Internet Structure. CoRR abs/1307.4102 (2013) - [i2]Gideon Blocq, Ariel Orda:
Worst-Case Coalitions in Routing Games. CoRR abs/1310.3487 (2013) - 2012
- [j51]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20(2): 477-487 (2012) - [c67]Amir Nahir, Ariel Orda, Danny Raz:
Distributed oblivious load balancing using prioritized job replication. CNSM 2012: 55-63 - [c66]Anteneh Beshir, Fernando A. Kuipers, Ariel Orda, Piet Van Mieghem:
Survivable routing and regenerator placement in optical networks. ICUMT 2012: 684-690 - [c65]Gideon Blocq, Ariel Orda:
How good is bargained routing? INFOCOM 2012: 2453-2461 - [c64]Amir Nahir, Ariel Orda, Danny Raz:
Workload factoring with the cloud: A game-theoretic perspective. INFOCOM 2012: 2566-2570 - [c63]Ariel Orda, Francesco De Pellegrini:
Message from the general chairs. NetGCooP 2012: 1 - 2011
- [j50]Nidhi Hegde, Lavy Libman, Ariel Orda:
Special Issue: Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks: selected papers from WiOpt 2010. Perform. Evaluation 68(8): 629-630 (2011) - [c62]Costas Courcoubetis, Manos Dramitinos, George D. Stamoulis, Gideon Blocq, Avi Miron, Ariel Orda:
Inter-carrier interconnection services: QoS, economics and business issues. ISCC 2011: 779-784 - [c61]Anteneh Beshir, Fernando A. Kuipers, Ariel Orda, Piet Van Mieghem:
Survivable impairment-aware traffic grooming in WDM rings. ITC 2011: 158-165 - 2010
- [j49]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [c60]Fernando A. Kuipers, Anteneh Beshir, Ariel Orda, Piet Van Mieghem:
Impairment-aware path selection and regenerator placement in translucent optical networks. ICNP 2010: 11-20 - [c59]Ron Banner, Ariel Orda:
Designing Low-Capacity Backup Networks for Fast Restoration. INFOCOM 2010: 1864-1872 - [c58]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410
2000 – 2009
- 2009
- [j48]Idit Keidar, Roie Melamed, Ariel Orda:
EquiCast: Scalable multicast with selfish users. Comput. Networks 53(13): 2373-2386 (2009) - [c57]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153 - [c56]Jasmina Omic, Ariel Orda, Piet Van Mieghem:
Protecting Against Network Infections: A Game Theoretic Perspective. INFOCOM 2009: 1485-1493 - [c55]Amir Nahir, Ariel Orda, Ari Freund:
Topology Design and Control: A Game-Theoretic Perspective. INFOCOM 2009: 1620-1628 - [c54]Anteneh Beshir, Fernando A. Kuipers, Piet Van Mieghem, Ariel Orda:
On-line survivable routing in WDM networks. ITC 2009: 1-8 - 2008
- [j47]Marcelo Yannuzzi, Xavier Masip-Bruin, Guillem Fabrego, Sergio Sánchez-López, Alex Sprintson, Ariel Orda:
Toward a new route control model for multidomain optical networks. IEEE Commun. Mag. 46(6): 104-111 (2008) - [c53]Valentin Kravtsov, David Carmeli, Werner Dubitzky, Ariel Orda, Assaf Schuster, Mark Silberstein, Benny Yoshpa:
Quasi-opportunistic Supercomputing in Grid Environments. ICA3PP 2008: 233-244 - [c52]Ron Banner, Ariel Orda:
Multi-Objective Topology Control in Wireless Networks. INFOCOM 2008: 448-456 - [c51]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 - [c50]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349 - 2007
- [j46]Ron Banner, Ariel Orda:
Bottleneck Routing Games in Communication Networks. IEEE J. Sel. Areas Commun. 25(6): 1173-1179 (2007) - [j45]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25(6): 1193-1206 (2007) - [j44]Ron Banner, Ariel Orda:
Multipath routing algorithms for congestion minimization. IEEE/ACM Trans. Netw. 15(2): 413-424 (2007) - [j43]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) - [c49]Alexander Sprintson, Marcelo Yannuzzi, Ariel Orda, Xavier Masip-Bruin:
Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks. INFOCOM 2007: 1820-1828 - [c48]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc 2007: 160-169 - 2006
- [j42]Marcelo Yannuzzi, Xavier Masip-Bruin, Sergio Sánchez-López, Jordi Domingo-Pascual, Ariel Orda, Alex Sprintson:
On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains. IEEE Commun. Mag. 44(12): 60-66 (2006) - [j41]Dean H. Lorenz, Ariel Orda, Danny Raz, Yuval Shavitt:
Efficient QoS partition and routing of unicast and multicast. IEEE/ACM Trans. Netw. 14(6): 1336-1347 (2006) - [j40]Lavy Libman, Ariel Orda:
Optimal packet-level fec strategies in connections with large delay-bandwidth products. IEEE Trans. Wirel. Commun. 5(7): 1645-1650 (2006) - [c47]Eva Marín-Tordera, Xavier Masip-Bruin, Sergio Sánchez-López, Jordi Domingo-Pascual, Ariel Orda:
The Prediction Approach in QoS Routing. ICC 2006: 1020-1025 - [c46]Ron Banner, Ariel Orda:
Bottleneck Routing Games in Communication Networks. INFOCOM 2006 - [c45]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 - [c44]Idit Keidar, Roie Melamed, Ariel Orda:
EquiCast: scalable multicast with selfish users. PODC 2006: 63-71 - [c43]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative multicast and facility location games. EC 2006: 72-81 - 2005
- [j39]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) - [j38]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) - [c42]Ariel Orda, Ben-Ami Yassour:
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. MobiHoc 2005: 426-437 - [c41]Ron Banner, Ariel Orda:
Multipath Routing Algorithms for Congestion Minimization. NETWORKING 2005: 536-548 - [c40]Ariel Orda:
QoS Routing: Challenges and Solution Approaches. QSHINE 2005 - 2004
- [j37]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Admission Control in Networks with Advance Reservations. Algorithmica 40(4): 293-304 (2004) - [j36]Lavy Libman, Ariel Orda:
Optimal sliding-window strategies in networks with long round-trip delays. Comput. Networks 46(2): 219-235 (2004) - [c39]Lavy Libman, Ariel Orda:
Optimal FEC strategies in connections with large delay-bandwidth products. ICC 2004: 3942-3946 - [c38]Ron Banner, Ariel Orda:
The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks. ICNP 2004: 2-11 - [c37]David Lee, Lavy Libman, Ariel Orda:
Path Protection and Blocking Probability Minimization in Optical Networks. INFOCOM 2004 - [c36]Ariel Orda, Alexander Sprintson:
Efficient Algorithms for Computing Disjoint QoS Paths. INFOCOM 2004 - [c35]Erez Biton, Ariel Orda:
QoS Provision and Routing with Stochastic Guarantees. QSHINE 2004: 112-119 - 2003
- [j35]Ariel Orda, Alexander Sprintson:
Precomputation schemes for QoS routing. IEEE/ACM Trans. Netw. 11(4): 578-591 (2003) - [c34]Dean H. Lorenz, Ariel Orda, Danny Raz:
Optimal Partition of QoS Requirements for Many-to-Many Connections. INFOCOM 2003: 1670-1679 - [c33]Lavy Libman, Ariel Orda:
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays. INFOCOM 2003: 2057-2067 - 2002
- [j34]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) - [j33]Lavy Libman, Ariel Orda:
Optimal retrial and timeout strategies for accessing network resources. IEEE/ACM Trans. Netw. 10(4): 551-564 (2002) - [j32]Roch Guérin, Ariel Orda:
Computing shortest paths for any number of hops. IEEE/ACM Trans. Netw. 10(5): 613-620 (2002) - [c32]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Routing and Admission Control in Networks with Advance Reservations. APPROX 2002: 215-228 - [c31]Ariel Orda, Alexander Sprintson:
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast. INFOCOM 2002: 685-694 - 2001
- [j31]Lavy Libman, Ariel Orda:
Atomic Resource Sharing in Noncooperative Networks. Telecommun. Syst. 17(4): 385-409 (2001) - 2000
- [j30]Joseph Naor, Ariel Orda, Yael Petruschka:
Dynamic storage allocation with known durations. Discret. Appl. Math. 100(3): 203-213 (2000) - [j29]Mehmet Karaul, Yannis A. Korilis, Ariel Orda:
A market-based architecture for management of geographically dispersed, replicated Web servers. Decis. Support Syst. 28(1-2): 191-204 (2000) - [j28]Israel Ben-Shahar, Ariel Orda, Nahum Shimkin:
Dynamic service sharing with heterogeneous preferences. Queueing Syst. Theory Appl. 35(1-4): 83-103 (2000) - [j27]Eitan Altman, Ariel Orda, Nahum Shimkin:
Bandwidth allocation for guaranteed versus best effort service categories. Queueing Syst. Theory Appl. 36(1-3): 89-105 (2000) - [j26]Ariel Orda, Nahum Shimkin:
Incentive pricing in multiclass systems. Telecommun. Syst. 13(2-4): 241-267 (2000) - [c30]Roch Guérin, Ariel Orda:
Networks with Advance Reservations: The Routing Perspective. INFOCOM 2000: 118-127 - [c29]Ariel Orda, Alexander Sprintson:
QoS Routing: The Precomputation Perspective. INFOCOM 2000: 128-136
1990 – 1999
- 1999
- [j25]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
Modelling Asynchrony with a Synchronous Model. Formal Methods Syst. Des. 15(3): 175-199 (1999) - [j24]George Apostolopoulos, Roch Guérin, Sanjay Kamat, Ariel Orda, Satish K. Tripathi:
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis. IEEE Netw. 13(5): 42-54 (1999) - [j23]Roch Guérin, Ariel Orda:
QoS routing in networks with inaccurate information: theory and algorithms. IEEE/ACM Trans. Netw. 7(3): 350-364 (1999) - [j22]Ariel Orda:
Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Trans. Netw. 7(3): 365-374 (1999) - [j21]Lavy Libman, Ariel Orda:
The designer's perspective to atomic noncooperative networks. IEEE/ACM Trans. Netw. 7(6): 875-884 (1999) - [c28]Dean H. Lorenz, Ariel Orda:
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees. INFOCOM 1999: 246-253 - [c27]Israel Ben-Shahar, Ariel Orda, Nahum Shimkin:
Best-Effort Resource Sharing by Users with QoS Requirements. INFOCOM 1999: 883-890 - [c26]Yannis A. Korilis, Ariel Orda:
Incentive Compatible Pricing Strategies for QoS Routing. INFOCOM 1999: 891-899 - [i1]George Apostolopoulos, Sanjay Kamat, Doug Williams, Roch Guérin, Ariel Orda, Tony Przygienda:
QoS Routing Mechanisms and OSPF Extensions. RFC 2676: 1-50 (1999) - 1998
- [j20]Joseph Naor, Ariel Orda, Raphael Rom:
Scheduled Hot-Potato Routing. J. Graph Algorithms Appl. 2(4): 1-20 (1998) - [j19]Dean H. Lorenz, Ariel Orda:
QoS routing in networks with uncertain parameters. IEEE/ACM Trans. Netw. 6(6): 768-778 (1998) - [c25]Mehmet Karaul, Yannis A. Korilis, Ariel Orda:
A market-based architecture for management of geographically dispersed, replicated Web servers. ICE 1998: 158-165 - [c24]Dean H. Lorenz, Ariel Orda:
QoS Routing in Networks with Uncertain Parameters. INFOCOM 1998: 3-10 - [c23]Ariel Orda:
Routing with End to End QoS Guarantees in Broadband Networks. INFOCOM 1998: 27-34 - [c22]Eitan Altman, Ariel Orda, Nahum Shimkin:
Bandwidth Allocation for Guaranteed versus Best Effort Service Categories. INFOCOM 1998: 617-624 - 1997
- [j18]Michael Merritt, Ariel Orda, Sonia R. Sachs:
Formal Verification of a Distributed Computer System. Formal Methods Syst. Des. 10(1): 93-125 (1997) - [j17]Ariel Orda, Michael Merritt:
Efficient Test & Set Constructions for Faulty Shared Memory. Inf. Process. Lett. 62(1): 41-46 (1997) - [j16]Ariel Orda, Raphael Rom:
Optimal packet fragmentation and routing in computer networks. Networks 29(1): 11-28 (1997) - [j15]Yannis A. Korilis, Aurel A. Lazar, Ariel Orda:
Capacity allocation under noncooperative routing. IEEE Trans. Autom. Control. 42(3): 309-325 (1997) - [j14]Yannis A. Korilis, Aurel A. Lazar, Ariel Orda:
Achieving network optima using Stackelberg routing strategies. IEEE/ACM Trans. Netw. 5(1): 161-173 (1997) - [j13]Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis:
Virtual path bandwidth allocation in multiuser networks. IEEE/ACM Trans. Netw. 5(6): 861-871 (1997) - [c21]Joseph Naor, Ariel Orda, Yael Petruschka:
Dynamic Storage Allocation with Known Durations. ESA 1997: 378-387 - [c20]Roch Guérin, Ariel Orda:
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms. INFOCOM 1997: 75-83 - [c19]Ariel Orda, Nahum Shimkin:
Incentive Pricing in Multi-Class Communication Networks. INFOCOM 1997: 659-666 - [c18]Lavy Libman, Ariel Orda:
Atomic Resource Sharing in Noncooperative Networks. INFOCOM 1997: 1006-1013 - 1996
- [j12]Ariel Orda, Raphael Rom:
Distributed Shortest-Path Protocols for Time-Dependent Networks. Distributed Comput. 10(1): 49-62 (1996) - [j11]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SIAM J. Discret. Math. 9(1): 155-166 (1996) - [c17]Ariel Orda, Giovanni Pacifici, Dimitrios E. Pendarakis:
An Adaptive Virtual Path Allocation Policy for Broadband Networks. INFOCOM 1996: 329-336 - [c16]Yannis A. Korilis, Aurel A. Lazar, Ariel Orda:
The Role of the Manager in a Noncooperative Network. INFOCOM 1996: 1285-1293 - 1995
- [j10]Yannis A. Korilis, Aurel A. Lazar, Ariel Orda:
Architecting Noncooperative Networks. IEEE J. Sel. Areas Commun. 13(7): 1241-1251 (1995) - [j9]Ariel Orda, Raphael Rom:
On continuous network flows. Oper. Res. Lett. 17(1): 27-36 (1995) - [c15]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
Modelling Asynchrony with a Synchronous Model. CAV 1995: 339-352 - [c14]Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendarakis:
Virtual Path Bandwidth Allocation in Multi-User Networks. INFOCOM 1995: 312-320 - [c13]Yannis A. Korilis, Aurel A. Lazar, Ariel Orda:
The Designer's Perspective to Noncooperative Networks. INFOCOM 1995: 562-570 - [c12]Joseph Naor, Ariel Orda, Raphael Rom:
Scheduled Hot-Potato Routing. INFOCOM 1995: 579-586 - 1994
- [j8]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
A Structural Linearization Principle for Processes. Formal Methods Syst. Des. 5(3): 227-244 (1994) - [c11]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SODA 1994: 724-732 - 1993
- [j7]Ariel Orda, Raphael Rom, Moshe Sidi:
Minimum delay routing in stochastic networks. IEEE/ACM Trans. Netw. 1(2): 187-198 (1993) - [j6]Ariel Orda, Raphael Rom, Nahum Shimkin:
Competitive routing in multiuser communication networks. IEEE/ACM Trans. Netw. 1(5): 510-521 (1993) - [c10]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
A Structural Linearization Principle for Processes. CAV 1993: 491-504 - [c9]Ariel Orda, Raphael Rom:
Optimal Routing with Packet Fragmentation in Computer Networks. INFOCOM 1993: 602-609 - [c8]Ariel Orda, Raphael Rom, Nahum Shimkin:
Competitive Routing in Multi-User Communication Networks. INFOCOM 1993: 964-971 - 1992
- [c7]Ariel Orda, Moshe Sidi, Raphael Rom:
Minimum Delay Routing in Stochastic Networks. INFOCOM 1992: 608-616 - 1991
- [j5]Ariel Orda, Raphael Rom:
Minimum weight paths in time-dependent networks. Networks 21(3): 295-319 (1991) - [j4]Ariel Orda, Raphael Rom:
Location of central nodes in time varying computer networks. Oper. Res. Lett. 10(3): 143-152 (1991) - 1990
- [j3]Ariel Orda, Raphael Rom:
Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length. J. ACM 37(3): 607-625 (1990)
1980 – 1989
- 1989
- [j2]Ariel Orda, Raphael Rom:
Multihoming in Computer Networks: A Topology-Design Approach. Comput. Networks ISDN Syst. 18(2): 133-141 (1989) - [c6]Ariel Orda, Raphael Rom:
Location of Central Nodes in Time Varying Computer Networks. INFOCOM 1989: 193-199 - 1988
- [j1]Ariel Orda, Raphael Rom:
Routing with packet duplication and elimination in computer networks. IEEE Trans. Commun. 36(7): 860-866 (1988) - [c5]Ariel Orda, Raphael Rom:
Distributed shortest-path protocols for time-dependent networks. ICCC 1988: 439-445 - [c4]Ariel Orda, Raphael Rom:
Shortest-path algorithms for time-dependent networks. INFOCOM 1988: 282-287 - [c3]Ariel Orda, Raphael Rom:
Multihoming in computer networks: a topology-design approach. INFOCOM 1988: 941-945 - 1986
- [c2]Ariel Orda, Raphael Rom:
Packet Duplication and Elimination in Distributed Networks. ICCC 1986: 666-669 - [c1]Ariel Orda, Raphael Rom:
Packet Duplication and Elimination in Distributed Networks. ICDCS 1986: 401-404
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint