Steiner Tree: approach applying for shortest path in selected network

Abstract

This paper focus on approach for shortest path from source to destination in which an autonomous system for virtual private network, whose communicate with each other in a private area. For selecting a shortest path we focus on Steiner tree. The general concept of finding minimum path describes an undirected graph, in which vertices (node) and edges (links) are playing main role. we focus on Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. Keywords: Steiner tree, Autonomous system (AS).