基于SOCKET通信机制的远程透明传输平台
|
摘要
在现有的因特网应用中，企业网是通过在因特网基础上的虚拟局域网来实现的。企业网主要用于企业各地的子公司联系和交流。为此，需要建立一个远程传输平台。通过这个平台，企业各地的子公司可以彼此方便而可靠地实现信息的交流和数据的共享。本文中所谓的“透明”是指信息和数据在底层的传输对用户而言是不可见的。如何将信息和数据安全可靠地传输到目的地是本文主要要解决的问题。这个问题的解决可分为三部分。首先，本文针对现有局域网中常见的星形网络，分析网络拓扑可靠性问题，并设计企业网中所需要的多链路冗余的网络模型，使得企业网可以通过多链路冗余来达到绕过故障点或者故障链路并进行可靠传输的目的。第二，该系统解决如何能够快速发现故障并且快速绕过这些故障的问题，这需要动态检测链路的状态情况，并且通过有效的同步过程将链路的状态情况在整个网络中的节点中实现统一。第三，此平台通过路由选择算法得出最优链路来将信息和数据及时地转发到下一节点。
在众多消息传递和通信的方法中，SOCKET通信机制是比较常用的方法。SOCKET通信机制被用来设计软路由中主要的几个消息。这些消息是使用不同的数据格式来封装的，有的使用IP数据包，有些使用UDP数据包。格式的不同是根据对效率的不同要求来选择的。同时，为了控制网络拥塞，文中使用了一种结合加权公平排队(WFQ)方式和自定义排队(CQ)方式的加权轮转排队方法。这种方法既可以使得交互式的、面向事务的应用不会被延误，又可以使得一些大块的传输不会被饿死。文中就链路故障的检测和处理也提出了相应的处理方法，使得整个网络可以很快地通过对一些定时器的设定来检测哪里出了故障，出了什么故障，并且在这些故障消失的时候可以有效地恢复。路由选择算法采用Dijkstra最短路径算法，此算法可以根据动态链路检测所得的结果做出有效路径选择。
In existing Internet uses, the corporation network is realized through the virtual LAN on the basis of Internet. The corporation network is mainly used to contact and communicate each other in the subsidiary companies all around the world. Therefore, a remote transport platform is wanted. Through the platform, the subsidiary companies of the whole corporation can expediently and reliably exchange the information and share the data. So-called "transparent" in the article means that the transport of the information and data in the lower layer is invisible to the users. The major problem in the paper is how to transfer the information and data expediently and reliably to the destination. The problem is divided into three parts. Firstly, the paper discusses the familiar star-shaped network structure, analyze the reliability of the network structure, and then design the multi-link redundancy network structure so that the corporation network transmits data packets to the next node through the redundancy links. Sec
ondly, the system settles the problem how to rapidly find out failures and round the failures, that need dynamically detect the links' state, and unify the whole network's link state through the valid synchronization. Thirdly, the platform transmits data to next node through the best link according to the route-choosing algorithm. Among the numerous methods transmitting messages and communicating data, SOCKET communication mechanism is in common use. SOCKET communication mechanism is used to design the major messages in soft routing. These messages are encapsulated by different data format, some use IP data packet, some use UDP data packet. The various formats are chosen according to the demand on the efficiency. At the same time, for the sake of controlling network congestion, the article use a weighted round-robin queuing method, which joints Custom Queuing (CO) and Weighted Fair Queuing (WFQ). The fashion can make the interactive, affairs-oriented applications not be delayed, as well as the block of trans
portation not be starved. In the paper the corresponding treatment methods are put forward on measuring and treat with that breakdown, too. And then, the whole network can quickly measure through setting some timers where the failures come forth, what troubles are offered, and may recover effectively when these troubles disappear. The route-choosing algorithm adopts Dijkstra shortest-path algorithm that can choose effectively the valid path according to dynamic link-detecting results,
在众多消息传递和通信的方法中，SOCKET通信机制是比较常用的方法。SOCKET通信机制被用来设计软路由中主要的几个消息。这些消息是使用不同的数据格式来封装的，有的使用IP数据包，有些使用UDP数据包。格式的不同是根据对效率的不同要求来选择的。同时，为了控制网络拥塞，文中使用了一种结合加权公平排队(WFQ)方式和自定义排队(CQ)方式的加权轮转排队方法。这种方法既可以使得交互式的、面向事务的应用不会被延误，又可以使得一些大块的传输不会被饿死。文中就链路故障的检测和处理也提出了相应的处理方法，使得整个网络可以很快地通过对一些定时器的设定来检测哪里出了故障，出了什么故障，并且在这些故障消失的时候可以有效地恢复。路由选择算法采用Dijkstra最短路径算法，此算法可以根据动态链路检测所得的结果做出有效路径选择。
In existing Internet uses, the corporation network is realized through the virtual LAN on the basis of Internet. The corporation network is mainly used to contact and communicate each other in the subsidiary companies all around the world. Therefore, a remote transport platform is wanted. Through the platform, the subsidiary companies of the whole corporation can expediently and reliably exchange the information and share the data. So-called "transparent" in the article means that the transport of the information and data in the lower layer is invisible to the users. The major problem in the paper is how to transfer the information and data expediently and reliably to the destination. The problem is divided into three parts. Firstly, the paper discusses the familiar star-shaped network structure, analyze the reliability of the network structure, and then design the multi-link redundancy network structure so that the corporation network transmits data packets to the next node through the redundancy links. Sec
ondly, the system settles the problem how to rapidly find out failures and round the failures, that need dynamically detect the links' state, and unify the whole network's link state through the valid synchronization. Thirdly, the platform transmits data to next node through the best link according to the route-choosing algorithm. Among the numerous methods transmitting messages and communicating data, SOCKET communication mechanism is in common use. SOCKET communication mechanism is used to design the major messages in soft routing. These messages are encapsulated by different data format, some use IP data packet, some use UDP data packet. The various formats are chosen according to the demand on the efficiency. At the same time, for the sake of controlling network congestion, the article use a weighted round-robin queuing method, which joints Custom Queuing (CO) and Weighted Fair Queuing (WFQ). The fashion can make the interactive, affairs-oriented applications not be delayed, as well as the block of trans
portation not be starved. In the paper the corresponding treatment methods are put forward on measuring and treat with that breakdown, too. And then, the whole network can quickly measure through setting some timers where the failures come forth, what troubles are offered, and may recover effectively when these troubles disappear. The route-choosing algorithm adopts Dijkstra shortest-path algorithm that can choose effectively the valid path according to dynamic link-detecting results,
引文
[1] Douglas E. Comer, David I. Internetworking with TCP/IP. Vol. Ⅱ: design, implementation, and internals. Stevens, 1991
[2] 琼斯(美)，欧伦德(美)著．Windows网络编程．第2版．杨合庆译．北京：清华大学出版社，2002：P39，P306-P319
[3] 张宏科等．路由器原理与技术。北京： 国防工业出版社，2003．1：P24-P178，P259-P264
[4] 白建军，卢泽新．路由器原理与设计．人民邮电出版社，2002：P179-P183
[5] 吴杰(Jie Wu)。分布式系统设计．高传善等译．机械工业出版社，2001．2：P4-P15，P111-P116
[6] 谢希仁．计算机网络．第2版．电子工业出版社．2001：P102，P156-P167
[7] Cormac Long．IP网络设计．人民邮电出版社．2002．9：P80，P81-P97
[8] 王文博，张金文．OPNET Modeler与网络仿真．人民邮电出版社，2003．10
[9] 傅清祥，王晓东．算法与数据结构．电子工业出版社，1998
[10] 陈烨，赵文武．Jbuilder 7编程实作指南．北京希望电子出版社
[11] Uyless Black．IP路由协议．金甄平等译。电子工业出版社．2000：P6-P7，P11，P89，
[12] 王罡，林立志．基于Windows的TCP/IP编程．清华大学出版社．2002：P388-P353
[13] Stefan Boecking。面向对象的网络协议．陈葆珏，严伟 译．机械工业出版社，2000
[14] Moy John T．OSPF协议剖析．胡光明等译．中国电力出版社，2002：P41-P44， P61-P83
[15] Thomas Lee，Joseph Davies．Microsoft Windows 2000 TCP/IP协议和服务技术参考．北京超品计算机有限责任公司译．人民邮电出版社，2000
[16] 苏洋．Java分布式应用程序设计．北京希望电子出版社，2002
[17] 钟军，汪晓平等．Delphi网络通信协议分析与应用实现．人民邮电出版社．2003
[18] Andrew S．Tanenbaum。计算机网络．第3版．清华大学出版社，2000
[19] Moy John T．OSPF协议完全实现． 闵春平译． 北京：中国电力出版社，2002
[20] Parkhurst，W．R．Cisco路由器OSPF设计与实现。潇湘工作室译。机械工业出版社，1999．3
[21] Doyle Jeff．Routing TCP/IP．北京人民邮电出版社．2003
[22] Comer Douglase．用TCP/IP进行网际互连=第1卷原理、协议和体系结构．林瑶等 译．电子工业出版社，1998．4
[23] Comer Douglase，Stevens David．用TCP/IP进行网际互连=第2卷设计、实现和内部构成．张娟等译．电子工业出版社1998．7
[24] Comer Douglase，Stevens David．用TCP/IP进行网际互连=第3卷客户机-服务器编程和应用．赵刚等 译．电子工业出版社1998．6
[25] Faraz Shamim，Zaheer Aziz，Johnson Liu，Abe Martey．Ⅰ路由协议疑难解析．卢泽新等译。人民邮电出版社，2003．4
[26] Chris Brenton．多协议网络设计与故障排除．吴海霞等 译．电子工业出版社，1999
[27] 黄国瑜，叶乃清．数据结构(Java语言版)．清华大学出版社 2002．3
[28] Leszek A．Maciaszek．需求分析与系统设计．金芝译．机械工业出版社，2003
[29] ANSI(美国国家标准学会)：Web．ansi．org
[30] IEEE(电气电子工程师学会)：WWW．ieee．org
[31] IETF(因特网工程部)：WWWW．ietf．org
[32] ISO(国际标准化组织)：WWW．iso．ch
[33] ITU(国际电信联盟)：WWW．itu．ch
[34] NIST(国家标准技术研究所(美))：WWW．nist．gov
[35] W3C(万维网协会)：WWW．W3C．nist．gov
[36] SHI Ming-Hong, WANG Si-Bing, BAI Ying-Cai. A bandwidth constrained Qos routing optimization algorithm. IEEE Network ,
2002,12(2):P491-P494
[37] Michalareas T, Sacks L. Link-state and ant-like algorithm behavior for single-constrained routing. High Performance Switching and Routing, 20011EEE Workshop on, 29-31 May 2001:P302-P305
[38] Hwa-Chun Lin, Hsin-Liang Lai, Shou-Chuan Lai. Automatic link layer topology discovery of IP networks. Communications, 1999. ICC' 99. 1999 IEEE International Conference on, Yolume 2,6-10 June 1999:PlO34-P1038
[39] Kawabe R, Ata S, Murata M, etc. On performance prediction of address lookup algorithm of IP routers through simulation and analysis techniques. Communications, 2002. ICC 2002. IEEE International Conference on ,Volume:4,28 April-2 May 2002:P2146-P2151
[40] Dullaert J.C.,Rahman M.H.,Mouftah H.T..Delivering end-to-end quality of service through an Internet protocol based differentiated services domain. Electrical and Computer Engieering, 2001. Canadian Conference on, Volume:1, 13-16 May 2001:P335-P341
[41] Qin G.,Ata .S, Oka I.,Fujiwara C..Effective bit selection methods for improving performance of packet classifications on IP routers. Global Telecommunications Conference, 2002. GLOBECOM' 02. IEEE, Volume:3,17-21 Nov, 2002:P2350-P2354
[42] Krasser S.,Owen H.L.,Barlow D.A.,etc..Evaluation of the local sate fair share bandwidth algorithm. Telecommunications, 2003.ICT 2003.10th International Conference on, Volume:2,23 Feb-1 March 2003:P911-P916
[43] Berger M..IP lookup with low memory requirement and fast update. High Performance Switching and Routing, 2003, HPSR. Workshop on, 24-27 June 2003:P28?-P291
[44] Hariri S.,Kartik Dev A.J.,SeungChan Oh, etc..Adaptive quality of service resource management in IP networks. Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International
Conference on, 14-18 July 2003:P40
[45] Joutsensal J.,Hamalainen T.,Paakkonen M.,Sayenko A. Adaptive weighted fair scheduling method for channel allocation. Communications, 2003. ICC' 03. IEEE International Conference on, Volume:1, 11-15 May 2003:P228-P232 ,
[46] Keshav S.,Sharma R..Issues and trends in touters design. Communications Magzine, IEEE. Volume:36, Issue:5, May 1998:P144-P151
[47] 陶宏才．数据库原理与应用设计．西南交通大学出版社，2001，9
[48] 萨师煊，王珊．数据库系统概论．第3版．高等教育出版社．2000
[49] OteyM．；ConteP．；陈恩义．SQL Server 2000开发指南．清华大学出版社，2002
[50] Microsoft Corporation Microsoft Corporation．Microsoft SQL Server 2000 XML和Internet支持．北京：科学出版社，2000
[51] 张长富．Microsoft SQL Server 2000数据库编程．北京：北京希望电子出版社，2001．5
[2] 琼斯(美)，欧伦德(美)著．Windows网络编程．第2版．杨合庆译．北京：清华大学出版社，2002：P39，P306-P319
[3] 张宏科等．路由器原理与技术。北京： 国防工业出版社，2003．1：P24-P178，P259-P264
[4] 白建军，卢泽新．路由器原理与设计．人民邮电出版社，2002：P179-P183
[5] 吴杰(Jie Wu)。分布式系统设计．高传善等译．机械工业出版社，2001．2：P4-P15，P111-P116
[6] 谢希仁．计算机网络．第2版．电子工业出版社．2001：P102，P156-P167
[7] Cormac Long．IP网络设计．人民邮电出版社．2002．9：P80，P81-P97
[8] 王文博，张金文．OPNET Modeler与网络仿真．人民邮电出版社，2003．10
[9] 傅清祥，王晓东．算法与数据结构．电子工业出版社，1998
[10] 陈烨，赵文武．Jbuilder 7编程实作指南．北京希望电子出版社
[11] Uyless Black．IP路由协议．金甄平等译。电子工业出版社．2000：P6-P7，P11，P89，
[12] 王罡，林立志．基于Windows的TCP/IP编程．清华大学出版社．2002：P388-P353
[13] Stefan Boecking。面向对象的网络协议．陈葆珏，严伟 译．机械工业出版社，2000
[14] Moy John T．OSPF协议剖析．胡光明等译．中国电力出版社，2002：P41-P44， P61-P83
[15] Thomas Lee，Joseph Davies．Microsoft Windows 2000 TCP/IP协议和服务技术参考．北京超品计算机有限责任公司译．人民邮电出版社，2000
[16] 苏洋．Java分布式应用程序设计．北京希望电子出版社，2002
[17] 钟军，汪晓平等．Delphi网络通信协议分析与应用实现．人民邮电出版社．2003
[18] Andrew S．Tanenbaum。计算机网络．第3版．清华大学出版社，2000
[19] Moy John T．OSPF协议完全实现． 闵春平译． 北京：中国电力出版社，2002
[20] Parkhurst，W．R．Cisco路由器OSPF设计与实现。潇湘工作室译。机械工业出版社，1999．3
[21] Doyle Jeff．Routing TCP/IP．北京人民邮电出版社．2003
[22] Comer Douglase．用TCP/IP进行网际互连=第1卷原理、协议和体系结构．林瑶等 译．电子工业出版社，1998．4
[23] Comer Douglase，Stevens David．用TCP/IP进行网际互连=第2卷设计、实现和内部构成．张娟等译．电子工业出版社1998．7
[24] Comer Douglase，Stevens David．用TCP/IP进行网际互连=第3卷客户机-服务器编程和应用．赵刚等 译．电子工业出版社1998．6
[25] Faraz Shamim，Zaheer Aziz，Johnson Liu，Abe Martey．Ⅰ路由协议疑难解析．卢泽新等译。人民邮电出版社，2003．4
[26] Chris Brenton．多协议网络设计与故障排除．吴海霞等 译．电子工业出版社，1999
[27] 黄国瑜，叶乃清．数据结构(Java语言版)．清华大学出版社 2002．3
[28] Leszek A．Maciaszek．需求分析与系统设计．金芝译．机械工业出版社，2003
[29] ANSI(美国国家标准学会)：Web．ansi．org
[30] IEEE(电气电子工程师学会)：WWW．ieee．org
[31] IETF(因特网工程部)：WWWW．ietf．org
[32] ISO(国际标准化组织)：WWW．iso．ch
[33] ITU(国际电信联盟)：WWW．itu．ch
[34] NIST(国家标准技术研究所(美))：WWW．nist．gov
[35] W3C(万维网协会)：WWW．W3C．nist．gov
[36] SHI Ming-Hong, WANG Si-Bing, BAI Ying-Cai. A bandwidth constrained Qos routing optimization algorithm. IEEE Network ,
2002,12(2):P491-P494
[37] Michalareas T, Sacks L. Link-state and ant-like algorithm behavior for single-constrained routing. High Performance Switching and Routing, 20011EEE Workshop on, 29-31 May 2001:P302-P305
[38] Hwa-Chun Lin, Hsin-Liang Lai, Shou-Chuan Lai. Automatic link layer topology discovery of IP networks. Communications, 1999. ICC' 99. 1999 IEEE International Conference on, Yolume 2,6-10 June 1999:PlO34-P1038
[39] Kawabe R, Ata S, Murata M, etc. On performance prediction of address lookup algorithm of IP routers through simulation and analysis techniques. Communications, 2002. ICC 2002. IEEE International Conference on ,Volume:4,28 April-2 May 2002:P2146-P2151
[40] Dullaert J.C.,Rahman M.H.,Mouftah H.T..Delivering end-to-end quality of service through an Internet protocol based differentiated services domain. Electrical and Computer Engieering, 2001. Canadian Conference on, Volume:1, 13-16 May 2001:P335-P341
[41] Qin G.,Ata .S, Oka I.,Fujiwara C..Effective bit selection methods for improving performance of packet classifications on IP routers. Global Telecommunications Conference, 2002. GLOBECOM' 02. IEEE, Volume:3,17-21 Nov, 2002:P2350-P2354
[42] Krasser S.,Owen H.L.,Barlow D.A.,etc..Evaluation of the local sate fair share bandwidth algorithm. Telecommunications, 2003.ICT 2003.10th International Conference on, Volume:2,23 Feb-1 March 2003:P911-P916
[43] Berger M..IP lookup with low memory requirement and fast update. High Performance Switching and Routing, 2003, HPSR. Workshop on, 24-27 June 2003:P28?-P291
[44] Hariri S.,Kartik Dev A.J.,SeungChan Oh, etc..Adaptive quality of service resource management in IP networks. Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International
Conference on, 14-18 July 2003:P40
[45] Joutsensal J.,Hamalainen T.,Paakkonen M.,Sayenko A. Adaptive weighted fair scheduling method for channel allocation. Communications, 2003. ICC' 03. IEEE International Conference on, Volume:1, 11-15 May 2003:P228-P232 ,
[46] Keshav S.,Sharma R..Issues and trends in touters design. Communications Magzine, IEEE. Volume:36, Issue:5, May 1998:P144-P151
[47] 陶宏才．数据库原理与应用设计．西南交通大学出版社，2001，9
[48] 萨师煊，王珊．数据库系统概论．第3版．高等教育出版社．2000
[49] OteyM．；ConteP．；陈恩义．SQL Server 2000开发指南．清华大学出版社，2002
[50] Microsoft Corporation Microsoft Corporation．Microsoft SQL Server 2000 XML和Internet支持．北京：科学出版社，2000
[51] 张长富．Microsoft SQL Server 2000数据库编程．北京：北京希望电子出版社，2001．5