#### ESON: A Model-Driven and Fault Tolerant Composite Deployment Runtime for IaaS Clouds�

D. Jayasinghe, C. Pu, F. Oliveira, F. Rosenberg, T. Eilam

*Proceedings of the 10th International Conference on Services Computing (SCC’13)*, 2013

#### Testing Idempotence for Infrastructure as Code

W. Hummer, F. Rosenberg, F. Oliveira, T. Eilam

*Proceedings of the 14th ACM/IFIP/USENIX International Middleware Conference (Middleware’13)*, 2013

#### Semantically Rich Composition of Virtual Images

F. Oliveira, T. Eilam. M. Kalantar, F. Rosenberg

*IEEE 5th International Conference on Cloud Computing (CLOUD 2012)*

#### Improving Service Performance and Availability on Clouds with Structural Constraint-aware Virtual Machine Placement.

Deepal Jayasinghe, Tamar Eilam, Malgorzata Steinder, Ian Whally, Ed Snible and Calton Pu.

*IEEE International Conference on Service Computing (SCC11)*, 2011

#### Pattern Based Composite Application Deployment

Tamar Eilam, Alexander Konstantinou, Michael Elder, Ed Snible

*IFIP/IEEE International Symposium on Integrated Network Management (IM 2011)*

#### An Architecture for Virtual Solution Composition and Deployment in Infrastructure Clouds

A. Konstantinou, T. Eilam, M. Kalantar, A. Totok, W. Arnold, E. Snible

*Virtualization Technologies in Distributed Computing (VTDC 2009)*

#### Automatic Realization of SOA Deployment Patterns in Distributed Environments

W Arnold, T Eilam, M Kalantar, A Konstantinou, A Totok

*Service-Oriented Computing–ICSOC 2008*, 162–179, Springer

#### Average stretch analysis of compact routing schemes

T Eilam, C Gavoille, D Peleg

Discrete Applied Mathematics, 2007 – Elsevier

#### Pattern based SOA deployment

W Arnold, T Eilam, M Kalantar, A Konstantinou, A Totok

*Service-Oriented Computing–ICSOC 2007*, 1–12, Springer

#### Model driven provisioning: Bridging the gap between declarative object models and procedural …

Maghraoui, A Meghranjani, T Eilam, M Kalantar, AV …

Proceedings of the ACM/IFIP/USENIX 2006 International …, 2006 – portal.acm.org

#### Managing the Configuration Complexity of Distributed Applications in Internet Data Centers

Tamar Eilam, Michael Kalantar, Alexander Konstantinou, Giovanni Pacifici, John Pershing, Aditya Agrawal

*IEEE Communications Magazine* *44*(*3*), 166–177, 2006

#### Model-Based Automation of Service Deployment in a Constrained Environment

Tamar Eilam, Michael Kalantar, Alexander Konstantinou, Giovanni Pacifici

*Proceedings of the IFIP/IEEE International Symposium on Integrated NetwOPerformance Evaluationrations Researchk Management*, Citeseer, 2005

#### Reducing the complexity of application deployment in large data centers

T Eilam, M H Kalantar, A V Konstantinou, G Pacifici

*9th IFIP/IEEE International Symposium on Integrated Network Management*, *pp. 221–234*, 2005

#### Using a utility computing framework to develop utility systems

T Eilam, K Appleby, J Breh, G Breiter, H Daur, SA …

IBM Systems Journal, 2004 – research.ibm.com

#### Compact Routing Schemes with Low Stretch Factor

David Peleg, Cyril Gavoille, Tamar Eilam

Journal on Algorithms, 46(2), pp. 97-114, 2003

#### The Complexity of the Characterization of Networks Supporting Shortest-Path Interval Routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks

Theoretical Computer Science 289(1): 85-104, 2002

#### Lightpath arrangement in survivable rings to minimize the switching cost

T Eilam, S Moran, S Zaks

IEEE Journal on Selected Areas in Communications, 2002 – cs.technion.ac.il

#### Neptune: A dynamic resource allocation and planning system for a cluster computing utility

D P Pazel, T Eilam, L L Fong, M Kalantar, K Appleby, G Goldszmidt

*ccgrid*, *pp. 57*, 2002

#### On the Total_k-Diameter of Connection Networks

Tamar Eilam, YE Dinitz, Shlomo Moran, Shmuel Zaks

Theoretical Computer Science 247(1-2) pp. 213-228, 2000

#### Approximation algorithms for survivable optical networks

T Eilam, S Moran, S Zaks

Distributed Computing: 14th International Conference, DISC …, 2000 – books.google.com

#### Speculative field level caching in distributed object-based systems

Y Aridor, M Factor, A Teperman, T Eilam, A …

Technical report, IBM Research Laboratory in Haifa, 2000

#### A high performance cluster JVM presenting a pure single system image

Y Aridor, M Factor, A Teperman, T Eilam, A …

Proceedings of the ACM 2000 conference on Java Grande, 2000 – portal.acm.org

#### Transparently Obtaining Scalability for Java Applications on a Cluster

Y Aridor, M Factor, A Teperman, T Eilam, A …

Journal of Parallel and Distributed Computing, 2000 – ingentaconnect.com

#### A Lower Bound for Linear Interval Routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks

Networks 34: 37 � 46, 1999

#### Compact Routing Schemes with Low Stretch Factor

Tamar Eilam, C. Gavoille, D. Peleg

Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998

#### A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load

Tamar Eilam, M. Flammini, Shlomo Moran, Shmuel Zaks

Parallel Processing Letters, Vol. 8 No. 2, pp. 207-220, 1998

#### The Total_k-Diameter of Connection Networks

YE Dinitz, Tamar Eilam, S. Moran, S. Zaks

5th Israel Symposium on the Theory of Computing and Systems (ISTCS), 1997

#### A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load

Tamar Eilam, M. Flammini, S. Zaks

24th International Colloquium on Automata, Languages and Programming (ICALP), 1997

#### A Simple DFS-Based Algorithm for Linear Interval Routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks

11th International Workshop Distributed Algorithms (WDAG), 1997

#### The Complexity of the Characterization of Networks Supporting Shortest-Path Interval Routing

Tamar Eilam, Shlomo Moran, Shmuel Zaks

4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1997

#### A Lower Bound for Linear Interval Routing

Tamar Eilam, S. Moran, S. Zaks

Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), 1996

#### Greedy Hot-Potato Routing Algorithms for the Two-Dimensional Mesh

I. Ben

Aroya, Tamar Eilam, A. Schuster – Distributed Computing, Vol. 9, No. 1, pp. 3-19, 1995