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
R.E. Bellman, “Dynamic Programming,” Pinceton University Press, Princeton, NJ, 1957.
D. Bertsekas, R. Gallager, “Data Networks,” Prentice-Hall, Englewood Cliffs, NJ, 1992.
D. Cavendish, A. Fei, M. Gerla, R. Rom “On the Construction of Low Cost Multicast Trees with Bandwidth Reservation,” UCLA Technical Report Number 970043, December, 1997.
D. Cavendish, A. Fei, M. Gerla, R. Rom “On the Construction of Low Cost Multicast Trees with Bandwidth Reservation,” LNCS Conference on High Performance Computer Networks-HPNC98, Springer-Verlag, New York, 1998.
D. Cavendish and M. Gerla, “Internet QoS Routing Using the Bellman-Ford Algorithm,” IFIP Conference on High Performance Networking-HPN98, Austria, 1998.
D. Cavendish, “On the Complexity of Routing and Wavelength Assignment in WDM Rings with Limited Wavelength Conversion,” In Proc. of Asian-Pacific Optical and Wireless Communications Conference and Exhibit, November 2001, Beijing, China.
D. Cavendish and B. Sengupta, “Routing and Wavelength Assignment in WDM Ring Networks with Heterogeneous Wavelength Conversion Capabilities,” In Proc. of Infocom 2002, Vol. 3, pp. 1415–1424, 2002.
D. Cavendish, A. Kolarov, and B. Sengupta, “Routing and Wavelength Assignment in WDM Mesh Networks”, Proc. of Globecom 2004, Vol. 2, pp. 1016–1022, December 2004.
Cormen, Leiserson and Rivest, “Introduction to Algorithms,” McGraw-Hill, New York, 1990.
S. Deering et al., “The PIM Architecture for Wide-area Multicast Routing,” IEEE/ACM Transactions on Networking, vol. 4, pp.153–162, April 1996.
S. E. Dreyfus and A. M. Law, “The Art and Theory of Dynamic Programming,” Academic Press, New York, 1977.
U. Feigne, “A Threshold of ln n for Approximating Set Cover,” In Proceedings of the 28th Annual ACM Symposium on the Theory of Computation, 1996.
M. R. Garey and D. S. Johnson, “Computers and Intractability,” Freeman, San Francisco, 1979.
M. Gerla and J. T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” ACM-Baltzer J. Wireless Networks, Vol. 1, no. 3, pp. 255–265, 1995.
M. Henig, “Efficient Interactive Method for a Class of Multiattribute Shortest Path Problems,” In Proceedings of Management Science, Vol. 40, # 7, pp. 891–897, July 1994.
J. F. Kurose and K. W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet,” Addison-Wesley, New York, 1999.
C. R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE Journal on Selected Area in Communications, Vol. 15, No. 7, Sept. 1997.
C. E. Perkins, and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” In Proceedings of ACM SIGCOMM’94, pp. 234–244.
M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt, “Bicriteria Network Design Problems,” In Proceedings of 22nd International Colloquium on Automata Languages and Programming, LNCS 944, pp. 487–498, 1995.
R. Ravi, M. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, “Many Birds with One Stone: Multi-objective Approximation Algorithms,” In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 438–447, 1993.
Z. Wang and J. Crowcroft, “Bandwidth-Delay Based Routing Algorithms,” In Proceedings of GLOBECOM95, Vol. 3, pp. 2129–2133, 1995.
G. Wilfong and P. Winkler, “Ring Routing and Wavelength Assignment,” In Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 333–341, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Cavendish, D., Gerla, M. (2006). Routing Optimization in Communication Networks. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_18
Download citation
DOI: https://doi.org/10.1007/0-387-29026-5_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29025-6
Online ISBN: 978-0-387-29026-3
eBook Packages: Computer ScienceComputer Science (R0)