CN1929439A - Data transmission method based on domain-segmentation in elastic sectionalized loop network - Google Patents

Data transmission method based on domain-segmentation in elastic sectionalized loop network Download PDF

Info

Publication number
CN1929439A
CN1929439A CNA2005100987989A CN200510098798A CN1929439A CN 1929439 A CN1929439 A CN 1929439A CN A2005100987989 A CNA2005100987989 A CN A2005100987989A CN 200510098798 A CN200510098798 A CN 200510098798A CN 1929439 A CN1929439 A CN 1929439A
Authority
CN
China
Prior art keywords
node
data message
territory
message
domain addresses
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2005100987989A
Other languages
Chinese (zh)
Other versions
CN100448229C (en
Inventor
黄本鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
New H3C Technologies Co Ltd
Original Assignee
Hangzhou Huawei 3Com Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Huawei 3Com Technology Co Ltd filed Critical Hangzhou Huawei 3Com Technology Co Ltd
Priority to CNB2005100987989A priority Critical patent/CN100448229C/en
Publication of CN1929439A publication Critical patent/CN1929439A/en
Application granted granted Critical
Publication of CN100448229C publication Critical patent/CN100448229C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Small-Scale Networks (AREA)

Abstract

This invention discloses one spring set ring network data transmission method based on area cutting, which comprises the following steps: a, through setting area address to divide area spring set points into different areas; b, adding area address to spring set ring data message of source point; c, spring set ring network joints use data message area address and aim point; d, removing said address from aim joints to get spring set data message. The invention uses similar two layers of Ethernet VLAN function to realize RPR ring network area cutting.

Description

In the elastic packet loop network based on the data transmission method of cutting apart by the territory
Technical field
The present invention relates to data message processing method in the elastic packet loop network, in particularly a kind of elastic packet loop network based on the data transmission method of cutting apart by the territory.
Background technology
RPR (Resilient Packet Ring, Resilient Packet Ring) is a kind of MAC (Media AccessControl, medium access control) layer protocol, the position of its hierarchy in OSI Reference Model as shown in Figure 1, the RPR layer is corresponding to data link layer, and this layer is further divided into MAC datapath sublayers, MAC control sublayer and logical link control sublayer (claiming the MAC client layer again).In MAC control sublayer, realize fair algorithm, topology and protection, operation management maintain function.The MAC datapath sublayers is by PHY service interface and physical layer communication, and MAC control sublayer is by MAC service interface and link layer communications.The RPR agreement is supported the protocol massages of data message, control message, fair message and four kinds of forms of idle message.Wherein have only data message to provide service towards the upper strata; Other three kinds of messages only between the RPR network node as seen, be sightless to the upper strata, these messages are used for realizing the control and the management of RPR network loop.
The network that forms based on the RPR agreement is an elastic packet loop network, as shown in Figure 2.This network is reciprocal dicyclo topological structure, comprise: node 11, node 12, node 13, node 14 and node 15, every section on the ring is operated on the same speed, the dicyclo of RPR can both transmit data, the upper layer data message enters the RPR network from source node 11, can pass through outer shroud (node 11 to node 12 to node 13) or interior ring (node 11 to node 15 to node 14 to node 13) and arrive destination node 13.
In the RPR network, node mainly contains the data message and uploads, downloads, passes by, rejects four kinds of action types.Wherein, upload operation is: the RPR source node is inserted into the RPR data message on the RPR looped network; Down operation is: destination node receives data from the data flow of RPR looped network, gives the father of node and does respective handling; Pass by and be operating as:, will continue to be forwarded to next node by way of the RPR of this node data message when the RPR node is not this RPR message destination node and the premature situation of TTL; Rejecting is operating as: in the RPR destination node, perhaps source node perhaps under the overdue situation of Ye Wu TTL, no longer down transmits the message of this node of approach.
Yet, whole RPR looped network is regarded as a big territory, can directly carry out the mutual of message between each node, the data message of transmission is transparent to all nodes, and whether analysis judgment is carried out to all broadcasting packets and the message in the multicast group in the RPR upper strata is own needs.Such networking mode can not the restricting data message broadcast domain, for example, (for example metropolitan area network) has 6 tame sites of 5 residential quarters and certain bank on the RPR looped network, under the situation that does not have the territory to cut apart, if operator is arranged on these 11 nodes on the RPR ring, uptown user may be illegal have access to bank data, therefore reduced the fail safe of network.If sub-district and bank respectively are distributed on the ring, avoiding the problems referred to above, but can increase expenses such as wiring cost simultaneously.
In addition, the data message of all broadcasting will be reported the upper-layer protocol of each RPR node, certainly will increase the burden on upper strata, and the upper strata is had bigger impact, and be not easy to realize grouping management.In addition, because the data message of clean culture, multicast and broadcasting all is transparent to all RPR nodes, therefore there is bigger communication security hidden danger, when having problem such as internet worm, will cause the paralysis of whole looped network, be unfavorable for improving the robustness of whole looped network.
Summary of the invention
The problem to be solved in the present invention provides in a kind of elastic packet loop network transfer of data by domain splitting method, to overcome the defective that prior art needs the upper strata Attended Operation and has bigger communication security hidden danger.
For achieving the above object, the invention discloses in a kind of elastic packet loop network based on the data transmission method of cutting apart by the territory, may further comprise the steps:
A1, the node division on the elastic packet loop network is become not same area by domain addresses is set;
B1, in the Resilient Packet Ring data message that source node is uploaded, add domain addresses;
Node utilizes domain addresses and destination address in the described data message to determine destination node on C1, the elastic packet loop network;
D1, described destination node are rejected described domain addresses, obtain the Resilient Packet Ring data message.
The invention also discloses in a kind of elastic packet loop network based on the data transmission method of cutting apart by the territory, may further comprise the steps:
A2, the node division on the elastic packet loop network is become not same area by domain addresses is set;
B2, in the Resilient Packet Ring data message that source node is uploaded, add the territory and divide sign and domain addresses;
In C2, the data message transmission course, node on the elastic packet loop network then changes D2 if the message of sign is divided in the tenaculum territory, if do not support then this data message forwarding to next node;
Node utilizes domain addresses and destination address in the described data message to determine destination node on D2, the elastic packet loop network;
E2, described destination node are rejected described domain addresses, obtain the Resilient Packet Ring data message.
Said method is determined destination node according to following step:
Whether the domain addresses in the judgment data message is identical with the domain addresses of this node, if then whether the destination address in the judgment data message is identical with this node M AC address again, if identical, then this node is a destination node.
Said method can also be determined destination node according to following step:
Whether the destination address in the judgment data message is identical with this node M AC address, if identical, then whether the domain addresses in the judgment data message is identical with the domain addresses of this node again, if then this node is a destination node.
When node detection on the elastic packet loop network is source node to oneself, or time-to-live TTL expires then data message termination transmission.
Described territory is divided sign and is arranged in the Parity Check Bits of basic controlling byte in the Resilient Packet Ring data message frame, or is arranged in the reservation bit of expansion control byte.
Described domain addresses comprises at least one byte after being arranged on protocol type field in the Resilient Packet Ring data message frame.
Described Resilient Packet Ring is monocycle or many rings that above monocycle is formed.
The present invention also provides data transmission method in a kind of loop network,
The message that source node equipment in this looped network is uploaded need is provided with the territory sign, then this message is sent to next equipment, this equipment is judged the message whether this message need receive for its corresponding domain according to territory sign, if then further handle this message, otherwise this message is handed down to its next equipment.
Described territory sign comprises domain addresses or comprises territory division sign and domain addresses.
Compared with prior art, the present invention has the following advantages:
The present invention utilizes the functionality of vlan of similar two layers of Ethernet, the territory of realizing the RPR looped network from the MAC layer is cut apart, thereby the communication (broadcasting, multicast and clean culture) of data message is limited in certain territory scope, have certain broadcasting packet restriction this cutting apart simultaneously, can reduce the processing burden of upper strata irrelevant message.
The present invention divides node grouping by the territory, make the user can be as required, or the real network situation is determined the territory of oneself, and can guarantee that the data message that oneself sends only handles between this domain node, thereby can limit the broadcast domain of data message, alleviate the impact of broadcast storm to a certain extent the upper strata.
Further, the RPR looped network is carried out the territory cut apart, a plurality of nodes are divided into not on the same group by function or performance, be convenient to realize grouping management.
Further, the communication between the RPR network node be may be limited in the territory, non-this territory interior nodes is not handled the data message, thereby improved communication security.
Further, because data message is only handled in the territory, therefore, some network problem in this data message will can not be diffused into other territory, help improving the robustness of whole looped network.
Description of drawings
Fig. 1 is RPR protocol hierarchy structure correspondence position figure in OSI Reference Model;
Fig. 2 is a prior art RPR network structure;
Fig. 3 is the flow chart of one embodiment of the present invention;
Fig. 4 is the flow chart of another embodiment of the present invention;
Fig. 5 is the basic frame assumption diagram of RPR;
Fig. 6 is RPR extension frame structure figure;
Fig. 7 is the structure chart of basic controlling byte in basic frame of RPR or the expansion frame;
Fig. 8 is the structure chart of expansion control byte in basic frame of RPR or the expansion frame;
Fig. 9 is the basic frame assumption diagram of dividing through the territory of RPR;
Figure 10 is the RPR extension frame structure figure that divides through the territory;
Figure 11 is the network structure that the present invention is applied to monocycle RPR;
Figure 12 is the network structure that the present invention is applied to dicyclo RPR.
Embodiment
Below we will be in conjunction with the accompanying drawings, optimum implementation of the present invention is described in detail.At first it is to be noted, the implication of the term of using among the present invention, words and claim can not only only limit to its literal and common implication and go to understand, the implication and the notion that also comprise and then conform to technology of the present invention, this is because we are as the inventor, to suitably provide the definition of term, so that the most appropriate description is carried out in our invention.Therefore, the configuration that provides in this explanation and the accompanying drawing is first-selected embodiment of the present invention, rather than will enumerates all technical characteristics of the present invention.We will recognize to also have the various equivalent scheme or the modifications that can replace our scheme.
Basic principle of the present invention may further comprise the steps as shown in Figure 3:
Step s101 by domain addresses is set, becomes not same area with the node division on the elastic packet loop network.Can the node on the Resilient Packet Ring be divided into different territories according to user's the needs or the factors such as performance characteristics of each node device, to make things convenient for grouping management.Make the node in same territory transmit data according to normal mode; Then can not carry out the mutual of data message for the node in same territory not.
Step s102 when source node is uploaded the Resilient Packet Ring data message, is provided with domain addresses, and this domain addresses is arranged in the data message frame.
Step s103, node utilizes domain addresses and destination address in the described data message to determine destination node on the elastic packet loop network.Wherein, judgement order can manually be set or select: a kind of is whether domain addresses in the first judgment data message is identical with the domain addresses of this node, if then whether the destination address in the judgment data message is identical with this node M AC address again, if identical, then this node is a destination node.Another kind is whether the destination address in the first judgment data message is identical with this node M AC address, if identical, then whether the domain addresses in the judgment data message is identical with the domain addresses of this node again, if then this node is a destination node.
Step s104, destination node is rejected described domain addresses, obtains the Resilient Packet Ring data message.Destination node is removed the domain addresses that is provided with in the data message, recovers the legacy data message, and this message is sent to upper layer network.
In addition, when other network equipments of the technology of the present invention were not supported in existence in the network, method of the present invention need be improved, and basic procedure comprises as shown in Figure 4:
Step s201 by domain addresses is set, becomes not same area with the node division on the elastic packet loop network.
Step s202 when source node is uploaded the Resilient Packet Ring data message, is provided with the territory and divides sign and domain addresses.
Step s203, in the data message transmission course, the node on the elastic packet loop network then changes s204 if the data message of sign is divided in the tenaculum territory, if do not support then this data message forwarding to next node.
Step s204, node utilizes domain addresses and destination address in the described data message to determine destination node on the elastic packet loop network.
Step s205, destination node is rejected described domain addresses, obtains the Resilient Packet Ring data message.
Sign is divided in territory among the present invention and domain addresses all needs to be arranged in the data message frame that transmits on the Resilient Packet Ring.Resilient Packet Ring can be supported basic frame simultaneously and expand the data message of two types of frames, the data message of wherein basic frame format provides support and serves to network layer, and the data message of Extended Superframe Format provides support and serves to link layer protocol (as Ethernet protocol etc.).Basic frame as shown in Figure 5, comprise: TTL (Time To Live, the survival time limit), basic controlling byte BaseControl, target MAC (Media Access Control) address DA (Destination Address, destination address), source MAC SA (Source Address, source address), TTLBase, expanded ring control ExtendedControl, HEC (Header Error Check, Header error check), protocol type ProtocolType, service data unit ServiceDataUnit and FCS (framecheck sequence, Frame Check Sequence).Wherein, TTL accounts for 1 byte, the life span of indicating services on Resilient Packet Ring; BaseControl accounts for 1 byte, the indication basic control information; DA accounts for 6 bytes, and indication receives the destination node address of data; SA accounts for 6 bytes, and indication sends the back end address; TTLBase accounts for 1 byte, should be filled in the numerical value in TTL territory when stores packets enters ring for the first time, and this numerical value can be used for calculating fast the jumping figure of process; ExtendedControl accounts for 1 byte, the control information of indication expanded ring; HEC accounts for 2 bytes, is used for 16 bytes of above header are carried out verification; ProtocolType accounts for 2 bytes, the indication protocol type; ServiceData accounts for the n byte, is used to load payload data information; FCS accounts for 4 bytes, is used for the whole Frame of verification.
The expansion frame increased expansion target MAC (Media Access Control) address DaExtended and extended source MAC Address SaExtended on basic frame basis, and these two extended address all is 6 bytes as shown in Figure 6.
The Parity Check Bits that sign can be arranged on basic controlling byte BaseControl is divided in territory of the present invention.Divide the position of sign in order to clearly demonstrate the territory, at first need to understand the structure of existing BaseControl byte, as shown in Figure 7.From a high position to low level sequence arrangement: RI (Ring Identifer, ring sign bit), account for 1 bit in this byte, be used for indicating services and insert from which ring; FE (Faimess Eligible) accounts for 1 bit, and indicating services is followed the constraint of fairness algorithm; FT (Frame Type, frame type) accounts for 2 bits, can be divided into data, justice, control and idle four kinds of states; SC (Service Class, grade of service indication) accounts for 2 bits, is divided into A0, A1, B and four grades of C; WE (Wrap Eligible) accounts for 1 bit, but whether indicating services can conduct interviews at the loopback node; Parity accounts for 1 bit, is Parity Check Bits, keeps.Because 1 bit that Parity takies for keeping the position, therefore, can utilize this bit to increase the territory and divide flag information; For example, the Parity for the Resilient Packet Ring that has territory division sign is 1.On the RPR network during node receiving data packets, this bit of check earlier is to determine whether by the territory division operation.
The reservation bit that sign can be arranged on expansion control byte ExtendedControl is divided in territory of the present invention, divides the position of sign in order to clearly demonstrate the territory, at first needs to understand the structure of existing ExtendedControl byte, as shown in Figure 8.EF (Extended Frame, expansion frame bit) is used for indication expansion frame type; FF (Flooding Form, inundation indication) 2 bits are used for indicating the current inundation frame that has on monocycle or dicyclo; PS (Past Source is through source node) is used for judging whether grouping is in time peeled off; SO (Strict Order transmits bit in order), if this bit is set up, the expression frame must arrive destination node in proper order according to strictness; RES is a reservation bit.Because 3 bits that RES takies for keeping the position, therefore, can utilize this three bit to increase the territory and divide flag information; For example, the RES for the Resilient Packet Ring that has territory division sign is 001.Certainly, also can have the territory and divide sign, can be suitable for such as from 001 to 111 with other RES value representation.On the RPR network during node receiving data packets, this bit of check earlier is to determine whether by the territory division operation.
When division sign in territory is set, also need to be provided with domain addresses, among the present invention with the different territory of concrete division.This domain addresses also needs to be arranged in the data message frame that transmits on the Resilient Packet Ring, its structure in basic frame and expansion frame is respectively as Fig. 9 and shown in Figure 10, basic skills is all identical, it all is the DOMAINID field of between protocol type ProtocolType field and ServiceDataUnit field, having added 1 byte, the DOMAINID field is used for indicating which territory this RPR data message belongs to, and the span of DOMAINID is 0~255.In this programme, DOMAINID is masked as 1 byte, certainly, can realize the effect similar to this programme equally more than the sign of a byte.Also have, though the DOMAINID sign is arranged between ProtocolType field and the ServiceDataUnit field in this programme, it is suitable equally in fact this field to be arranged on other position.
Below in conjunction with RPR real network structure explanation the specific embodiment of the present invention, as shown in figure 11, on the RPR ring, 6 nodes are arranged, be respectively node 21, node 22, node 23, node 24, node 25 and node 26, wherein, setting is for a certain basic frame data message traffic, and node 21 is a source node, and node 24 is a destination node.At first, with the node in this RPR network by territory grouping, for example with node 21, node 23 and node 24 minutes in same territory, promptly have same domain addresses, be assumed to be 1; And node 22, node 25 and node 26 minutes be in same territory, and domain addresses is 2.When the data message of upper layer network enters the RPR network from source node 21, the Parity Check Bits among the basic controlling byte BaseControl in source node 21 place's data messages is set to 0, represents that this data message has the territory and cuts apart sign.Simultaneously, increase by 1 byte field address field DOMAID between protocol type ProtocolType field and ServiceDataUnit field, source node 21 predefined domain addresses are mapped in the domain addresses field, promptly the DOMAID field is set to 00000001.
After node 22 receives this data message, the parity check bit in the reading of data message at first, the parity check bit that obtains in this data message is 0, this data message is described with domain addresses grouping, then whether the domain addresses in the DOMAID field is identical with the domain addresses that this node 22 sets in advance in the check data message.Because the domain addresses of this node 22 is 2, and the domain addresses in the data message is 1, illustrates that node 21 and node 22 do not belong to same territory, should not receive this data message, promptly data message is not transferred to the upper layer network of this node.At this moment, also need to detect the ttl field in the data message, if this field is 0, illustrate, this data message time-to-live on the RPR network arrives, and this data message need not be transmitted to next node; If ttl field is not 0, illustrate that then this data message can also survive on the RPR network, continue to be transmitted to next node, and the address of ttl field done subtract 1 operation.
After node 23 receives data message, carry out the detecting operation identical with node 22.Judge with data message when node 23 to belong to same territory, whether the target MAC (Media Access Control) address that then continues in the judgment data message is identical with this node MAC Address; Because the destination node of this data message is a node 24, is not node 23, therefore, the MAC Address in the data message is different with this node MAC Address, should not receive this data message, promptly data message is not transferred to the upper layer network of this node.At this moment, also need to detect the ttl field in the data message, if this field is 0, illustrate that this data message time-to-live on the RPR network arrives, this data message need not be transmitted to next node; If ttl field is not 0, illustrate that then this data message can also survive on the RPR network, continue to be transmitted to next node, and the address of ttl field done subtract 1 operation.
After node 24 receives data message, carry out above-mentioned same operation, when node 24 learns that by judgement the domain addresses in the data message is identical with the domain addresses of this node, and the target MAC (Media Access Control) address in the data message is identical with the MAC Address of this node, determine that then this node is a destination node, and the domain addresses field in the data message rejected, and data message is sent to the upper layer network of this node.At this moment, this data message does not send to next node, terminates on the RPR network.
Above-mentioned example has illustrated the situation of a destination node, in fact exists the situation of a plurality of destination nodes suitable equally.Just after data message arrives destination node, deliver to the upper layer network of this node, and continue to transmit to next node along the RPR network.In addition, when a data message when RPR transmission over networks one circle is got back to source node, the domain addresses field in the data message is rejected, termination sends.
The present invention is not only applicable to single RPR network, also can be useful for many ring RPR networks, as shown in figure 12, comprise node 31-39, wherein, node 31, node 32, node 33, node 34 and node 35 are the A subnet, and node 31, node 36, node 37, node 38 and node 39 constitute the B subnet, and two subnets link together by node 31.The MAC Address that many ring RPR networks are formed by the network address and node address can unique any one node of determining on many RPR network, wherein, the network address is used to distinguish different sub-network (subnet A and subnet B), and node address is used for distinguishing the different nodes of same subnet.
Data message transmission method and single RPR network data message transmitting method for many RPR network are basic identical.But the standard that the territory is divided among this embodiment can be set flexibly, can be same territory with the several node division in the same subnet, is set to same territory as node 32, node 34 and node 35; Several nodes that also can different sub-network are set to same territory, are set to same territory as node 33, node 37 and node 38.In the prior art, source node is from the upper layer network receiving data packets, and the mode by clean culture, group newspaper or broadcasting is in the RPR transmission over networks.Source node described here is divided into two kinds, and a kind of is the source node of dividing by the territory, and another kind is the standard source node of not dividing by the territory, need the territory be set to the data message for the source node of dividing by the territory and divide sign and domain addresses field; For the standard source node, according to the prior art data message transmission.When receiving data, sign is divided in the territory of detecting in the data message, if do not have, then handles according to prior art for other node on the RPR network; If have, then determine again this data message whether with this node in same territory, if not in same territory, then this data message is not sent to the upper layer network of this node, and determines to continue to be transmitted to next node, or stop sending according to the situation of TTL; If belong to same territory, judge again then whether the target MAC (Media Access Control) address in this data message is identical with the MAC Address of this node, if identical, send to the upper layer network of this node after then data message being rejected the domain addresses field, and send to next node or stop sending; If different, then this data message is not sent to the upper layer network of this node, stop sending or sending to next node according to the situation of TTL.When this data message arrives source node, stop sending.
The invention also discloses data transmission method in a kind of loop network, the message that source node equipment in this looped network is uploaded need is provided with the territory sign, then this message is sent to next equipment, this equipment is judged the message whether this message need receive for its corresponding domain according to territory sign, if then further handle this message, otherwise this message is handed down to its next equipment.Wherein, described territory is masked as the territory and divides sign and domain addresses, perhaps includes only domain addresses.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.

Claims (10)

1, in a kind of elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that, may further comprise the steps:
A1, the node division on the elastic packet loop network is become not same area by domain addresses is set;
B1, in the Resilient Packet Ring data message that source node is uploaded, add domain addresses;
Node utilizes domain addresses and destination address in the described data message to determine destination node on C1, the elastic packet loop network;
D1, described destination node are rejected described domain addresses, obtain the Resilient Packet Ring data message.
2, in a kind of elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that, may further comprise the steps:
A2, the node division on the elastic packet loop network is become not same area by domain addresses is set;
B2, in the Resilient Packet Ring data message that source node is uploaded, add the territory and divide sign and domain addresses;
In C2, the data message transmission course, node on the elastic packet loop network then changes D2 if the message of sign is divided in the tenaculum territory, if do not support then this data message forwarding to next node;
Node utilizes domain addresses and destination address in the described data message to determine destination node on D2, the elastic packet loop network;
E2, described destination node are rejected described domain addresses, obtain the Resilient Packet Ring data message.
3, as claimed in claim 1 or 2 in the elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that, determine destination node according to following step:
Whether the domain addresses in the judgment data message is identical with the domain addresses of this node, if then whether the destination address in the judgment data message is identical with this node M AC address again, if identical, then this node is a destination node.
4, as claimed in claim 1 or 2 in the elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that, determine destination node according to following step:
Whether the destination address in the judgment data message is identical with this node M AC address, if identical, then whether the domain addresses in the judgment data message is identical with the domain addresses of this node again, if then this node is a destination node.
5, as in the elastic packet loop network as described in the claim 2 based on the data transmission method of cutting apart by the territory, it is characterized in that when node detection on the elastic packet loop network is source node to oneself, or time-to-live TTL expires, then data message stops sending.
6, as in the elastic packet loop network as described in the claim 2 based on the data transmission method of cutting apart by the territory, it is characterized in that, described territory is divided sign and is arranged in the Parity Check Bits of basic controlling byte in the Resilient Packet Ring data message frame, or is arranged in the reservation bit of expansion control byte.
7, as claimed in claim 1 or 2 in the elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that described domain addresses comprises at least one byte after being arranged on protocol type field in the Resilient Packet Ring data message frame.
8, as claimed in claim 1 or 2 in the elastic packet loop network based on the data transmission method of cutting apart by the territory, it is characterized in that described Resilient Packet Ring is monocycle or many rings that above monocycle is formed.
9, data transmission method in a kind of loop network is characterized in that:
The message that source node equipment in this looped network is uploaded need is provided with the territory sign, then this message is sent to next equipment, this equipment is judged the message whether this message need receive for its corresponding domain according to territory sign, if then further handle this message, otherwise this message is handed down to its next equipment.
10, data transmission method according to claim 9 is characterized in that: described territory sign comprises domain addresses or comprises territory division sign and domain addresses.
CNB2005100987989A 2005-09-07 2005-09-07 Data transmission method based on domain-segmentation in elastic sectionalized loop network Expired - Fee Related CN100448229C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2005100987989A CN100448229C (en) 2005-09-07 2005-09-07 Data transmission method based on domain-segmentation in elastic sectionalized loop network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2005100987989A CN100448229C (en) 2005-09-07 2005-09-07 Data transmission method based on domain-segmentation in elastic sectionalized loop network

Publications (2)

Publication Number Publication Date
CN1929439A true CN1929439A (en) 2007-03-14
CN100448229C CN100448229C (en) 2008-12-31

Family

ID=37859229

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2005100987989A Expired - Fee Related CN100448229C (en) 2005-09-07 2005-09-07 Data transmission method based on domain-segmentation in elastic sectionalized loop network

Country Status (1)

Country Link
CN (1) CN100448229C (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104753753A (en) * 2013-12-31 2015-07-01 杭州华为数字技术有限公司 QPI message transmission method and device and computer system
CN108347385A (en) * 2018-05-14 2018-07-31 新华三技术有限公司 Applied to the message broadcasting method and apparatus in Resilient Packet Ring RPR
CN114598569A (en) * 2022-02-25 2022-06-07 中铁第四勘察设计院集团有限公司 Network architecture
CN116866457A (en) * 2023-09-04 2023-10-10 常州楠菲微电子有限公司 Loop detection message processing method and device for two-layer network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030074469A1 (en) * 2001-10-15 2003-04-17 Alcatel Method and apparatus for transparent LAN-to-LAN connection between two customer locations through a RPR data transport network
EP1324542A1 (en) * 2001-12-26 2003-07-02 Alcatel Method for interconnecting a number of RPR rings in a wide area RPR network
JP4052956B2 (en) * 2003-02-07 2008-02-27 富士通株式会社 RPR network system, station node, bridge node and RPR card
US7441039B2 (en) * 2003-12-04 2008-10-21 Exar Corporation Method and apparatus for adapting mac and network processor core to packet format changes and for mapping RPR architecture over spatial reuse architecture
CN1264317C (en) * 2003-12-09 2006-07-12 上海交通大学 Method for multi-ring interconnection transmission of resilient packet ring network

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104753753A (en) * 2013-12-31 2015-07-01 杭州华为数字技术有限公司 QPI message transmission method and device and computer system
CN108347385A (en) * 2018-05-14 2018-07-31 新华三技术有限公司 Applied to the message broadcasting method and apparatus in Resilient Packet Ring RPR
CN108347385B (en) * 2018-05-14 2021-05-28 新华三技术有限公司 Message broadcasting method and device applied to Resilient Packet Ring (RPR)
CN114598569A (en) * 2022-02-25 2022-06-07 中铁第四勘察设计院集团有限公司 Network architecture
CN114598569B (en) * 2022-02-25 2023-10-03 中铁第四勘察设计院集团有限公司 Network architecture
CN116866457A (en) * 2023-09-04 2023-10-10 常州楠菲微电子有限公司 Loop detection message processing method and device for two-layer network

Also Published As

Publication number Publication date
CN100448229C (en) 2008-12-31

Similar Documents

Publication Publication Date Title
CN101827025A (en) Communication network multicast protection method, system and device
CN1578252A (en) Architecture for bridged Ethernet residential access networks
CN1897589A (en) Access apparatus, routing equipment and method for supporting IPv6 stateless address configuration in telecommunication network
CN1859443A (en) Method for distributing terminal device IP address under router
CN1467958A (en) Apparatus and method of searching for dns server in outernet
CN1822570A (en) Automatic discovery of psuedo-wire peer addresses in ethernet-based networks
CN1863069A (en) Method for implementing fast switching of virtual special LAN service
CN101534226A (en) VLAN-based whole network loop detection method and loop detection equipment
CN1176532C (en) Automatic building method for realizing specific operation maintenance channel in 3G base station
WO2005107176A1 (en) Method for transferring message in a resilient packet ring network
US20070097971A1 (en) Method of generating and managing connection identifiers for supporting multicast for each group in IPv6-based wireless network and network interface using the method
CN101068170A (en) Message abnormal receiving detecting method, system and device thereof
CN1859304A (en) Method for realizing neighbour discovery
CN102821009A (en) Method for monitoring ring network on basis of link layer discovery protocol and device
WO2003051000A3 (en) Method and device for broadcast in point-to-point packet networks
CN1809032A (en) Method of dynamically learning address on MAC layer
CN101051983A (en) Construction method for reliable RPR circular net and relative RPR station device
CN1412979A (en) Method for implementing management function by means of exchanging data paket and its correspondet packet frame
CN101030912A (en) Fast ring network method against attack based on RRPP, apparatus and system
CN1929439A (en) Data transmission method based on domain-segmentation in elastic sectionalized loop network
CN1852234A (en) Method for transmitting message
CN1878036A (en) Method for convergence of control-plane route in intelligent optical network
CN1889501A (en) Method and system for deciding bridge role
CN1859376A (en) Link backup method based on route
CN101043433A (en) Method for aging MAC address learning list of bridge mode resilient packet ring

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CP03 Change of name, title or address

Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No.

Patentee after: NEW H3C TECHNOLOGIES Co.,Ltd.

Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base

Patentee before: HANGZHOU H3C TECHNOLOGIES Co.,Ltd.

CP03 Change of name, title or address
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20081231

CF01 Termination of patent right due to non-payment of annual fee