CN100421395C - Method based on elastic group ring for obtaining link evaluating parameter - Google Patents

Method based on elastic group ring for obtaining link evaluating parameter Download PDF

Info

Publication number
CN100421395C
CN100421395C CNB200510103481XA CN200510103481A CN100421395C CN 100421395 C CN100421395 C CN 100421395C CN B200510103481X A CNB200510103481X A CN B200510103481XA CN 200510103481 A CN200510103481 A CN 200510103481A CN 100421395 C CN100421395 C CN 100421395C
Authority
CN
China
Prior art keywords
time
message
data message
response data
reception
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.)
Expired - Fee Related
Application number
CNB200510103481XA
Other languages
Chinese (zh)
Other versions
CN1863100A (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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB200510103481XA priority Critical patent/CN100421395C/en
Priority to PCT/CN2006/001765 priority patent/WO2007033555A1/en
Publication of CN1863100A publication Critical patent/CN1863100A/en
Application granted granted Critical
Publication of CN100421395C publication Critical patent/CN100421395C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • H04L43/0888Throughput

Abstract

The present invention provides a method based on an elastic group ring for obtaining a link evaluating parameter. The kernel is that a sending node sends request data messages to an opposite end node, the sending node acquires the sending time for sending each request data message, the receiving time for receiving response data messages returned by an opposite end node, and the time of the opposite end processing each request data message and each response data message. The sending node determines the link evaluating parameter according to the sending time, the receiving time and the processing time. When the present invention determines the link evaluating parameter such as transmission delay and judder, the present invention sufficiently considers the processing time of the nodes to the data messages in an RPR (resilient packet ring) ring network, and prevents the processing time of the nodes to the data messages from influencing the accuracy of the link evaluating parameter. The present invention can rapidly and accurately determine the link evaluating parameter in order to realize the purposes of increasing the accuracy of the link evaluating parameter and the maintainability of the RPR ring network.

Description

A kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring
Technical field
The present invention relates to the network communications technology field, be specifically related to a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring.
Background technology
RPR (Resilient Packet Ring, Resilient Packet Ring) technology integrates the intellectuality of IP (Internet protocol), the economy of Ethernet and high bandwidth efficiency, the reliability of optical fiber ring network, for broadband IP metropolitan area network operator provides a good networking plan.
The RPR technology makes operator provide the carrier-class service to become possibility with low cost in metropolitan area network, and has reduced the transmission expense when similar SDH (synchronous digital hierarchy) level network reliability is provided.It is to have the carrier-class reliability that RPR is different from the most attracting characteristics of traditional MAC (medium access control), and RPR not only is confined to handle data-oriented professional transmission demand, simultaneously, can form and handle the comprehensive transmission solution that multi-service transmits.
The topological structure of RPR looped network as shown in Figure 1.
Among Fig. 1, the topological structure of RPR looped network and SDH topological structure are similar, and the RPR looped network is reciprocal dicyclo topological structure, and every section light path on the ring is operated on the same speed, and the dicyclo in the RPR looped network can both transmit data, and these two rings are hereinafter referred to as outer shroud and interior ring.The data transmission direction of outer shroud is a clockwise direction, and the data transmission direction of interior ring is counterclockwise.
Clearly do not propose the method for chain circuit evaluatings such as test data message transmissions time delay, shake, packet loss in the RPR agreement, at present, the method for chain circuit evaluatings such as test data message transmissions time delay, shake is:
In the RPR looped network, send the echo message of RPR agreement regulation, determine the transmitting time and the time of reception of echo message, the difference of time of reception and transmitting time is defined as the propagation delay time of message transmission link, then, can come the shake of specified data message transmission link according to a plurality of propagation delay times.
In this method, the difference of time of reception and transmitting time has comprised node in the RPR looped network to processing time of echo message, as the processing time of CPU in the node etc., because CPU etc. is bigger than the propagation delay time of link to the processing time of echo message, thereby make the chain circuit evaluatings such as propagation delay time, shake of link in the RPR looped network inaccurate.
Summary of the invention
The objective of the invention is to, a kind of method of obtaining chain circuit evaluating based on RPR is provided, avoided of the influence of the data message processing time of peer node, realized improving the purpose of chain circuit evaluating accuracy the chain circuit evaluating accuracy.
For achieving the above object, a kind of method of obtaining chain circuit evaluating based on RPR provided by the invention comprises:
A, sending node send the request msg message to peer node;
The time of reception of the response data message that b, sending node recorder peer node return, temporal information in the response data message that the verification peer node returns, and after verification is correct, obtain its transmitting time that sends each request msg message, and the opposite end to processing time of each request msg message, response data message;
C, sending node are determined chain circuit evaluating according to described transmitting time, time of reception, processing time.
Described step a specifically comprises:
Sending node is carried on the transmitting time of request msg message in the request msg message and is sent to peer node.
Described step b specifically comprises:
B1, peer node are carried on the transmitting time of carrying in the time of reception of its reception request msg message, the transmitting time that sends the response data message, the request msg message in the response data message and are back to sending node;
B2, sending node write down its time of reception that receives the response data message that peer node returns;
Temporal information in the response data message that b3, sending node verification peer node return, and after verification is correct, from the temporal information of response data message carrying, obtain the transmitting time of its transmitting time that sends the request msg message, peer node transmission response data message and the time of reception of reception request msg message;
B4, sending node are defined as the processing time of peer node to corresponding request msg message, response data message with the transmitting time of peer node and the difference of time of reception.
Comprise in the described request data message: request msg message identification information, the first transmitting time field of carrying request msg message transmitting time, carrying peer node receive the time of reception field of the time of request msg message, the second transmitting time field that the carrying peer node sends the time of response data message, the check information that reaches first transmitting time, second transmitting time and time of reception.
Described step b1 specifically comprises:
When peer node carries described identification information in the request msg message of determining its reception, first transmitting time, second transmitting time and the time of reception that carries in the request msg message carried out verification according to the check information in the request msg message of its reception;
Described peer node is when definite verification is correct, with its receive the time of reception of this request msg message, the transmitting time that sends the response data message is carried in this request msg message, and be provided with verification and after, with this request msg message in response data message be back to sending node.
Described step b3 specifically comprises:
When sending node carries described identification information in the response data message of determining its reception, first transmitting time, second transmitting time and the time of reception that carries in the response data message carried out verification according to the check information in the response data message of its reception;
Sending node is when definite verification is correct, first transmitting time of carrying in the response data message that the verification of its reception is correct is defined as the transmitting time that it sends corresponding request msg message, and the difference of the time of reception that carries in the response data message that verification is correct and second transmitting time is defined as the processing time of peer node to corresponding request msg message, response data message.
Described chain circuit evaluating comprises: propagation delay time and/or shake.
Described chain circuit evaluating is: propagation delay time, and described step c specifically comprises:
Determine the moment propagation delay time of the transmission link of corresponding request msg message and response data message respectively according to each time of reception and the difference in transmitting time and processing time;
The mean value of propagation delay time is determined the propagation delay time of transmission link moment according to each.
Described chain circuit evaluating is: shake, and described step c specifically comprises:
Sending node is determined the moment propagation delay time of the transmission link of corresponding request msg message and response data message respectively according to each time of reception and the difference in transmitting time and processing time;
Sending node according to continuous adjacent moment propagation delay time the mean value of difference determine the shake of transmission link.
Described chain circuit evaluating also comprises: packet loss, and described method also comprises:
Sending node writes down the reception number of the correct response data message of the verification of its transmission number that sends the request msg message and reception thereof;
Sending node determines to receive the difference between number and the transmission number, and determines the packet loss of the transmission link of request msg message and response data message according to described difference and the ratio that sends number.
Described request data message, response data message are: OAM (Operations, Administration and Maintenance) data message.
Description by technique scheme as can be known, the present invention is when definite chain circuit evaluating such as propagation delay time, shake, taken into full account node in RPR (Resilient Packet Ring) looped network to processing time of data message, avoided node the influence of processing time of data message to the chain circuit evaluating accuracy; Sending node is when sending the request msg message, by transmitting time being carried in the request msg message, peer node is when sending the response data message, be carried in the response data message by the time of reception that it is received the request msg message, the transmitting time that sends the response data message, make sending node can determine the processing time of peer node easily the data message; By in the request msg message, check information being set, avoided data message in transmission course, to make temporal information unusual owing to other factors, cause the inaccurate phenomenon of chain circuit evaluating; Realized improving the purpose of chain circuit evaluating accuracy, raising RPR looped network maintainability by technical scheme provided by the invention.
Description of drawings
Fig. 1 is the topological structure schematic diagram of RPR looped network;
Fig. 2 is the method flow diagram that obtains chain circuit evaluating based on RPR of the present invention.
Embodiment
Chain circuit evaluating is an important parameter of estimating link transmission performance, for improving the accuracy of chain circuit evaluating, when the chain circuit evaluating of specified data message transmission link, need take into full account node in RPR (Resilient Packet Ring) looped network to processing time of data message.
Core of the present invention is: sending node sends each request msg message to peer node, sending node obtains its transmitting time that sends each request msg message, receive the time of reception of the response data message that peer node returns and the opposite end processing time to each request msg message, response data message, and sending node is determined chain circuit evaluating according to described transmitting time, time of reception, processing time.
Based on core concept of the present invention technical scheme provided by the invention is further described below.
Sending node of the present invention is when sending the request msg message, transmitting time need be carried in the request msg message, peer node is when receiving the request msg message, it need be received the time of reception of request msg message, the transmitting time that sends this request msg message corresponding response data message and the transmitting time in the request msg message and be carried in the response data message, be back to sending node.
Sending node is when receiving the response data message, write down the time of reception that it receives this data message, and from response data message loaded information, obtain its transmitting time that sends corresponding request msg message, transmitting time that time of reception, peer node that peer node receives corresponding request msg message send this response data message.
The transmitting time of peer node and the difference of time of reception are the processing time of peer node to request msg message and response data message.
Like this, the difference of the time of reception of sending node and transmitting time is the instantaneous propagation delay time of corresponding request msg message and response data message transmission link again with the difference in processing time of peer node.
Sending node is by continuing to send the request msg message, as sending the request msg message according to predetermined time interval, will receive the response data message successively, utilize said method can obtain a plurality of instantaneous propagation delay times, adopt the methods such as mean value of a plurality of instantaneous propagation delay times can determine the propagation delay time of link.
Continuously the delay inequality of the adjacent instantaneous propagation delay time in the front and back that obtain is the instantaneous shake of transmission link, adopts the methods such as mean value of a plurality of instantaneous shakes can determine the shake of transmission link.
For guaranteeing the transmitting time of carrying in request msg message, the response data message, the accuracy of time of reception equal time information, the present invention in request msg message, response data message, increased check information such as verification and, this check information carries out verification to each temporal information in the data message.Like this, peer node can not send the response data message of this request msg message when determining that according to check information the temporal information of carrying in the request msg message is wrong.Sending node when determining that according to check information the temporal information of carrying in the response data message is wrong, can be not with the temporal information of carrying in this response data message as the basic data of determining chain circuit evaluating.
Also should carry the identification information of request msg message in request msg message of the present invention and the response data message, discern this request msg message to make things convenient for peer node, thereby carry out the processing procedure of response data message, also should carry the identification information of response data message in the response data message, making things convenient for sending node to discern this response data message, thereby the response data message is handled.The identification information of request msg message can be identical with the identification information of response data message.
The identification information of above-mentioned data message can realize by the mode that the condition code field is set in data message, and the mode of type of message that also can be by the growth data message realizes.
Sending node among the present invention can also be according to the packet loss of the quantity specified data message transmission link of the response data message of the quantity of the request msg message of its transmission and reception.
Request msg message among the present invention and response data message can be OAM (Operations, Administration and Maintenance) data message.
Below in conjunction with accompanying drawing 2, with the echo message is that example is elaborated to method of the present invention.
Among Fig. 2, be test lead when sending the Echo message, transmitting time be carried in the Echo message at step 2-1, sending node, and the condition code in the relative set Echo message and verification and.
Content relevant with the present invention in the Echo message is as shown in table 1.
Table 1
Condition code (4 byte) Req_Time (A) (4 byte) Req_Time (B) (4 byte) Rsp_Time (B) (4 byte) Verification and (4 byte)
Condition code in the table 1 is mainly used in the Echo message that is used for the test link evaluating among the present existing Echo message of difference and the present invention; Req_Time (A) is used to carry the transmitting time that sending node sends the Echo message, i.e. first transmitting time; Req_Time (B) is used to carry the time of reception that peer node receives the Echo message; Rsp_Time (B) is used to carry the transmitting time that peer node sends the Echo message, i.e. second transmitting time; Verification and be mainly used in the temporal information of carrying in the Echo message is carried out verification, as being added up in Req_Time (A), Req_Time (B) and Rsp_Time (B) territory or carry out CRC computing etc., verification and the accuracy that can guarantee temporal information in the Echo message.The Echo message that sending node sends can be called the request msg message.
Sending node can be on the RPR ring all nodes send Echo messages, thereby, obtain the chain circuit evaluatings such as transmission delay, shake of this node all nodes to the RPR ring.
Transmitting time is being carried on Req_Time (A) field to step 2-2, sending node, and be provided with condition code and verification and after, send the Echo message.
To step 2-3, peer node is that receiving terminal receives the Echo message, and when the condition code in definite Echo message is predetermined value, carry out verification according to the verification in the Echo message with to the temporal information of carrying in the Echo message, and when definite verification is correct, its time of reception that receives the Echo message is carried in Req_Time (B) field, and when the Echo message is back to sending node, transmitting time is carried among the Rsp_Time (B), simultaneously, according to Req_Time (A), Req_Time (B) and Rsp_Time (B) reset in the Echo message verification and.The message format of request msg message and response data message can be identical as can be seen from foregoing description.
To step 2-4, peer node the Echo message is back to sending node.The Echo message that peer node sends can be called the response data message.In this step, peer node can return the Echo message on another one Ringlet.
To step 2-5, sending node when receiving the Echo message and determining that condition code in the Echo message is predetermined value, the time of reception Rsp_Time (A) when writing down it and receiving the Echo message.
Sending node carries out verification according to the verification in the Echo message with to the temporal information of carrying in the Echo message, and when definite verification is correct, obtains Req_Time (A), Req_Time (B) and Rsp_Time (B) from the Echo message.
Carry out following calculating to step 2-6, sending node:
(Rsp_Time (A)-Req_Time (A))-(Rsp_Time (B)-Req_Time (B)); Draw the instantaneous propagation delay time of corresponding Echo message transmission link, promptly from the sending node to the peer node again to the instantaneous propagation delay time of the link of sending node.
Sending node can obtain a plurality of instantaneous propagation delay times according to said method, and the mean value of a plurality of instantaneous propagation delay times can be used as sending node arrives the link of sending node again to peer node propagation delay time.
Difference between two propagation delay times that order obtains be from the sending node to the peer node again to the instantaneous shake of the link of sending node, the mean value of a plurality of instantaneous shakes can be used as sending node arrives the link of sending node again to peer node shake.
In step 2-2, sending node can write down the number of the Echo message of its transmission; In step 2-5, sending node can write down the number of the correct Echo message of the verification of its reception; Sending node determines to send number and the difference that receives number, and this difference and the ratio that sends number is arrived again the packet loss of the link of sending node to peer node as sending node.
The message format of the Echoo message among the present invention is not limited to the form in the above-mentioned table 1, and the message format of the Echo message that Echo message that sending node sends and peer node send can be inequality.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, and the claim of application documents of the present invention comprises these distortion and variation.

Claims (11)

1. the method for obtaining chain circuit evaluating based on Resilient Packet Ring is characterized in that, comprising:
A, sending node send the request msg message to peer node;
The time of reception of the response data message that b, sending node recorder peer node return, temporal information in the response data message that the verification peer node returns, and after verification is correct, obtain its transmitting time that sends each request msg message, and the opposite end to processing time of each request msg message, response data message;
C, sending node are determined chain circuit evaluating according to described transmitting time, time of reception, processing time.
2. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 1 is characterized in that described step a specifically comprises:
Sending node is carried on the transmitting time of request msg message in the request msg message and is sent to peer node.
3. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 2 is characterized in that described step b specifically comprises:
B1, peer node are carried on the transmitting time of carrying in the time of reception of its reception request msg message, the transmitting time that sends the response data message, the request msg message in the response data message and are back to sending node;
B2, sending node write down its time of reception that receives the response data message that peer node returns;
Temporal information in the response data message that b3, sending node verification peer node return, and after verification is correct, from the temporal information of response data message carrying, obtain the transmitting time of its transmitting time that sends the request msg message, peer node transmission response data message and the time of reception of reception request msg message;
B4, sending node are defined as the processing time of peer node to corresponding request msg message, response data message with the transmitting time of peer node and the difference of time of reception.
4. a kind of method of obtaining chain circuit evaluating as claimed in claim 3 based on Resilient Packet Ring, it is characterized in that, comprise in the described request data message: request msg message identification information, the first transmitting time field of carrying request msg message transmitting time, carrying peer node receive the time of reception field of the time of request msg message, the second transmitting time field that the carrying peer node sends the time of response data message, the check information that reaches first transmitting time, second transmitting time and time of reception.
5. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 4 is characterized in that described step b1 specifically comprises:
When peer node carries described identification information in the request msg message of determining its reception, first transmitting time, second transmitting time and the time of reception that carries in the request msg message carried out verification according to the check information in the request msg message of its reception;
Described peer node is when definite verification is correct, with its receive the time of reception of this request msg message, the transmitting time that sends the response data message is carried in this request msg message, and be provided with verification and after, with this request msg message in response data message be back to sending node.
6. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 4 is characterized in that described step b3 specifically comprises:
When sending node carries described identification information in the response data message of determining its reception, first transmitting time, second transmitting time and the time of reception that carries in the response data message carried out verification according to the check information in the response data message of its reception;
Sending node is when definite verification is correct, first transmitting time of carrying in the response data message that the verification of its reception is correct is defined as the transmitting time that it sends corresponding request msg message, and the difference of the time of reception that carries in the response data message that verification is correct and second transmitting time is defined as the processing time of peer node to corresponding request msg message, response data message.
7. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 1 is characterized in that described chain circuit evaluating comprises: propagation delay time and/or shake.
8. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 7 is characterized in that described chain circuit evaluating is: propagation delay time, and described step c specifically comprises:
Determine the moment propagation delay time of the transmission link of corresponding request msg message and response data message respectively according to each time of reception and the difference in transmitting time and processing time;
The mean value of propagation delay time is determined the propagation delay time of transmission link moment according to each.
9. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 7 is characterized in that described chain circuit evaluating is: shake, and described step c specifically comprises:
Sending node is determined the moment propagation delay time of the transmission link of corresponding request msg message and response data message respectively according to each time of reception and the difference in transmitting time and processing time;
Sending node according to continuous adjacent moment propagation delay time the mean value of difference determine the shake of transmission link.
10. a kind of method of obtaining chain circuit evaluating based on Resilient Packet Ring as claimed in claim 7 is characterized in that described chain circuit evaluating also comprises: packet loss, and described method also comprises:
Sending node writes down the reception number of the response data message of its transmission number that sends the request msg message and reception thereof;
Sending node determines to receive the difference between number and the transmission number, and determines the packet loss of the transmission link of request msg message and response data message according to described difference and the ratio that sends number.
11., it is characterized in that described request data message, response data message are: Operations, Administration and Maintenance OAM data message as the described a kind of method of obtaining chain circuit evaluating of arbitrary claim in the claim 1 to 10 based on Resilient Packet Ring.
CNB200510103481XA 2005-09-19 2005-09-19 Method based on elastic group ring for obtaining link evaluating parameter Expired - Fee Related CN100421395C (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CNB200510103481XA CN100421395C (en) 2005-09-19 2005-09-19 Method based on elastic group ring for obtaining link evaluating parameter
PCT/CN2006/001765 WO2007033555A1 (en) 2005-09-19 2006-07-19 Method, device and system for obtaining link performance parameter

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB200510103481XA CN100421395C (en) 2005-09-19 2005-09-19 Method based on elastic group ring for obtaining link evaluating parameter

Publications (2)

Publication Number Publication Date
CN1863100A CN1863100A (en) 2006-11-15
CN100421395C true CN100421395C (en) 2008-09-24

Family

ID=37390432

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB200510103481XA Expired - Fee Related CN100421395C (en) 2005-09-19 2005-09-19 Method based on elastic group ring for obtaining link evaluating parameter

Country Status (2)

Country Link
CN (1) CN100421395C (en)
WO (1) WO2007033555A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012103702A1 (en) * 2011-06-23 2012-08-09 华为技术有限公司 Method and device for detecting 1588 equipment performance
US9276831B2 (en) * 2013-07-18 2016-03-01 Airmagnet, Inc. Determining network latency with limited computing resources
CN107508763B (en) * 2016-06-14 2021-04-13 景略半导体(上海)有限公司 Sending time control method, system and transmission equipment
CN108173718A (en) * 2018-01-29 2018-06-15 赛特斯信息科技股份有限公司 The system and method for BFD link detectings and assessment based on SD-WAN scenes
CN109257246A (en) * 2018-08-09 2019-01-22 华为技术有限公司 Detect the method, apparatus and system of time delay
CN111585790B (en) * 2020-04-13 2022-05-06 中国联合网络通信集团有限公司 Network simulation method and device
CN115150251B (en) * 2022-05-27 2023-11-03 中国南方电网有限责任公司 Fault diagnosis method, system and management platform for dispatching communication link of power private network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000025487A1 (en) * 1998-10-27 2000-05-04 Telefonaktiebolaget Lm Ericsson (Publ) Determination of the propagation delay in a packet switched network
WO2004030312A1 (en) * 2002-09-30 2004-04-08 Koninklijke Philips Electronics N.V. Verifying a node on a network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100377535C (en) * 2004-07-22 2008-03-26 华为技术有限公司 Dynamic elastic packet ring network monitoring method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000025487A1 (en) * 1998-10-27 2000-05-04 Telefonaktiebolaget Lm Ericsson (Publ) Determination of the propagation delay in a packet switched network
WO2004030312A1 (en) * 2002-09-30 2004-04-08 Koninklijke Philips Electronics N.V. Verifying a node on a network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
IP网络分组时延的测量. 林芳,冯玉珉.通信世界. 2004
IP网络分组时延的测量. 林芳,冯玉珉.通信世界. 2004 *
Part 17:Resilient packet ring (RPR) access method and physical layer specifications. LAN/MAN Standards Committee.IEEE Standards 802.17TM. 2004
Part 17:Resilient packet ring (RPR) access method and physical layer specifications. LAN/MAN Standards Committee.IEEE Standards 802.17TM. 2004 *

Also Published As

Publication number Publication date
WO2007033555A1 (en) 2007-03-29
CN1863100A (en) 2006-11-15

Similar Documents

Publication Publication Date Title
CN100421395C (en) Method based on elastic group ring for obtaining link evaluating parameter
US7525923B2 (en) Catprobe
US7830809B2 (en) Methods and apparatus for characterizing a route in a fibre channel fabric
US7474631B2 (en) On-demand group communication services with quality of service (QoS) guarantees
KR20080063331A (en) Provision of a move indication to a resource requester
CN101543101A (en) Method and apparatus for reducing the signalling bandwidth load by reporting measurements in differential manner in a multicast message
CN112468372A (en) Equipment state detection method and device in power line communication network
CN103416022A (en) In-service throughput testing in distributed router/switch architectures
CN109728967A (en) Communication quality detection method, communication equipment and system
EP2337280A1 (en) Method to manage an opportunistic communication network
CN110290020B (en) High-precision flow percentage generation method and device for Ethernet tester
CN111478865A (en) TCP stream reconfiguration technology based on interval management algorithm
US20180367290A1 (en) Selective proxy to alleviate adjacent channel interference in full duplex cable network environments
CN107171957B (en) Self-adaptive DTN routing algorithm based on resource limited condition
CN113162855B (en) Multicast message detection method, network equipment and system
CN106357478B (en) A kind of server cluster monitoring method and system
CN103701626B (en) The preparation method of bandwidth information and the equipment for obtaining bandwidth information
CN111400653A (en) Robustness analysis model evaluation method based on multi-path transmission system
CN116346634A (en) State sensing information processing method and device of network management and control system and electronic equipment
CN112910795B (en) Edge load balancing method and system based on many sources
Topor-Kaminski et al. Selected methods of measuring the delay in data transmission systems with wireless network interfaces
CN105450710B (en) Method for establishing the direct communication of user to user in gateway
CN100426774C (en) Ring-closure determining method and device for resilient packet ring
CN101114947A (en) Method for measuring performance of cooperative communication system
CN114039888B (en) Time delay measurement method and device

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080924

Termination date: 20120919