A solver for the network testbed mapping problem

Computer Communication Review

Volumn 33, Issue 2, 2003, Pages 65-81

  Ricci, Robert ^a   Alfeld, Chris ^b   Lepreau, Jay ^a  

^a University of Utah   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED SIMULATION; MAPPING PROBLEM; NETWORK TESTBED; VIRTUAL RESOURCES;

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SIMULATION; CONSTRAINT THEORY; MAPPING; PROBLEM SOLVING; ROUTERS; VIRTUAL REALITY;

NETWORK PROTOCOLS;

EID: 33645783000     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/956981.956988     Document Type: Article

References (24)

1. E. H. L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, 1989.
2. D. G. Andersen. Theoretical Approaches To Node Assignment, December 2002. Unpublished Manuscript. http://nms.lcs.mit.edu/papers/andersen-assign.ps.
3. Boost C++ Libraries, http://www.boost.org/.
4. A. Boukerche and C. Tropper. A Static Partitioning and Mapping Algorithm for Conservative Parallel Simulations. In Proc. of the Eighth Workshop on Parallel and Distributed Simulation. ACM Press, 1994.
5. L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy, P. Huang, S. McCanne, K. Varadhan, Y. Xu, and H. Yu. Advances in Network Simulation. IEEE Computer, 33(5):59-67, May 2000. (An expanded version is available as USC CSD TR 99-702b.).
6. K. Fall. Network Emulation in the Vint/NS Simulator. In Proc. of the 4th IEEE Symposium on Computers and Communications, 1999.
7. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
8. B. Hendrickson and R. Leland. An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations. SIAM Journal on Scientific Computing, 16(2):452-469, 1995.
9. E. Johnson and A. Kunze. IXP1200 Programming. Intel Press, 2002.
10. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998.
11. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671-680, 1983.
12. A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener. Algorithms for Provisioning Virtual Private Networks in the Hose Model. In Proc. of SIGCOMM 2001. ACM Press, August 2001.
13. O. C. Martin and S. W. Otto. Combining Simulated Annealing with Local Search Heuristics. Annals of Operations Research, 63:57-75, 1996.
14. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An Approach to Universal Topology Generation. In Proc. of MASCOTS 2001, Cincinnati, Ohio, August 2001.
15. B. Monien and H. Sudborough. Embedding One Interconnection Network in Another, pages 257-282. Springer-Verlag/Wien, 1990. Computing Suppleraentum 7: Computational Graph Theory.
16. L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A Blueprint for Introducing Disruptive Technology into the Internet. In Proc. of HotNets-I, Princeton, NJ, Oct. 2002.
17. G. F. Riley, R. M. Fujimoto, and M. H. Amman A Generic Framework for Parallelization of Network Simulations. In Proc. of MASCOTS 1999, October 1999.
18. A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostić, J. Chase, and D. Becker. Scalability and Accuracy in a Large-Scale Network Emulator. In Proc. of the Fifth Symposium on Operating Systems Design and Implementation, pages 271-284, Boston, MA, Dec. 2002.
19. P. van Hentenryck. Personal communication, Nov. 2001.
20. P. J. M. van Laarhoven. Theoretical and Computational Aspects of Simulated Annealing. Centrum voor Wiskunde en Informatica, 1988.
21. P. J. M. van Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel, 1987.
22. 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.
23. K. Yocum, E. Eade, J. Degesys, D. Becker, J. Chase, and A. Vahdat. Scaling Network Emulation using Topology Partitioning. Technical Report TRCS-2003-01, Duke University, February 2003.
24. K. Yocum, E. Eade, J. Degesys, D. Becker, J. Chase, and A. Vahdat. Toward Scaling Network Emulation using Topology Partitioning. In Proc. of MASCOTS 2003, October 2003.