Configuring sessions in programmable networks with capacity constraints

IEEE International Conference on Communications

Volumn 2, Issue , 2003, Pages 823-829

  Choi, Sumi Y ^a   Turner, Jonathan ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBLEM SOLVING;

CAPACITY CONSTRAINTS;

TELECOMMUNICATION NETWORKS;

EID: 0038646660     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Sumi Y. Choi, Jonathan Turner, and Tilman Wolf, "Configuring session in programmable networks," Proceedings of IEEE Infocom 2001, Apr. 2001.
2. David L. Tennenhouse, Jonathan M. Smith, W. David Sincoskie, David J. Wetherall, and Gary J. Minden, "A survey of active network research," IEEE Communications Magazine, vol. 35, no. 1, pp. 80-86, Jan. 1997.
3. Andrew T. Campbell, Herman G. De Meer, Michael E. Kounavis, Kazuho Miki, John B. Vicente, and Daniel Villela, "A survey of programmable networks," Computer Communication Review, vol. 29, no. 2, pp. 7-23, Apr. 1999.
4. Daniel Decasper, Guru Parulkar, Sumi Choi, John DeHart, Tilman Wolf, and Bernard Plattner, "A scalable, high performance active network node," IEEE Network, January/February 1999.
5. Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to NP -completeness. Freeman, San Francisco, 1979.
6. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, McGraw-Hill Book Company, 1990.
7. Hongzhou Ma, Inderjeet Singh, and Jonathan Turner, "Constraint based design of atm networks, an experimental study," Washington University Computer Science Department Technical Report WUCS-97-15, 1997.