On the cost of virtual private networks

被引:11
作者
Cohen, R [1 ]
Kaempfer, G [1 ]
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
关键词
Algorithms - Computational complexity - Graph theory - Heuristic methods - Intranets - Network protocols - Routers - Telecommunication links - Telecommunication traffic;
D O I
10.1109/90.893873
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A virtual private network (VPN) is a private data network that uses a nonprivate data network to carry traffic between remote sites, An "Intranet VPN" establishes network layer connectivity between remote Intranet sites by creating an TP overlay network over the nonprivate network, using various tunneling mechanisms, There are two approaches for establishing such tunnels: a "CPE-based approach" and a "network-based approach." In the first approach, tunnels are established only between the CPE devices, whereas in the second approach tunnels are also established between the routers of the core nonprivate network. In this paper we address the problem of determining a CPE-based and a network-based layout of VPN tunnels while taking into account two factors: the cost of the links over which the VPN tunnels are established and the cost of the core routers that serve as end points for the VPN. We define related graph algorithm problems, analyze their complexity, and present heuristics for solving these problems efficiently.
引用
收藏
页码:775 / 784
页数:10
相关论文
共 12 条
[1]  
[Anonymous], 1980, Math Japonica
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]   ROUTING TO MULTIPLE DESTINATIONS IN COMPUTER-NETWORKS [J].
BHARATHKUMAR, K ;
JAFFE, JM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (03) :343-351
[4]  
FOX B, 1999, RFC2685
[5]  
GLEESON B, 2000, RFC2764
[6]  
Hanks S., 1994, RFC1701
[7]  
KENT S, 1998, RFC2401
[8]   ON THE HARDNESS OF APPROXIMATING MINIMIZATION PROBLEMS [J].
LUND, C ;
YANNAKAKIS, M .
JOURNAL OF THE ACM, 1994, 41 (05) :960-981
[9]  
Ramanathan S, 1996, IEEE INFOCOM SER, P337, DOI 10.1109/INFCOM.1996.497911
[10]  
Rosen E., 1999, RFC2547