%% You should probably cite draft-yang-alto-topology-06 instead of this revision.
@techreport{yang-alto-topology-04,
	number =	{draft-yang-alto-topology-04},
	type =		{Internet-Draft},
	institution =	{Internet Engineering Task Force},
	publisher =	{Internet Engineering Task Force},
	note =		{Work in Progress},
	url =		{https://datatracker.ietf.org/doc/html/draft-yang-alto-topology-04},
        author =	{Greg M. Bernstein and Young Lee and Wendy Roome and Michael Scharf and Y. Richard Yang},
	title =		{{ALTO Topology Extensions}},
	pagetotal =	16,
	year =		,
	month =		,
	day =		,
	abstract =	{The Application-Layer Traffic Optimization (ALTO) Service has defined network and cost maps to provide basic network information. In this document, we discuss designs to provide abstracted graph representations of network topology. We start with a basic application use case of multi-flow scheduling using ALTO. We show that ALTO cost maps alone cannot provide sufficient information. We then define one key, generic component to address the issues: introducing path vectors in cost maps. We specify two approaches to complement path vectors and achieve a complete design: an approach using opaque network elements and another using a graph (node-link) representation.},
}