Optimization models for designing aggregation networks to support fast moving users

Lecture Notes in Computer Science

Volumn 3427, Issue , 2005, Pages 66-81

  Van Quickenborne, Frederic ^a   De Greve, Filip ^a   De Turck, Filip ^a   Moerman, Ingrid ^a   Dhoedt, Bart ^a   Demeester, Piet ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Capacity assignment; Mobility support; Traffic engineering

Indexed keywords

BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING;

AGGREGATION NETWORK; BANDWIDTH SERVICES; TRAFFIC DEMANDS; TUNNEL PATHS;

COMPUTER NETWORKS;

EID: 24344445966     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31963-4_6     Document Type: Conference Paper

References (12)

1. G. Bouchat and S. van den Bosch. Qos in dsl access. IEEE Communications Magazine, pages 108-114, September 2003.
2. K. Casier and S. Verbrugge. Trs, telecom research software. http://www.ibcn.intec.ugent.be/projects/internal/trs, 2003.
3. G. Fleishman. Destination wi-fi, by rail, bus or boat. The New York Times, July 2004.
4. IEEE 802.1D. Standards for local and metropolitan area networks: Media access control (mac) bridges. 1990.
5. IEEE 802.1q. Standards for local and metropolitan area networks: Virtual bridged local area networks. 1998.
6. IEEE 802.1s. Standards for local and metropolitan area networks: Multiple spanning trees. 2002.
7. D. B. Johnson, C. Perkins, and J. Arrko. Mobility support in ipv6. IETF Internet draft, http://www.ietf.org/internet-drafts/draft-ietf-mobileip-ipv6-24.txt, 2003.
8. B. Lannoo, D. Colle, M. Pickavet, and P. Demeester. Radio over fibre technique for multimedia train environment. NOC, 2003.
9. G.L. Nemhauser and A.L. Wolsey. Integer and combinatorial optimization. John Wiley & Sons, 1988.
10. F. Van Quickenborne, F. De Greve, P. Van Heuven, F. De Turck, B. Vermeulen, S. Van den Berghe, I. Moerman, and P. Demeester. Tunnel set-up mechanisms in ethernet networks for fast moving users. NETWORKS, 2004.
11. B. Walke, P. Seidenberg, and M. P. Althoff. Umts, the fundamentals. Wiley, page 75, 2003.
12. J. Y. Yen. Finding the k shortest loopless paths. Management Science, 17:712-716, 1971.