Abstract
The Network Testbed Mapping Problem is the problem of mapping an emulated network into a test cluster such as Emulab or DETER. In this paper, we demonstrate that the Network Testbed Mapping Problem is \({\mathcal NP}\)-complete when there is constrained bandwidth between cluster switches. We demonstrate that the problem is trivial when bandwidth is unconstrained, and note that a number of new proposals for data center networking have removed this barrier. Finally, we consider new heuristics in the bandwidth-limited case.
This research partially supported by the Defense Advanced Reseach Projects Agency under DARPA Subcontract 09-2080 for DARPA National Cyber Range Phase I - Prime Contract HR0011- 09-C-0039. Approved for Public Release, Distribution Unlimited. The views, opinions, and/or findings contained in this article are those of the authors and should not be interpreted as representing the official views or policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the Department of Defense.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The deter testbed: Overview, http://www.isi.edu/deter/docs/testbed.overview.htm
al Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity datacenter architecture. In: Proc. SIGCOMM (2008)
Duerig, J., Ricci, R., Byers, J., Lepreau, J.: Automatic ip address assignment on network topologies. Technical Report Flux Technical Note FTN-2006-02, University of Utah (2006)
Emulab. Emulab topology diagram, http://www.emulab.net/doc/topo.pdf
Fidducia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proc. 19th Design Automation Conference, pp. 175–181 (1982)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co Ltd., New York (January 1979)
Gupta, D., Vishwanath, K.V., Vahdat, A.: Diecast: testing distributed systems with an accurate scale model. In: NSDI 2008: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation, pp. 407–422. USENIX Association, Berkeley (2008)
Hibler, M., Ricci, R., Stoller, L., Duerig, J., Guruprasad, S., Stack, T., Webb, K., Lepreau, J.: Large-scale virtualization in the emulab network testbed. In: Usenix (2008)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49, 291–307 (1970)
Lepreau, J.: Emulab network emulation testbed, http://www.emulab.net
Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures (VISA) (August. 2009)
Ricci, R., Alfeld, C., Lepreau, J.: A solver for the network testbed mapping problem. Computer Communications Review (2003)
Scott, M., Moore, A., Crowcroft, J.: Addressing the scalability of ethernet with moose. In: First Workshop on Data Center - Converged and Virtual Ethernet Switching (DC-CAVES), ITC 21 (2009)
Sorkin, G.B.: Efficient simulated annealing on fractal energy landscapes. Algorithmica 6, 367–418 (1991)
Srinivasan, A.: Approximation algorithms via randomized rounding: A survey. Series in Advanced Topics in Mathematics, pp. 9–71. Polish Scientific Publishers PWN (1999)
Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtualnetwork embedding: Substrate support for path splitting and migration. ACM SIGCOMM Computer Communications Review 38(2) (April 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
McGeer, R., Andersen, D.G., Schwab, S. (2011). The Network Testbed Mapping Problem. In: Magedanz, T., Gavras, A., Thanh, N.H., Chase, J.S. (eds) Testbeds and Research Infrastructures. Development of Networks and Communities. TridentCom 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17851-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-17851-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17850-4
Online ISBN: 978-3-642-17851-1
eBook Packages: Computer ScienceComputer Science (R0)