Summary of Applicability to MESCAL

The following table summarises the applicability of the components presented to MESCAL.

Migration Objects Functional Suitability (1-3)* Availability (1-3)* Documentation (1-3)* Platform (1-3)* Technology (1-3)* Modifications /Support (1-3)* TEQUILA SrNP 2 3 2 3 3 3 TEQUILA SSM 2 3 2 3 3 3 TEQUILA ND 3 3 2 3 3 3 TEQUILA RSIM 2 3 2 3 3 2 TEQUILA DRtM 2 3 2 3 3 2 TEQUILA DRsM 2 3 2 3 3 2 TEQUILA Monitoring 2 3 2 3 3 3 TEQUILA GAL 1 2 2 3 3 1 TEQUILA Traffic Generation and Emulation tools 2 3 2 3 3 2 Policy Management Protocol Implementations 2 3 2 2 2 0

(*) 0: low, 1: average, 2: good, 3: excellent

Table 10 Applicability of background objects with MESCAL

As already outlined, the purpose of surveying various background components was to check upon tools that may facilitate the design and implementation of the MESCAL system. There is no scope in selecting one of more of the presented background objects, as the project implementation plans do not depend on them.

Based on well-defined selection criteria, the applicability of the presented background components was rationalised. As it can be seen from Table 10, the considered background objects present viable options, to a lesser or greater degree, to facilitate project design and implementation activities. In particular,

• The TEQUILA traffic engineering (ND, DRtM, DRsM) and GAL components may be used, with appropriate enhancements, to cover the intra-domain traffic engineering, while the underlying concepts and notions and the gained know-how could be utilised in the design of the MESCAL

• The concepts, notions of and experience gained from the TEQUILA service subscription and invocation management components may be utilised in building the MESCAL inter-domain service architecture; the use of the corresponding TEQUILA components may require significant adaptations.

Finally, it should be noted that the project will continuously review existing components that may be used to facilitate system design and realisation, according to relevant state-of-art developments and the on-going specifications of the MESCAL functional model.

6

REFERENCES

[Barabasi] Albert-Laszlo Barabasi and Reka Albert, “Emergence of Scaling in Random Networks”, Science pp 509-512, October 1999

[BRITE] http://www.cs.bu.edu/BRITE/

[Calvert] Calvert, K., Doar, M., and Zegura, E. "Modelling Internet topology". IEEE Communications Magazine (June 1997).

[D0.2] MESCAL Deliverable D0.2, "Dissemination and use plan"

[D1.1] MESCAL Deliverable D1.1, "Specification of business models and a functional architecture for inter-domain QoS delivery"

[D1.2] MESCAL Deliverable D1.2, "Initial specification of protocols and algorithms for inter-domain SLS management and traffic engineering for QoS-based IP service delivery and their test requirements"

[D1.3] MESCAL Deliverable D1.3, "Final specification of protocols and algorithms for inter-domain SLS management and traffic engineering for QoS-based IP service delivery"

[D1.4] MESCAL Deliverable D1.4, “Issues in MESCAL Inter-Domain QoS Delivery: Technologies, Bi-directionality, Inter-operability, and Financial Settlements”

[DIAMETER] http://www.diameter.org

[DIAMETER2] http://sourceforge.net/projects/diameter/

[Ellen] Ellen W. Zegura, Kenneth L. Calvert and Michael J. Donahoo. "A Quantitative Comparison of Graph-Based Models for Inter Topology". IEEE/ACM Transaction on Networking Vol 5. No 6. December 1997.

[Ellen2] Ellen W. Zegura, Kenneth L. Calvert and Samrat Bhattacharjee. "How to Model an Internetwork", Proceedings of IEEE INFOCOM, April 1996.

[Enns-Netconf 03] R. Enns, Editor “NETCONF Configuration Protocol”, Internet-Draft <draft- ietf-netconf-prot-01>, Expires April 2004.

[Enns-xml 03] R. Enns, “XMLCONF Configuration Protocol” Internet draft <draft-enns-xmlconf- spec-00.txt>, Feb. 2003.

[ERLANG] http://www.erlang-software.com/

[Eval02] Evaluation of J-Sim, June 2002. Available at: www.j-sim.org/comparison.html

[EX-COMM] Internet Draft “Controlling the redistribution of BGP routes”, draft-bonaventure-bgp- redistribution-02.txt

[Faloutsos] M. Faloutsos, P. Faloutsos, C. Faloutsos, "On Power-Law Relationships of the Internet Topology", In proceedings of SIGCOMM: IEEE Conference on Communication, 1999

[GateD] http://www.gated.org

[gtitm] http://www.cc.gatech.edu/projects/gtitm/

[Hazewinkel 03] H. Hazewinkel ,D. Partain, “The Differentiated Services Configuration MIB”, Internet draft <draft-ietf-snmpconf-diffpolicy-08.txt>, Expires April 2004.

[inet] http://topology.eecs.umich.edu/inet/ [J-SIM] http://www.j-sim.org

[MATH] http://www.mathworks.com/

[Medina] Alberto Medina, Ibrahim Matta and John Byers. "On the Origins of Power Laws in Internet Topologies". ACM SIGCOMM Computer Communications Review, Vol. 30, No. 2, April 2000

[Minoli] “ISP Business Relationships”, Chapter 3 of Daniel Minoli, Andrew Schmidt, “Internet Architectures”, Wiley Press 1999, ISBN 0-471-19081-0

[Mitzen] Michael Mitzenmacher, “A Brief History of Generative Models for Power Law and Lognormal Distributions” 39th Annual Allerton Conference on Communication, Control, and Computing, 2001

[MRT] www.merit.edu/~mrt

[Nicol02] D. M. Nicol, Simulation performance analysis, April 2002. Available at: www.ssfnet.org/Exchange/gallery/dumbbell/index.html

[NLANR] http://moat.nlanr.net/AS/Data/ [NS] www.isi.edu/nsnam/ns [OMNET] http://whale.hit.bme.hu/omnetpp/ [OPNET] http://www.opnet.com/

[Palmer] Christopher R. Palmer and J. Gregory Steffan, “Generating Network Topologies That Obey Power Laws”. Proceedings of the Global Internet Symposium, Globecom 2000, November 2000, San Francisco.

[pch] http://www.pch.net/documents/data/routing-tables/ [QRS] www.tct.hut.fi/tutkimus/ironet/QRS/index.html [QUALNET] www.qualnet.com

[Quotin02] B. Quotin, S. Uhlig and O. Bonaventure, “Using redistribution communities for Interdomain Traffic Engineering,” QoFIS’02, Zurich, Switzerland, October 2002. [RADIUS] http://www.cistron.nl/~miquels/radius/

[REAL] http://minnie.tuhs.org/REAL/

[Rekhter98] Y. Rekhter and T. Li, “A border gateway protocol 4,” Internet-Draft (RFC1771), February 1998

[RFC3512] M. MacFaden, D. Partain, J. Saperia, W. Tackabury, “Configuring Networks and Devices with Simple Network Management Protocol (SNMP)” Informational RFC 3512, April 2003. [routeviews] http://archive.routeviews.org/ [SNMPa] http://net-snmp.sourceforge.net/ [SNMPb] http://www.adventnet.com [SNMPc] http://wwwsnmp.cs.utwente.nl/software/ [SSFNET] www.ssfnet.org

[TA] MESCAL Technical Annex

[Tang] “Network Topology Generators: Degree-Based vs Structural” Hongsuda Tangmunarunkit et al. SIGCOMM: IEEE Conference on Communication, 2001

[Waldbusser 03] Steve Waldbusser, Jon Saperia, Thippanna Hongal, “Policy Based Management MIB”, Internet draft <draft-ietf-snmpconf-pm-14.txt>, September 2003.

[Waxman] B.M.Waxman. "Routing of Mulitpoint Connections". IEEE Journal on Selected Areas in communications, 6(9):1617-1622, 1988

[Zebra] www.zebra.org

[Zhang03] Raymond Zhang, JP Vasseur, “MPLS Inter-AS Traffic Engineering requirements”, draft-zhang-mpls-interas-te-req-01.txt, Expires: July, 2003