netEmbed: a service for embedding distributed applications

ABSTRACT

An increased number of applications, such as computational grids, testbeds, peer-to-peer networks, and sensor networks (among many others) rely on finding a set of resources that meet certain criteria for their operation. In particular, in many of these cases their requirements may be described as a labeled graph where nodes represent computational resources and links represent connectivity/communication requirements. Similarly, the infrastructure where the service will be deployed is also described by a labeled graph, where the attributes of nodes and links represent their capabilities. The problem of finding a feasible set of links and nodes on which to deploy the service is what we call the embedding problem.

REFERENCES

• 1: C. Alfeld, J. Lepreau, and R. Ricci. A solver for the network testbed mapping problem. SIGCOMM Comput. Commun. Rev., 33(2):65--81, 2003.
• 2: U. Brandes, M. Eiglsperger, I. Herman, M. Himsolt, and M. Marshall. GraphML progress report: Structural layer proposal. In Springer-Verlag, editor, Proc. 9th Intl. Symp. Graph Drawing (GD '01), LNCS 2265, pages 501--512, 2001.
• 3: J. Considine, J. W. Byers, and K. Mayer-patel. A constraint satisfaction approach to testbed embedding services. In Proceedings of HotNets-II, November 2003.
• 4: C. Liu and I. Foster. A constraint language approach to matchmaking. 14th International Workshop on Research Issues on Data Engineering: Web Services for E-Commerce and E-Government Applications (RIDE'04), 00:7--14, 2004.
• 5: J. Londoño and A. Bestavros. netembed: A network resource mapping service for distributed applications. Technical Report 2006--32, Boston University, Boston, MA, December 2006.
• 6: D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat. Design and implementation tradeoffs for wide-area resource discovery. In 14th IEEE Symposium on High Performance Distributed Computing (HPDC-14), July 2005.
• 7: R. Raman, M. Livny, and M. Solomon. Policy driven heterogeneous resource co-allocation with gangmatching. In International Symposium on High Performance Distributed Computing (HPDC03), pages 80--89, June 2003.
• 8: B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An integrated experimental environment for distributed systems and networks. In Proc. of the Fifth Symposium on Operating Systems Design and Implementation, pages 255--270, Boston, MA, Dec. 2002. USENIX Association.