Journal Publications
  1. A. Orda and R. Rom, Routing with Packet Duplication and Elimination in Computer Networks, IEEE Transactions on Communications, Vol. COM-36, pp. 860-866, July 1988.

  2. A. Orda and R. Rom, Multihoming in Computer Networks - a Topology Design Approach, Computer Networks and ISDN Systems, Vol. 18, pp. 133-141, February 1990.

  3. A. Orda and R. Rom, Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length, Journal of the ACM, Vol. 37, pp. 607-625, July 1990.

  4. A. Orda and R. Rom, Location of Central Nodes in Time-Varying Computer Networks, Operations Research Letters, Vol. 10, pp. 143-152, April 1991.

  5. A. Orda and R. Rom, Minimum-Weight Paths in Time-Dependent Networks, Networks, Vol. 21, pp. 295-319, May 1991.

  6. A. Orda, R. Rom and M. Sidi, Minimum-Delay Routing in Stochastic Networks, IEEE/ACM Transactions on Networking, Vol. 1, pp. 187-198, April 1993. (Fast-tracked from INFOCOM'92.)

  7. A. Orda, R. Rom and N. Shimkin, Competitive Routing in Multi-User Environments, IEEE/ACM Transactions on Networking, Vol. 1, pp. 510-521, October 1993.

  8. R. P. Kurshan, M. Merritt, A. Orda and S. R. Sachs, A Structural Linearization Principle for Processes, Formal Methods in System Design, Vol. 5, pp. 227-244, 1994.

  9. A. Orda and R. Rom, On Continuous Network Flows, Operations Research Letters, Vol. 17, pp. 27-36, February 1995.

  10. Y. A. Korilis, A. A. Lazar and A. Orda, Architecting Noncooperative Networks, IEEE Journal on Selected Areas in Communication (Special Issue on Advances in the Fundamentals of Networking), Vol. 13, no. 7, pp. 1241-1251, September 1995.

  11. M. G. Luby, J. Naor and A. Orda, Tight Bounds for Dynamic Storage Allocation, SIAM Journal on Discrete Mathematics, Vol. 9, pp. 155-166, 1996.

  12. A. Orda and R. Rom, Distributed Shortest-Path and Minimum-Delay Protocols in Networks with Time-Dependent Edge-Length, Distributed Computing, Vol. 10, pp. 49-62, 1996.

  13. A. Orda and R. Rom, Optimal Packet Fragmentation-and-Routing in Computer Networks, Networks, Vol. 29, pp. 11-28, January 1997.

  14. Y. A. Korilis, A. A. Lazar and A. Orda, Achieving Network Optima Using Stackelberg Routing Strategies, IEEE/ACM Transactions on Networking, Vol. 5, No. 1, pp. 161-173, February 1997.

  15. M. Merritt, A. Orda and S. R. Sachs, Formal Verification of a Distributed Algorithm for Accessing Faulty Shared Memory, Formal Methods in System Design, Vol. 10, No. 1, pp. 93-125, February 1997.

  16. Y. A. Korilis, A. A. Lazar and A. Orda, Capacity Allocation Under Noncooperative Routing, IEEE Transactions on Automatic Control, Vol. 42, No. 3, pp. 309-325, March 1997.

  17. A. Orda and M. Merritt, Efficient Test&Set Constructions for Faulty Shared Memory', Information Processing Letters, Vol. 62, No. 1, pp. 41-46, April 1997.

  18. A. A. Lazar, A. Orda and D. E. Pendarakis, Virtual Path Bandwidth Allocation in Multi-User Networks, IEEE/ACM Transactions on Networking, Vol. 5, No. 6, pp. 861-871, December 1997.

  19. 19. J. Naor, A. Orda and R. Rom, Scheduled Hot-Potato Routing, Journal of Graph Algorithms and Applications, Vol. 2, No. 4, pp. 1-20, 1998.

  20. D. H. Lorenz and A. Orda, QoS Routing in Networks with Uncertain Parameters, IEEE/ ACM Transactions on Networking, Vol. 6, No. 6, pp. 768-778, December 1998. (Fast-tracked from INFOCOM'98.)

  21. Y. A. Korilis, A. A. Lazar and A. Orda, Avoiding Design Paradoxes in Noncooperative Networks, Journal of Applied Probability, Vol. 36, No. 1, pp. 211-222, 1999.

  22. R. Guerin and A. Orda, QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms, IEEE/ACM Transactions on Networking, Vol. 7, No. 3, pp. 350-364, June 1999.

  23. A. Orda, Routing with End to End QoS Guarantees in Broadband Networks, IEEE/ACM Transactions on Networking, Vol. 7, No. 3, pp. 365-374, June 1999.

  24. G. Apostolopoulos, R. Guerin, S. Kamat, A. Orda and S. K. Tripathi, Intra-Domain QoS Routing in IP Networks: A Feasibility and Cost/Benefit Analysis, IEEE Network (Special Issue on Integrated and Differentiated Services for the Internet), Vol. 13, No. 5, pp. 42-54, September/October 1999.

  25. R. P. Kurshan, M. Merritt, A. Orda and S. R. Sachs, Modelling Asynchrony with a Synchronous Model, Formal Methods in System Design, Vol. 15, No. 3, pp. 175-200, November 1999.

  26. L. Libman and A. Orda, The Designer's Perspective to Atomic Noncooperative Networks, IEEE/ACM Transactions on Networking, Vol. 7, No. 6, pp. 875-884, December 1999.

  27. J. Naor, A. Orda and Y. Petruschka, Dynamic storage allocation with known durations, Discrete Applied Mathematics, Vol. 100, pp. 203-213, 2000.

  28. M. Karaul, Y. A. Korilis and A. Orda, A Market-Based Architecture for Management of Geographically Dispersed, Replicated Web Servers, Decision Support Systems, Vol. 28, No. 1-2, pp. 191-204, 2000.

  29. A. Orda and N. Shimkin, Incentive Pricing in Multi-Class Systems, Telecommunication Systems, Vol. 13, No. 2-4, pp. 241-267, 2000.

  30. I. Ben-Shahar, A. Orda and N. Shimkin, Dynamic Service Sharing with Heterogeneous Preferences, Queuing Systems - Theory and Applications, Vol. 35, No. 1-4, pp. 83-103, 2000.

  31. E. Altman, A. Orda and N. Shimkin, Bandwidth Allocation for Guaranteed versus Best Effort Service Categories, Queuing Systems - Theory and Applications, Vol. 36, pp. 89-105, 2000.

  32. L. Libman and A. Orda, Atomic Resource Sharing in Noncooperative Networks, Telecommunication Systems, Vol. 17, No. 4, pp. 385-409, 2001.

  33. D. H. Lorenz and A. Orda, Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees, IEEE/ACM Transactions on Networking, Vol. 10, No. 1, pp. 102-114, 2002.

  34. L. Libman and A. Orda, Optimal Retrial and Timeout Strategies for Accessing Network Resources, IEEE/ACM Transactions on Networking, Vol. 10, No. 4, pp. 551-564, 2002.

  35. R. Guerin and A. Orda, Computing Shortest Paths for Any Number of Hops, IEEE/ACM Transactions on Networking, Vol. 10, No. 5, pp. 613-620, 2002.

  36. A. Orda and A. Sprintson, Precomputation Schemes for QoS Routing, IEEE/ACM Transactions on Networking, Vol. 11, No. 4, pp. 578-591, 2003.

  37. Y. A. Korilis and A. Orda, Incentive-Compatible Pricing Strategies for QoS Routing, Networks and Spatial Economics (special issue on Crossovers between Transportation Planning and Telecommunications), Vol. 4, No. 1, pp. 39-53, 2004. (Invited paper.)

  38. L. Lewin-Eytan, J. Naor and A. Orda, Admission Control in Networks with Advance Reservation, Algorithmica (special issue on Approximation and On-Line Algorithms), Vol. 40, No. 4, pp. 293-304, 2004.

  39. L. Libman and A. Orda, Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays, Journal of Computer Networks, Vol. 46, No. 2, pp. 219-235, 2004.

  40. Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi and A. Sprintson, Algorithms for Computing QoS Paths with Restoration, IEEE/ACM Transactions on Networking, vol. 13, pp.648-661, 2005.

  41. A. Orda and A. Sprintson, A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast, IEEE/ACM Transactions on Networking, vol. 13, no. 5, October 2005.

  42. L. Libman and A. Orda, Optimal Packet-Level FEC Strategies in Connections with Large Delay-Bandwidth Products, IEEE Transactions on Wireless Communications, vol. 5, no. 7, July 2006 .

  43. M. Yannuzzi, X. Masip-Bruin, S. Sanchez, J. Domingo-Pascual, A. Orda and A. Sprintson, On the Challenges of Establishing Disjoint QoS IP/MPLS paths across multiple domains, IEEE Communications Magazine (Special Issue on Advances in Control and Management of Connection Oriented Networks), vol. 44, no. 12, December 2006.

  44. D. H. Lorenz, A. Orda, D. Raz and Y. Shavitt, Efficient QoS Partition and Routing of Unicast and Multicast, IEEE/ACM Transactions on Networking, vol. 14, no. 6, pp. 1336-1347, 2006.

  45. R. Banner and A. Orda, Multipath Routing Algorithms for Congestion Minimization, IEEE/ACM Transactions on Networking, vol. 15, no. 2, pp. 413-424, 2007.

  46. R. Banner and A. Orda, The Power of Tuning: a Novel Approach for the Efficient Design of Survivable Networks, IEEE/ACM Transactions on Networking, vol. 15, no. 4, pp. 737-749, 2007.

  47. R. Banner and A. Orda, Bottleneck Routing Games in Communication Networks, IEEE Journal on Selected Areas in Communication (Special Issue on Non-Cooperative Behavior in Networking), vol. 25, no. 6, pp. 1173-1179, 2007. (Invited paper.)

  48. C. Chekuri, J. Chuzhoy, L. Lewin-Eytan, J. Naor and A. Orda, Non-Cooperative Multicast and Facility Location Games, IEEE Journal on Selected Areas in Communication (Special Issue on Non-Cooperative Behavior in Networking), vol. 25, no. 6, pp. 1193-1206, 2007. (Invited paper.)

  49. M. Yannuzzi, X. Masip-Bruin, G. Fabrego ,S. Sanchez-Lopez, A. Sprintson and A. Orda, Towards a New Route Control Model for Multi-Domain Optical Networks, IEEE Communications Magazine (Multi-Domain Optical Networks: Issues and Challenges), vol. 46, no. 6, 2008.

  50. I. Keidar, R. Melamed and A. Orda, EquiCast: Scalable Multicast with Selfish Users, Computer Networks (special issue on Gossiping in Distributed Systems), Vol. 53, no. 13, 2009.

  51. N. Buchbinder, L. Lewin-Eytan, J. Naor and A. Orda, Non-cooperative Cost Sharing Games via Subsidies, Theory of Computing Systems (special issue dedicated to the SAGT'08 best papers), Vol. 47, no. 1, 2010. (Invited paper.)

  52. N. Buchbinder, L. Lewin-Eytan, I. Menache, J. naor and A. Orda, Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach, IEEE/ACM Transactions on Networking, vol. 20, no. 2, pp. 477-487, 2012.

  53. A. Nahir, A, A. Orda, and A. Freund, Topology Design of Communication Networks: A Game-Theoretic Perspective, IEEE/ACM Transactions on Networking, vol. 22, no. 2, 2014.