基于PLAN网络的最短路径优先网络模型
摘要
主动网络(Active Networks)的概念是DARPA(Defense Advanced Research Projects Agency)研究协会于1995年，针对当时网络发展过程中遇到的几个问题(即，把新的技术和标准引入现有网络中的困难：由于几个网络协议层的冗余操作而使网络性能下降；在已存在的结构模块中加入新服务的困难)提出的。
主动网络是相对于现有的网络比较而言的。现有的网络由于不对报文进行处理或计算，因此可以称之为被动网络(Passive Networks)。虽然在现有的网络中路由器和交换机也可以改变报文的报头，但它们对真正的用户数据却不做任何处理，原封不动地转发用户数据是它们的宗旨。即使对报头的改变和相关路由处理也是独立于用户处理和产生这些报文的应用程序的。相比之下，在主动网络中的路由器和交换机则可以对网络报文进行用户自定义计算。
可编程主动网络语言(PLAN)采用集成思想来实现主动网络的特点。PLAN程序被集成到每一个数据包，然后发送到网络，每一个消息或包都要求包含一个程序段，说明是否可能嵌入数据。当这些包到达主动结点时，主动结点将解释这些程序，然后将程序的嵌入数据发出。
当前的PLAN网络以SLRP(SLRP-Service Level Routing Protocol)路由协议作为默认路由服务，该协议是基于跃点(hops)计数的一个动态路由协议。面对现实网络系统中各种复杂的链路形态，仅仅基于跃点计数的路由算法是低效和片面的。
因此，在本文中提出了一个基于PLAN网络的现有架构，以开销(cost)代替跃点(hops)计数计算网络路径长度，实现最短路径优先(Shortest Path First，SPF)路由规则的主动网络模型。该模型充分利用主动网络的可编程特性，在不修改低层网络协议的情况下，以服务的方式动态加载路由协议，并通过PLAN主
动包加以调用，来实现最短路径优先的路由规则。
整个模型由Java和Pi zza程序语言编写，并由PLAN语言进行安装和服务的
调用，最后通过Ping和Traceroute这两个常用的网络实用程序进行实例化分析
和测试。
Because of contraposing to serials of problems in the development of network (viz., the difficulty of importing new technologies and standards into current network, the decline of network performance because of redundancy operations by few net protocol layers, the difficulty of joinning new services in existing structure modules), the concept of AN(Active Networks) is presented by DARPA(Defense Advanced Research Projects Agency) in 1995.
AN is compared to current network. Current network be named as Passive Networks because they don't compute or disposal message. Although the routers and the switchs can change the header of message in current network, they do nothing about the actual user data, and their tenet is transmiting user data without change. Even if changing the header of message and other route operation is independent of user disposal and applications which made these message. Compare to this, the routers and the switchs in AN can compute network message according to users' demands.
PLAN(Programming Language for Active Network) implement the characters of AN via idea of integration. Program is integrated in each data packet, then be send to network. Every message or packet have a piece of program code, which explain whether it can embed data or not. Active node will explain these program, and send out data in program when the packet arrived.
Current PLAN network use SLRP (SLRP-Service Level Routing Protocol) route protocol as its default route service. This protocol is a dynamic route protocol based on hops counting. Its arithmetic just based on hops counting is low efficiency and unilateralism when the network have complex link state.
We presented an AN model in this article. It based on the current structure of PLAN network, which use cost to instead of the hops to compute network path length and realize the route rule of Shortest Path First (SPF). This model make full use of the programmable feature of AN, dynamicly install the route protocol as a service without reworking bottom protocol of network, and implement the route rule of the SPF by PLAN active packet.
The model is written by Java and Pizza program language. It was installed and debugged by PLAN language, and analyzed and tested by Ping and Traceroute program which are common network utilities.
主动网络是相对于现有的网络比较而言的。现有的网络由于不对报文进行处理或计算，因此可以称之为被动网络(Passive Networks)。虽然在现有的网络中路由器和交换机也可以改变报文的报头，但它们对真正的用户数据却不做任何处理，原封不动地转发用户数据是它们的宗旨。即使对报头的改变和相关路由处理也是独立于用户处理和产生这些报文的应用程序的。相比之下，在主动网络中的路由器和交换机则可以对网络报文进行用户自定义计算。
可编程主动网络语言(PLAN)采用集成思想来实现主动网络的特点。PLAN程序被集成到每一个数据包，然后发送到网络，每一个消息或包都要求包含一个程序段，说明是否可能嵌入数据。当这些包到达主动结点时，主动结点将解释这些程序，然后将程序的嵌入数据发出。
当前的PLAN网络以SLRP(SLRP-Service Level Routing Protocol)路由协议作为默认路由服务，该协议是基于跃点(hops)计数的一个动态路由协议。面对现实网络系统中各种复杂的链路形态，仅仅基于跃点计数的路由算法是低效和片面的。
因此，在本文中提出了一个基于PLAN网络的现有架构，以开销(cost)代替跃点(hops)计数计算网络路径长度，实现最短路径优先(Shortest Path First，SPF)路由规则的主动网络模型。该模型充分利用主动网络的可编程特性，在不修改低层网络协议的情况下，以服务的方式动态加载路由协议，并通过PLAN主
动包加以调用，来实现最短路径优先的路由规则。
整个模型由Java和Pi zza程序语言编写，并由PLAN语言进行安装和服务的
调用，最后通过Ping和Traceroute这两个常用的网络实用程序进行实例化分析
和测试。
Because of contraposing to serials of problems in the development of network (viz., the difficulty of importing new technologies and standards into current network, the decline of network performance because of redundancy operations by few net protocol layers, the difficulty of joinning new services in existing structure modules), the concept of AN(Active Networks) is presented by DARPA(Defense Advanced Research Projects Agency) in 1995.
AN is compared to current network. Current network be named as Passive Networks because they don't compute or disposal message. Although the routers and the switchs can change the header of message in current network, they do nothing about the actual user data, and their tenet is transmiting user data without change. Even if changing the header of message and other route operation is independent of user disposal and applications which made these message. Compare to this, the routers and the switchs in AN can compute network message according to users' demands.
PLAN(Programming Language for Active Network) implement the characters of AN via idea of integration. Program is integrated in each data packet, then be send to network. Every message or packet have a piece of program code, which explain whether it can embed data or not. Active node will explain these program, and send out data in program when the packet arrived.
Current PLAN network use SLRP (SLRP-Service Level Routing Protocol) route protocol as its default route service. This protocol is a dynamic route protocol based on hops counting. Its arithmetic just based on hops counting is low efficiency and unilateralism when the network have complex link state.
We presented an AN model in this article. It based on the current structure of PLAN network, which use cost to instead of the hops to compute network path length and realize the route rule of Shortest Path First (SPF). This model make full use of the programmable feature of AN, dynamicly install the route protocol as a service without reworking bottom protocol of network, and implement the route rule of the SPF by PLAN active packet.
The model is written by Java and Pizza program language. It was installed and debugged by PLAN language, and analyzed and tested by Ping and Traceroute program which are common network utilities.
引文
[1] M Hicks, P Kakkar, J T Moore, C.A Gunter, S Nettles. PLAN: A Packet Language for Active Networks. [J] . ACM SIGPLAN ICFP, 1998,9:86-93
[2] M Hicks.PLAN Service Programmer's Guide[DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[3] Jonathan T Moore, M Hicks,S Nettles:Practical Programmable Packets.[J] . computer and Information INFOCOM,2001,9(3): 112-114
[4] Sonal Kotecha,Arsalan Zaidi,Rajkumar Ganesan:TCP/IP over an Ethernet Network[DB/OL] . http://www.vijaymukhi.com/vmis/ethtcp.htm
[5] M Hicks, J T Moore. PLAN Programmer's Guide for PLAN version 2.2[DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/, Novermber 24,1997
[6] M Hicks, P Kakkar,J T Moore.The PLAN Tutoriar for PLAN version2.2 [DB/OL] . PLAN documentation,http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[7] M Hicks, S Nettles. PLAN: Active Network Means Evolution(or Enhanced Extensibility Required). ACM SIGPLAN ICFP, 1998
[8] Caml home page.[DB/OL] .pauillac.inria.fr/caml/index-eng.html
[9] James Gosling,Bill Joy, and Guy Steele.The Java Language Specification.Addison Wesley,1996
[10] Pizza home page.[DB/OL] .www.math.luc.edu/pizza
[11] JavaCC home page.[DB/OL] .www.suntest.com/JavaCC
[12] William R.Parkhurst.Cisco Router OSPF Design&Implementation Guide.[M] .北京．机械工业出版社．1999
[13] M Hicks,J T Moore.PLAN: A Service Layer Protocol for PLAN for PLAN version2.2. [DB/OL] .RLANdocumentation,http://www.cis.upenn.edu/～switchware/PLAN/, Novermber 24,1997
[14] M Hicks,Christian Tschudin.Active Network Overlay Network, RFC,ANON documentaion, 1997
[15] M Hicks.The PLAN Active Router. [DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[16] D Scott Alexander, Bob Braden, Carl A Gunter, Alden W Jackson Angelos,D Keromytis Gary, J Minden and David Wetherall,Active Network Encapsulation Protocol(ANEP),RFC,ANEP documentation, 1997
[17] J Postel.lnternet Control Message Protocol.RFC792,ISI,September 1981
[18] D Scott Alexander, Marianne Shae,Scott M Nettles,J M Smith.Active bridging In Proceedings. 1997 SiGCOMM Conferece.ACM,1997
[19] Bell Communications Research Inc.AIN Release 1 Service Logic Program Framework Generic Requirements.EA-NWT-O01132
[20] D Clark, S Shenker, L Zhang.Supporting real-time applications in an integrated service packet network:Architecture and mechnism.In Proceedings,1992 SIGCOMM Conference,August 1992
[21] David C Feldmeier, A McAuley, J M Smith.Protocol booster.IEEE journal on spcial Aspects of Communication, 1998.To appear in the issue on Protocol Architecures for the 21 st Century
[22] C A Gunter, Scott Nettles,Peter Homeier.Infrastructureforproof-referencing code.In International Conference on Theorem Proving in Higher Order Logics,1997.www.cis.upenn.edu/～hol/fsmc.ps.Z
[23] C Partridge and A Jackson.Smartpackets.Technical report,BBN,1996.http://www. net-tech.bbn.corn/smtpkts/smtpkts-index.html
[24] J M Smith,D J Farber, D C Feldmeier, etc. Accelerating network evolution.www. cis.upenn.edu/～switchware/papers/swaer.ps, 1996
[25] D L Tennenhouse,J M Smith, W D Sincoskie,D J Wetherall,G J Minden.A survery of active network research.IEEE Communications Magazine,January,1997
[26] David J Wetherall,John Guttag,David L Tennenhouse.ANTS:A toolkit for building and dynamically deploying network protocols.In IEEE OPENARCH,April,1998
[27] Schwartz, Jackson. Smart packets: Applying active networks to network managemen. SIGCOMM Conference.2000
[28] M Odersky, P Wadler.Pizza to Java: Translating theory into practice.Proceedings of the 24th ACM Symposium on Principles of Programming Languages,January 1997
[29] M Hicks, P Kakkar, J T Moore,C A Gunter, S Nettles.Net Proggramming with PLAN.In IEEE Workshop on Internet Programming Languages,May 1998
[30] M Hicks, J T Moore,D S Alexander, C A Gunter, S Nettles.PLANet:An Active Internetwork.In IEEE INFOCOM,March 1999
[31] E Nygren, S Garland,M F Kaashoek.PAN:A High-Performance Active Network Node Supporting Multiple Mobile Code System.In IEEE OPENARCH,March 1999
[32] D Raz,Y Shavitt.An active network approach for efficient network management.In International Working Conference on Arrive Networks,July 1999
[33] D Wetherall.Active network vision and reality:lessons from a capsule-based system.Operating System Review, December 1999
[34] AN Working Group.Architectural framework for active work.Draft:http://www.dcs.uky.edu/calvert/arch-1-0.ps,June 1998
[35] D Tennenhouse,J M Snith,W D Sincoskie,D J Wetherall,G J Minden.A survey of active network research.IEEE Conmmunications Magazine,Jan 1997
[36] K Calvert,S Bhattaeharjee,E Zegura,J Sterbenze.Directions in active network.IEEE Communications Magazine,1998
[37] D Williams,C Nguyen,A Fekete,M Hitchens,B Kummerfeld.An active network bandwidth reservation scheme.IEEE OPENARCH,1999
[38] AN Security Working Group.Security architecture for active nets.Draft:http//www.ittc.ukans.edu/ansecure/0079.html,June 1998
[39] D S Alexander, W A Arbaugh,A D Keromytis,J M Smith..A secure active network enviroment architecture: Realisation in Switch Ware.IEEE Network Magazine,special issue on Active and Programmable Networks, 1998
[40] S Merugu, S Bhattacharjee,E Zegura, K Calvert.Bowman:A node os for active networks.IEEE INFOCOM,2000
[41] Beverly Schwartz, Wenyi Zhou,Alden W Jackson, W Timothy Strayer, Dennis Rockwell,Craig Partridge.Smart packet for active networks.http://www-net-tech.bbn.com/smtpkts/smtpkts.ps.gz,Jan 1998
[2] M Hicks.PLAN Service Programmer's Guide[DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[3] Jonathan T Moore, M Hicks,S Nettles:Practical Programmable Packets.[J] . computer and Information INFOCOM,2001,9(3): 112-114
[4] Sonal Kotecha,Arsalan Zaidi,Rajkumar Ganesan:TCP/IP over an Ethernet Network[DB/OL] . http://www.vijaymukhi.com/vmis/ethtcp.htm
[5] M Hicks, J T Moore. PLAN Programmer's Guide for PLAN version 2.2[DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/, Novermber 24,1997
[6] M Hicks, P Kakkar,J T Moore.The PLAN Tutoriar for PLAN version2.2 [DB/OL] . PLAN documentation,http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[7] M Hicks, S Nettles. PLAN: Active Network Means Evolution(or Enhanced Extensibility Required). ACM SIGPLAN ICFP, 1998
[8] Caml home page.[DB/OL] .pauillac.inria.fr/caml/index-eng.html
[9] James Gosling,Bill Joy, and Guy Steele.The Java Language Specification.Addison Wesley,1996
[10] Pizza home page.[DB/OL] .www.math.luc.edu/pizza
[11] JavaCC home page.[DB/OL] .www.suntest.com/JavaCC
[12] William R.Parkhurst.Cisco Router OSPF Design&Implementation Guide.[M] .北京．机械工业出版社．1999
[13] M Hicks,J T Moore.PLAN: A Service Layer Protocol for PLAN for PLAN version2.2. [DB/OL] .RLANdocumentation,http://www.cis.upenn.edu/～switchware/PLAN/, Novermber 24,1997
[14] M Hicks,Christian Tschudin.Active Network Overlay Network, RFC,ANON documentaion, 1997
[15] M Hicks.The PLAN Active Router. [DB/OL] .PLAN documentation, http://www.cis.upenn.edu/～switchware/PLAN/,Novermber 24,1997
[16] D Scott Alexander, Bob Braden, Carl A Gunter, Alden W Jackson Angelos,D Keromytis Gary, J Minden and David Wetherall,Active Network Encapsulation Protocol(ANEP),RFC,ANEP documentation, 1997
[17] J Postel.lnternet Control Message Protocol.RFC792,ISI,September 1981
[18] D Scott Alexander, Marianne Shae,Scott M Nettles,J M Smith.Active bridging In Proceedings. 1997 SiGCOMM Conferece.ACM,1997
[19] Bell Communications Research Inc.AIN Release 1 Service Logic Program Framework Generic Requirements.EA-NWT-O01132
[20] D Clark, S Shenker, L Zhang.Supporting real-time applications in an integrated service packet network:Architecture and mechnism.In Proceedings,1992 SIGCOMM Conference,August 1992
[21] David C Feldmeier, A McAuley, J M Smith.Protocol booster.IEEE journal on spcial Aspects of Communication, 1998.To appear in the issue on Protocol Architecures for the 21 st Century
[22] C A Gunter, Scott Nettles,Peter Homeier.Infrastructureforproof-referencing code.In International Conference on Theorem Proving in Higher Order Logics,1997.www.cis.upenn.edu/～hol/fsmc.ps.Z
[23] C Partridge and A Jackson.Smartpackets.Technical report,BBN,1996.http://www. net-tech.bbn.corn/smtpkts/smtpkts-index.html
[24] J M Smith,D J Farber, D C Feldmeier, etc. Accelerating network evolution.www. cis.upenn.edu/～switchware/papers/swaer.ps, 1996
[25] D L Tennenhouse,J M Smith, W D Sincoskie,D J Wetherall,G J Minden.A survery of active network research.IEEE Communications Magazine,January,1997
[26] David J Wetherall,John Guttag,David L Tennenhouse.ANTS:A toolkit for building and dynamically deploying network protocols.In IEEE OPENARCH,April,1998
[27] Schwartz, Jackson. Smart packets: Applying active networks to network managemen. SIGCOMM Conference.2000
[28] M Odersky, P Wadler.Pizza to Java: Translating theory into practice.Proceedings of the 24th ACM Symposium on Principles of Programming Languages,January 1997
[29] M Hicks, P Kakkar, J T Moore,C A Gunter, S Nettles.Net Proggramming with PLAN.In IEEE Workshop on Internet Programming Languages,May 1998
[30] M Hicks, J T Moore,D S Alexander, C A Gunter, S Nettles.PLANet:An Active Internetwork.In IEEE INFOCOM,March 1999
[31] E Nygren, S Garland,M F Kaashoek.PAN:A High-Performance Active Network Node Supporting Multiple Mobile Code System.In IEEE OPENARCH,March 1999
[32] D Raz,Y Shavitt.An active network approach for efficient network management.In International Working Conference on Arrive Networks,July 1999
[33] D Wetherall.Active network vision and reality:lessons from a capsule-based system.Operating System Review, December 1999
[34] AN Working Group.Architectural framework for active work.Draft:http://www.dcs.uky.edu/calvert/arch-1-0.ps,June 1998
[35] D Tennenhouse,J M Snith,W D Sincoskie,D J Wetherall,G J Minden.A survey of active network research.IEEE Conmmunications Magazine,Jan 1997
[36] K Calvert,S Bhattaeharjee,E Zegura,J Sterbenze.Directions in active network.IEEE Communications Magazine,1998
[37] D Williams,C Nguyen,A Fekete,M Hitchens,B Kummerfeld.An active network bandwidth reservation scheme.IEEE OPENARCH,1999
[38] AN Security Working Group.Security architecture for active nets.Draft:http//www.ittc.ukans.edu/ansecure/0079.html,June 1998
[39] D S Alexander, W A Arbaugh,A D Keromytis,J M Smith..A secure active network enviroment architecture: Realisation in Switch Ware.IEEE Network Magazine,special issue on Active and Programmable Networks, 1998
[40] S Merugu, S Bhattacharjee,E Zegura, K Calvert.Bowman:A node os for active networks.IEEE INFOCOM,2000
[41] Beverly Schwartz, Wenyi Zhou,Alden W Jackson, W Timothy Strayer, Dennis Rockwell,Craig Partridge.Smart packet for active networks.http://www-net-tech.bbn.com/smtpkts/smtpkts.ps.gz,Jan 1998