US8179806B2 - Device, method, and program for estimating quality-degraded location of communication network, and communication network system - Google Patents

Device, method, and program for estimating quality-degraded location of communication network, and communication network system Download PDF

Info

Publication number
US8179806B2
US8179806B2 US12/187,659 US18765908A US8179806B2 US 8179806 B2 US8179806 B2 US 8179806B2 US 18765908 A US18765908 A US 18765908A US 8179806 B2 US8179806 B2 US 8179806B2
Authority
US
United States
Prior art keywords
degraded
quality
links
link
flow
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, expires
Application number
US12/187,659
Other languages
English (en)
Other versions
US20090052331A1 (en
Inventor
Masayoshi Kobayashi
Tsutomu Kitamura
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.)
NEC Corp
Original Assignee
NEC Corp
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 NEC Corp filed Critical NEC Corp
Assigned to NEC CORPORATION reassignment NEC CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KITAMURA, TSUTOMU, KOBAYASHI, MASAYOSHI
Publication of US20090052331A1 publication Critical patent/US20090052331A1/en
Application granted granted Critical
Publication of US8179806B2 publication Critical patent/US8179806B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/02—Capturing of monitoring data
    • H04L43/026—Capturing of monitoring data using flow identification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H04L43/0835—One way packet loss
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Definitions

  • the present invention relates to a device, a method, and a program for estimating a quality-degraded location of a communication network, and a communication network system, in particular, to a system for estimating a degraded location in communication quality of a network from flow quality information corresponding to multi-paths routing.
  • a number of monitoring devices are allocated in the network so as to continuously monitor the communication quality at locations the monitoring devices are allocated. Then, at the time the communication quality is degraded, a section with degraded quality is estimated based on a position of the monitoring device at which the quality degradation occurs.
  • a number of monitoring devices are necessary in order to increase estimation accuracy of a position where quality is degraded, and cost for allocating such monitoring devices is high.
  • a correspondence table (flow-link correspondence table) of flows, links (directed links) through which the flows pass, and quality is created.
  • flows F 1 to F 5 are assumed to pass through a network including routers (or packet switches) R 1 to R 6 as shown in FIG. 14 .
  • names are assigned to the links as shown in FIG. 15 , and packet loss rates are used to show quality.
  • packet loss rates of the flows F 1 to F 5 are 3.0%, 2.5%, 3.5%, 1.0%, and 0.5%, respectively.
  • the flow-link correspondence table is created as shown in FIG. 16 .
  • each flow is assumed to carry 100 packets per second, and a packet loss rate is determined based on an amount of packet loss for every 2 seconds.
  • non-degraded link elimination processing is carried out. That is, on the basis of a degradation threshold value and non-degradation threshold value of flow quality set in advance, a flow with quality lower than the degradation threshold value is set to be a degraded flow, a flow with quality higher than the non-degradation threshold value is set to be a non-degraded flow, and a flow other than the above is set to be a middle quality flow. Then, a reduced flow-link correspondence table is created by eliminating a row of the middle quality flow, a row of the non-degraded flow, and a column of a link through which the non-degraded flow passes from the flow-link correspondence table.
  • a packet loss rate of 2% is set to be a degradation threshold value and a packet loss rate of 1% is set to be a non-degradation threshold value
  • the flows F 1 to F 3 are degraded flows
  • the flow F 5 is a non-degraded flow
  • the flow F 4 is a middle flow.
  • a reduced flow-link correspondence table is created in a manner that a row of the middle flow, a row of the non-degraded flow, and columns having a value of 1 in the row of the non-degraded flow are eliminated from the flow-link correspondence table.
  • a state of the removal in the above example is shown in FIG. 17
  • the reduced flow-link correspondence table is shown in FIG. 18 .
  • a degraded location is estimated based on FIG. 18 .
  • the numbers of flows with degraded quality that pass through links L 10 , L 20 , L 50 , and L 40 are 1, 3, 1, and 1, respectively.
  • the link L 20 through which the largest number of flows pass is estimated as a degraded location.
  • a degraded location is estimated by a minimum link number estimation method described below.
  • a set of flows that pass through each of the links in FIG. 18 is considered. Then, a set of links that includes all the flows in FIG. 18 with a minimum number of links is determined, and such a set of links is set to be a set of degraded links. That is, in the example of FIG. 18 , sets of flows that pass through links L 10 , L 20 , L 50 , and L 40 are ⁇ F 1 ⁇ , ⁇ F 1 , F 2 , F 3 ⁇ , ⁇ F 2 ⁇ , and ⁇ F 3 ⁇ , respectively.
  • a sum-set of flows that pass through a set of links ⁇ L 10 , L 50 , L 40 ⁇ including three links is ⁇ F 1 , F 2 , F 3 ⁇ , and all the flows can be included.
  • all the flows can be included by a set of links ⁇ L 10 , L 20 ⁇ including two links and by a set of link ⁇ L 20 ⁇ including one link.
  • the set ⁇ L 20 ⁇ having the minimum number of links is estimated as a set of minimum links.
  • An exemplary object of the present invention is to carry out estimation with high accuracy based on flow quality information in a situation where, although a set of links that may have a flow passing through are known, which of such links the flow passed through cannot be identified, such as multi-paths routing, load distribution routing, and the like.
  • a device for estimating a quality-degraded location of a communication network includes: a flow quality information collecting means for collecting communication quality information of a flow passing the communication network; a routing information collecting means for collecting routing information of the communication network; a determining means for determining a quality-degraded flow and a quality-non-degraded flow based on the flow quality information and determining links through which the flow passes from the routing information of the communication network; a non-degraded link elimination means for eliminating a link not configuring multi-paths on the links on a pass of the flow as a non-degraded link, without eliminating a link configuring multi-paths on the links on a pass of the flow as a non-degraded link, with respect to the quality-non-degraded flow; and a degraded link determining means for determining a degraded link from links not eliminated as the non-degraded link.
  • FIG. 1 is a network configuration view showing an entire configuration of a communication network system according to a first exemplary embodiment of the present invention
  • FIG. 2 is a view for explaining links that connect routers of the communication network system shown in FIG. 1 ;
  • FIG. 3 is a block diagram showing an internal configuration of a server for estimating a quality-degraded location shown in FIG. 1 ;
  • FIG. 4 is a flowchart for explaining non-degraded link elimination processing by a non-degraded link elimination section of the server for estimating a quality-degraded location shown in FIG. 3 ;
  • FIG. 5 is a view for explaining an example of a flow quality/passing link table of the server for estimating a quality-degraded location shown in FIG. 3 ;
  • FIG. 6 is a view for explaining a reduced flow quality/passing link table determined by eliminating a non-degraded link from the flow quality/passing link table shown in FIG. 5 by the non-degraded link elimination processing shown in FIG. 4 ;
  • FIG. 7 is a flowchart for explaining non-degraded link elimination processing by the non-degraded link elimination section of the server for estimating a quality-degraded location in the communication network system according to a second exemplary embodiment of the present invention
  • FIG. 8 is a view for explaining an example of a flow quality/passing link table used in the non-degraded link elimination processing shown in FIG. 7 ;
  • FIG. 9 is a view for explaining an example of the flow quality/passing link table in the middle of eliminating a non-degraded link by the non-degraded link elimination processing shown in FIG. 7 ;
  • FIG. 10 is a view for explaining a reduced flow quality/passing link table determined by eliminating a non-degraded link from the flow quality/passing link table shown in FIG. 8 by the non-degraded link elimination processing shown in FIG. 7 ;
  • FIG. 11 is a flowchart for explaining processing by the quality-degraded location estimation section of the server for estimating a quality-degraded location in the communication network system according to a third exemplary embodiment of the present invention.
  • FIG. 12 is a view for explaining an example of the reduced flow quality/passing link table used in the quality-degraded location estimation processing shown in FIG. 11 ;
  • FIG. 13 is a view for explaining another example of the reduced flow quality/passing link table used in the quality-degraded location estimation processing shown in FIG. 11 ;
  • FIG. 14 is a view for explaining a relationship between a network and a flow of a related art
  • FIG. 15 is a view for explaining a link that connects routers of a network in the related art
  • FIG. 16 is a view for explaining an example of a flow/link correspondence table of the related art.
  • FIG. 17 is a view for explaining an example of non-degraded link elimination processing of the related art.
  • FIG. 18 is a view for explaining an example of a reduced flow/link correspondence table of the related art.
  • FIGS. 1 to 6 First, a first exemplary embodiment of the present invention will be described with reference to FIGS. 1 to 6 .
  • FIG. 1 shows an entire configuration of a communication network (corresponding to a communication network system of the present invention) according to the present embodiment.
  • a communication network shown in FIG. 1 includes a plurality of routers or switches (eight routers in the illustrated example) R 1 to R 8 , a plurality (six in the illustrated example) of terminals T 1 to T 6 , and a server S 1 (corresponding to a device for estimating a quality-degraded location of the present invention) for estimating a quality-degraded location, which are connected with each other in a communicable manner.
  • each of the routers R 1 and R 3 constitutes a link with the adjacent router R 2 so that such routers are connected with each other.
  • each of the routers R 5 and R 6 constitutes a link with the adjacent router R 4 so that such routers are connected with each other.
  • links are constituted for the routers R 7 and R 8 between the routers R 2 and R 4 in the center section so that each of the routers R 7 and R 8 is connected with the routers R 2 and R 4 in different paths (multi-paths).
  • Terminals T 1 , T 2 , T 3 , and T 4 are connected to the four routers R 1 , R 3 , R 5 , and R 6 positioned at end sections, respectively.
  • the terminals T 5 and T 6 are connected to the two routers R 2 and R 4 positioned in the center section, respectively.
  • the server S 1 for estimating a quality-degraded location is connected to the router R 1 positioned at an end section.
  • FIG. 2 explains links that connect the routers of the communication network shown in FIG. 1 .
  • the links that connect the terminals and the routers are omitted from description, the links that connect the routers work in a similar manner even when the links that connect the terminals and the routers are included.
  • reference symbol L 10 indicates a link of a pass directed from the router R 1 to the router R 2
  • reference symbol L 15 indicates a link of a pass which is in a direction opposite to L 10
  • Reference symbol L 30 indicates a link of a pass directed from the router R 4 to the router R 5
  • reference symbol L 35 indicates a link of a pass which is in a direction opposite to L 30
  • Reference symbol L 40 indicates a link of a pass directed from the router R 4 to the router R 6
  • reference symbol L 45 indicates a link of a pass which is in a direction opposite to L 40 .
  • Reference symbol L 50 indicates a link of a pass directed from the router R 3 to the router R 2
  • reference symbol L 55 indicates a link of a pass which is in a direction opposite to L 50
  • Reference symbol L 60 indicates a link of a pass directed from the router R 2 to the router R 7
  • reference symbol L 65 indicates a link of a pass which is in a direction opposite to L 60
  • Reference symbol L 70 indicates a link of a pass directed from the router R 7 to the router R 4
  • reference symbol L 75 indicates a link of a pass which is in a direction opposite to L 70 .
  • Reference symbol L 80 indicates a link of a pass directed from the router R 2 to the router R 8
  • reference symbol L 85 indicates a link of a pass which is in a direction opposite to L 80
  • Reference symbol L 90 indicates a link of a pass directed from the router R 8 to the router R 4
  • reference symbol L 95 indicates a link of a pass which is in a direction opposite to L 90 .
  • passes directed from the router R 2 to the router R 4 are multi-paths constituted by two paths, which are a path through the routers R 2 , R 7 , and R 4 in this order (the links L 60 and L 70 ), and a path through the routers R 2 , R 8 , and R 4 in this order (the links L 80 and L 90 ).
  • FIG. 3 shows an internal configuration view of the server S 1 for estimating a quality-degraded location in the present embodiment.
  • the server S 1 for estimating a quality-degraded location is configured with a flow quality information collection section 11 (corresponding to a flow quality information collecting means of the present invention), a routing information collection section 12 (corresponding to a routing information collecting means of the present invention), a flow quality/passing link table management section 13 (corresponding to a determining means of the present invention), a flow quality/passing link table storage section 14 , a non-degraded link elimination section 15 (corresponding to a non-degraded link elimination means of the present invention), a reduced flow quality/passing link table storage section 16 , a quality-degraded location estimation section 17 (corresponding to a degraded link determining means of the present invention), and a display section 18 .
  • a flow quality information collection section 11 corresponding to a flow quality information collecting means of the present invention
  • a routing information collection section 12 corresponding to a routing information collecting means of the present invention
  • a flow quality/passing link table management section 13 corresponding to a determining means of the present invention
  • the server S 1 for estimating a quality-degraded location collects quality information for each flow from the terminals T 1 to T 6 , and estimates a quality-degraded location based on routing information obtained from the routers R 1 to R 8 (or switches). Then, the server S 1 for estimating a quality-degraded location outputs an estimation result to the display section 18 .
  • the flow quality information collection section 11 When a terminal starts communication, the flow quality information collection section 11 is notified thereof from the terminal. In addition, the flow quality information collection section 11 receives current communication quality information and a current flow rate of the terminal from the terminal after start of communication. That is, the flow quality information collection section 11 receives a set of information including an address of a transmission terminal, an address of a receiving terminal, flow quality information, and a packet rate. Then, when the terminal ends the communication, the flow quality information collection section 11 receives a notification of the end of the communication.
  • the flow quality information is information relating to communication quality, such as a packet loss rate, delay, and delay jitter.
  • the packet rate is information of an amount of packets per second of a flow used in the communication.
  • the routing information collection section 12 collects information relating to routing from the router R 1 to R 8 (or switches). This can be carried out by using a simple network management protocol (SMTP) and the like. If there is information relating to routing, determination can be made with respect to in which path communication between transmitting and receiving terminals is carried out from address information of such transmitting and receiving terminals. More specifically, the information relating to routing includes a routing table and an address resolution protocol (ARP) table when collected from routers, or a forwarding database and a configuration information of a spanning tree when collected from switches. The information relating to routing can be provided by a network administrator, in stead of being collected from the routers (or switches) R 1 to R 8 .
  • ARP address resolution protocol
  • the flow quality/passing link table management section 13 maintains a flow quality/passing link table made up of a set of links through which a flow currently carrying out communication passes and a current flow quality flag of the flow.
  • the flow quality flag is a flag that becomes “Good” or has a flag value corresponding thereto in case quality of each flow is more excellent than a favorable threshold value (non-degradation threshold value) set in advance, and becomes “Bad” or has a flag value corresponding thereto in case quality of such flow is inferior to a degradation threshold value set in advance (and has an indefinite value in other cases).
  • FIG. 1 there exist a flow F 1 on a path directed from the terminal T 1 to the terminal T 3 , a flow F 2 on a path directed from the terminal T 2 to the terminal T 4 , and a flow F 3 on a path directed from the terminal T 1 to the terminal T 4 .
  • flow quality of the flow F 1 is “Good”
  • flow quality of both the flows F 2 and F 3 is “Bad”
  • a flow quality/passing link table as shown in FIG. 5 is determined.
  • rows correspond to the three flows F 1 , F 2 , and F 3 on paths, and columns correspond to the eight links (passing links) L 10 , L 50 , L 60 , L 70 , L 80 , L 90 , L 30 , and L 40 , through which the three flows F 1 , F 2 , and F 3 pass.
  • values (table values) entered in squares (cells) divided by rows of flows and columns of links are 1) a value “0” for a link through which a flow does not pass, 2) a value “1” for a link through which a flow passes and which does not constitute multi-paths, and 3) the number of multi-paths for a link through which a flow passes and which constitutes multi-paths.
  • the links L 60 , L 70 , L 80 , and L 90 are links that constitute two multi-paths
  • a value of “2” is entered in squares made up of rows of flows passing though these links and columns of the corresponding links.
  • the flow quality/passing link table storage section 14 stores the flow quality/passing link table maintained by the flow quality/passing link table management section 13 in an updatable manner.
  • the non-degraded link elimination section 15 carries out non-degraded link elimination processing shown in FIG. 4 with respect to the flow quality/passing link table stored in the flow quality/passing link table storage section 14 to generate a reduced flow quality/passing link table by eliminating quality information and flow rate information. Then, the non-degraded link elimination section 15 writes the reduced flow quality/passing link table in the reduced flow quality/passing link table storage section 16 .
  • the non-degraded link elimination processing is configured with Steps St 1 and St 2 described below.
  • each column of a link having a value of “1” on a flow (quality-non-degraded flow or excellent quality flow) with a quality flag of “Good” is eliminated from the flow quality/passing link table as a non-degraded link.
  • a reduced flow quality/passing link table configured with columns of the links L 50 , L 60 , L 70 , L 80 , L 90 , and L 40 , which are not eliminated as a non-degraded link is determined with respect to the columns of the flows F 2 and F 3 (quality-degraded flows) with a quality flag of “Bad”.
  • the reduced flow quality/passing link table storage section 16 stores the reduced flow quality/passing link table determined by the above-described non-degraded link elimination processing in an updatable manner.
  • the quality-degraded location estimation section 17 reads out the reduced flow quality/passing link table from the reduced flow quality/passing link table storage section 16 , and uses an estimation method based on the number of quality-degraded flows or a minimum link number estimation method to determine a degraded link from links not eliminated as non-degraded links. Then, the quality-degraded location estimation section 17 estimates a quality-degraded location and outputs such a location to the display section 18 .
  • the display section 18 displays the quality-degraded location output from the quality-degraded location estimation section 17 .
  • the number of squares that have a value of “1” or larger (“1” or “2” in the present example) is counted with respect to columns of links of the reduced flow quality/passing link table. Then, the links are arranged in the order of having a larger number of such squares, and the links included up to the order set in advance are estimated as degraded locations. For example, in case of the reduced flow/passing link table as shown in FIG.
  • the numbers of squares having a value of “1” or larger are 1, 2, 2, 2, 2, and 1 with respect to columns of the links L 50 , L 60 , L 70 , L 80 , L 90 , and L 40 , respectively. Then, the links L 60 , L 70 , L 80 , and L 90 that are the links having the largest number of squares among these links are estimated as degraded locations.
  • a set of flows having a value of “1” or larger as a value of a square with respect to link columns of a flow quality/passing link table is called a flow set belonging to such link columns.
  • a flow set belonging to a column of the link L 60 includes ⁇ F 2 , F 3 ⁇ .
  • a sum-set of a flow set belonging to each of a plurality of link columns is similarly called a flow set belonging to a set of such link columns.
  • a flow set belonging to a set of link columns ⁇ L 50 , L 60 ⁇ includes ⁇ F 2 , F 3 ⁇ .
  • link sets in which a flow set belonging to a set of link columns includes all flows of the reduced flow quality/passing link table that is, ⁇ F 2 , F 3 ⁇
  • link sets having a minimum number of elements are ⁇ L 60 ⁇ , ⁇ L 70 ⁇ , ⁇ L 80 ⁇ , and ⁇ L 90 ⁇ having the element number of one.
  • the links L 60 , L 70 , L 80 , and L 90 are estimated as degraded links.
  • the minimum link number estimation method can be solved by using an algorism of a minimum cover problem.
  • a degraded link can be estimated even in case there is a flow passing through multi-paths.
  • the non-degraded link elimination section 15 carries out non-degraded link elimination processing shown in FIG. 7 with respect to a flow quality/passing link table stored in the flow quality/passing link table storage section 14 . Then, the non-degraded link elimination section 15 generates a reduced flow quality/passing link table by eliminating quality information and flow rate information, and writes such a reduced flow quality/passing link table in the reduced flow quality/passing link table storage section 16 .
  • the non-degraded link elimination processing is configured with Steps St 11 to St 14 described below.
  • ⁇ p 1 P ⁇ f ⁇ ( G p , B p , p ) ( Formula ⁇ ⁇ 1 )
  • Gp and Bp are the number of flows (quality-non-degraded flows or excellent quality flows) of “Good” and the number of flows (quality-degraded flows) of “Bad”, respectively, which have a value p in the above link columns.
  • f(Gp, Bp, p) is a function that increases with respect to a difference between Gp and Bp, decreases with respect to p, and increases with respect to a sum of Gp and Bp.
  • f ( G p ,B p ,p ) ( G p ⁇ B p )/ p ⁇ square root over ( G p +B p ) ⁇ (Formula 2)
  • a value of Formula 1 is determined (Step St 12 ).
  • a threshold value for a value of Formula 1 is set to be 2 in advance. Then, the links that have a value of Formula 1 exceeding 2 are the links L 90 to L 120 . Therefore, from the flow quality/passing link table of FIG. 9 determined in Step St 11 , columns of the links L 90 to L 120 having a value of Formula 1 exceeding the threshold value set in advance are eliminated (Step St 13 ). Finally, all the flows F 1 to F 5 of “Good” are eliminated (Step St 14 ).
  • a reduced flow quality/passing link table configured with columns of the links L 60 to L 80 , the link L 130 , and the links L 190 to L 210 , which are left without being eliminated as non-degraded links is determined with respect to the flows F 6 , F 7 , and F 8 (quality-degraded flows) with a quality flag of “Bad”.
  • non-degraded link elimination section 15 with respect to quality-non-degraded flows, links which are on paths of flows and do not configure multi-paths are eliminated as non-degraded links. Links which are on paths of flows and configure multi-paths are eliminated as non-degraded links when such links have high priority which is determined depending on any of the number of multi-paths, and a difference between and a sum of the number of excellent quality flows passing through the links and the number of quality-degraded flows passing the links.
  • a value of Formula 1 has a higher value as a difference between the number of the “Good” flows and the number of the “Bad” flows is sufficiently large in comparison with the number p of paths, and as a sum of the number of the “Good” flows and the number of the “Bad” flows is higher. Whether a value of Formula 1 is large or small matches with whether possibility of the “Good” link is high or low.
  • the present embodiment is different from the second exemplary embodiment only with respect to operation of the quality-degraded location estimation section 17 of the server S 1 for estimating a quality-degraded location. Accordingly, description will be made only with respect to such a different point.
  • the quality-degraded location estimation section 17 reads out a reduced flow quality/passing link table from the reduced flow quality/passing link table storage section 16 . Then, as shown in FIG. 11 , the quality-degraded location estimation section 17 uses a multi-paths compatible minimum link number estimation method described below to estimate a quality-degraded location, and outputs such a quality-degraded location to the display section 18 .
  • a set of flows having a value of “1” or higher as values in squares with respect to link columns in a flow quality/passing link table is called a flow set belonging to the link columns.
  • a flow set belonging to a column of the link L 60 includes ⁇ F 5 , F 6 ⁇ made up of the flows F 5 and F 6 having a value of “1”.
  • a sum-set of a flow set belonging to each of a plurality of link columns is similarly called a flow set belonging to a set of such link columns.
  • a flow set belonging to a set ⁇ L 60 , L 70 ⁇ of link columns includes ⁇ F 5 , F 6 , F 7 , F 8 ⁇ .
  • the processing by the quality-degraded location estimation section 17 is configured with Steps St 21 to St 24 described below.
  • a virtual element number of a column of each link is determined in a manner described below.
  • g(x) is a monotonically increasing function, which takes a value of 1 or larger and k or smaller.
  • g ( x ) min( k, 1+(max( g ( k ) ⁇ k, 0)) 2 /c ) (Formula 4)
  • a virtual element number of a set of link columns is a sum of virtual element numbers of the link columns.
  • a set of link columns, in which flow sets belonging to such set of link columns are identical to all flows of a reduced flow quality/passing link table, is determined.
  • a virtual element number of the set is determined as a sum of virtual element numbers of elements (links) of the set.
  • a set having a smallest virtual element number is selected and output.
  • sets of link columns up to a predetermined order are selected and output.
  • sets of link columns having flow sets which belong to the sets of link columns and identical with all flows of the reduced flow quality/passing link table are ⁇ L 60 , L 70 ⁇ , ⁇ L 90 ⁇ , ⁇ L 100 ⁇ , ⁇ L 110 ⁇ , ⁇ L 120 ⁇ , and ⁇ L 130 ⁇ , and virtual element numbers for these sets are 2, 1.4, 1.4, 1.4, 1.4, and 1, respectively.
  • the set ⁇ L 130 ⁇ having a minimum virtual element number of 1 is estimated as a degraded location.
  • sets of link columns having flow sets which belong to the sets of link columns and identical with all flows of the reduced flow quality/passing link table are ⁇ L 60 ⁇ , ⁇ L 90 ⁇ , ⁇ L 100 ⁇ , ⁇ L 110 ⁇ , ⁇ L 120 ⁇ , and ⁇ L 130 ⁇ , and a virtual element number for all of these sets is 1. Then, all of these sets are estimated as degraded locations.
  • the quality-degraded location estimation section 17 determines, as degraded links, a combinations of links that have all degraded links passing through the links, and have a minimum sum of virtual element numbers determined for each link depending on the number of multi-path flows passing each link and the number of multi-paths of such flows, from links which were not eliminated as non-degraded links.
  • the link is a link on multi-paths and there are multi-path flows of which the quality is degraded and which passes through the link
  • the larger the number of multi-path flows the higher the possibility that quality degradation occurs on all paths of multi-paths. That is, when the number of quality-degraded flows is small, there is quality degradation on a path of part of multi-paths, and there is high possibility that the small number of flows happen to pass the quality-degraded path.
  • the links L 90 to L 120 are links on multi-paths having two paths, and the number of degraded flows passing through these links is four in the case of FIG. 12 and two in the case of FIG. 13 . That is, in FIG. 12 , four flows pass through two paths and are all degraded, and in FIG. 13 , two flows pass through two paths and are all degraded. The larger number of flows are degraded in FIG. 12 , and there is high possibility that both of the two paths are degraded.
  • the link sets ⁇ L 90 ⁇ , ⁇ L 100 ⁇ , ⁇ L 110 ⁇ , and ⁇ L 120 ⁇ cover all degraded flows in any of the above cases (all degraded flows pass through link elements of the sets).
  • all degraded flows pass through link elements of the sets.
  • an element number of the link sets ⁇ L 90 ⁇ , ⁇ L 100 ⁇ , ⁇ L 110 ⁇ , and ⁇ L 120 ⁇ should be considered as a value close to 2, not 1.
  • a virtual element number realizes this idea.
  • a device for estimating a quality-degraded location includes a flow quality collecting means, a routing information collecting means, a flow quality/passing link table managing means, a non-degraded link elimination means, and a quality-degraded location estimating means.
  • the flow quality collecting means collects flow quality information and a flow rate flowing a network.
  • the routing information collecting means collects configuration information of the network.
  • the flow quality/passing link table managing means determines a link on which a flow passes through from the flow quality information and the configuration information of the network, and manages such links in a table format.
  • the non-degraded link elimination means determines a quality-degraded flow and a quality-non-degraded flow based on a degradation threshold value and a non-degradation threshold value set in advance. Then, the non-degraded link elimination means eliminates a non-degraded link having the number of quality-non-degraded flows passing through the link which is equal to or larger than a non-degraded flow threshold value set based on the degradation threshold value and the flow rate, from link sets on which a quality-degraded flow passes through.
  • the quality-degraded location estimating means outputs, as quality-degraded locations, a subset that includes links through which arbitrary flows with quality degradation pass and has a minimum element number from subsets of sets determined by eliminating a non-degraded link from links through which a set of the arbitrary flows with quality degradation pass.
  • a server for estimating a quality-degraded location configuring a communication network system hardware and software configurations are not limited in particular, as long as functions of the above-described sections (the flow quality information collection section, the routing information collection section, the flow quality/passing link table management section, the flow quality/passing link table storage section, the non-degraded link elimination section, the reduced flow quality/passing link table storage section, and the quality-degraded location estimation section) can be realized.
  • a circuit (or a program component) may be configured independently for each function of each of the sections, or functions of the sections may be configured in an integrated manner in one circuit.
  • functions of each of the sections are realized by software processing mainly by a computer (a central processing unit or a CPU), a program configuring the software and a computer-readable recording medium that records the program are also included in the scope of the present invention.
  • the present invention can be applied for purposes of a device, a method, and a program that estimate a degraded location of communication quality of a communication network system.
  • An exemplary advantage according to the invention is that, estimation can be carried out with high accuracy based on flow quality information in a situation where, although a set of links that may have a flow passing through is known, which of such links the flow passed through cannot be identified, such as multi-paths routing, load distribution routing, and the like.
  • a method for estimating a quality-degraded location of a communication network comprising: collecting communication quality information of a flow passing the communication network; collecting routing information of the communication network; determining a quality-degraded flow and a quality-non-degraded flow based on the flow quality information and determining links through which the flow passes from the routing information of the communication network; eliminating a link not configuring multi-paths on the links on a pass of the flow as a non-degraded link, without eliminating a link configuring multi-paths on the links on a pass of the flow as a non-degraded link, with respect to the quality-non-degraded flow; and determining a degraded link from links not eliminated as the non-degraded link.
  • a program for allowing a computer to perform a method for estimating a quality-degraded location of a communication network comprising: collecting communication quality information of a flow passing the communication network; collecting routing information of the communication network; determining a quality-degraded flow and a quality-non-degraded flow based on the flow quality information and determining links through which the flow passes from the routing information of the communication network; eliminating a link not configuring multi-paths on the links on a pass of the flow as a non-degraded link, without eliminating a link configuring multi-paths on the links on a pass of the flow as a non-degraded link, with respect to the quality-non-degraded flow; and determining a degraded link from links not eliminated as the non-degraded link.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
US12/187,659 2007-08-23 2008-08-07 Device, method, and program for estimating quality-degraded location of communication network, and communication network system Expired - Fee Related US8179806B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2007217404A JP4863090B2 (ja) 2007-08-23 2007-08-23 通信ネットワークの品質劣化箇所推定装置、方法、及びプログラム、並びに通信ネットワークシステム
JP2007-217404 2007-08-23

Publications (2)

Publication Number Publication Date
US20090052331A1 US20090052331A1 (en) 2009-02-26
US8179806B2 true US8179806B2 (en) 2012-05-15

Family

ID=40382036

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/187,659 Expired - Fee Related US8179806B2 (en) 2007-08-23 2008-08-07 Device, method, and program for estimating quality-degraded location of communication network, and communication network system

Country Status (2)

Country Link
US (1) US8179806B2 (ja)
JP (1) JP4863090B2 (ja)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130198570A1 (en) * 2012-01-31 2013-08-01 Fujitsu Limited Communication system and generating apparatus

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5104489B2 (ja) * 2008-04-03 2012-12-19 日本電気株式会社 分散イベント検出システム、分散イベント検出方法、及び分散イベント検出用プログラム
JP5251538B2 (ja) * 2009-01-20 2013-07-31 富士通株式会社 異常箇所特定プログラム、異常箇所特定装置、異常箇所特定方法
ES2361545B1 (es) * 2009-02-24 2012-05-08 Universidad De Alcala De Henares Procedimiento de encaminamiento de tramas de datos y puente de red.
EP2538620A4 (en) * 2010-02-18 2015-04-15 Nec Corp QUALITY DETERIORATION POINT ANALYZING SYSTEM, QUALITY DETERIORATION POINT ANALYZING DEVICE, QUALITY DETERIORATION POINT ANALYZING METHOD, AND PROGRAM
JP5533112B2 (ja) * 2010-03-24 2014-06-25 富士通株式会社 監視装置，監視方法および監視プログラム
JP2011211358A (ja) * 2010-03-29 2011-10-20 Kddi Corp ネットワークの品質劣化箇所推定装置

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002271392A (ja) 2001-03-06 2002-09-20 Nippon Telegr & Teleph Corp <Ntt> Ｉｐ網における呼毎の音声品質管理方法
US6557112B1 (en) * 1998-12-09 2003-04-29 Nec Corporation QOS protection system
US20040165526A1 (en) * 2001-09-12 2004-08-26 Toshiyuki Yada Network monitoring and controlling apparatus
JP2006033715A (ja) 2004-07-21 2006-02-02 Nippon Telegr & Teleph Corp <Ntt> ネットワークｅ２ｅ性能評価システムと方法およびプログラム
JP2006238052A (ja) 2005-02-24 2006-09-07 Nec Corp ネットワークの品質劣化箇所推定装置、品質劣化箇所推定方法及び品質劣化箇所推定プログラム
US20070230346A1 (en) * 2006-03-28 2007-10-04 Fujitsu Limited Service quality management device and service quality management method
US7583613B2 (en) * 2005-12-05 2009-09-01 Alcatel Lucent Method of monitoring the quality of a realtime communication

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006137373A1 (ja) * 2005-06-24 2006-12-28 Nec Corporation 品質劣化箇所推定システム、及び品質劣化箇所推定方法
US20100157818A1 (en) * 2005-08-31 2010-06-24 Nec Corporation Network system, server, quality degradation point estimating method, and program
CN101385292B (zh) * 2006-02-16 2011-09-28 日本电气株式会社 质量恶化部分估计装置、方法及程序
US8036121B2 (en) * 2006-08-22 2011-10-11 Nec Corporation Method of estimating quality degradation on network in communication network system
WO2008108231A1 (ja) * 2007-02-26 2008-09-12 Nec Corporation 品質劣化箇所推定方法、品質劣化箇所推定装置およびプログラム

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6557112B1 (en) * 1998-12-09 2003-04-29 Nec Corporation QOS protection system
JP2002271392A (ja) 2001-03-06 2002-09-20 Nippon Telegr & Teleph Corp <Ntt> Ｉｐ網における呼毎の音声品質管理方法
US20040165526A1 (en) * 2001-09-12 2004-08-26 Toshiyuki Yada Network monitoring and controlling apparatus
JP2006033715A (ja) 2004-07-21 2006-02-02 Nippon Telegr & Teleph Corp <Ntt> ネットワークｅ２ｅ性能評価システムと方法およびプログラム
JP2006238052A (ja) 2005-02-24 2006-09-07 Nec Corp ネットワークの品質劣化箇所推定装置、品質劣化箇所推定方法及び品質劣化箇所推定プログラム
US7583613B2 (en) * 2005-12-05 2009-09-01 Alcatel Lucent Method of monitoring the quality of a realtime communication
US20070230346A1 (en) * 2006-03-28 2007-10-04 Fujitsu Limited Service quality management device and service quality management method

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130198570A1 (en) * 2012-01-31 2013-08-01 Fujitsu Limited Communication system and generating apparatus
US8990611B2 (en) * 2012-01-31 2015-03-24 Fujitsu Limited Communication system and generating apparatus

Also Published As

Publication number Publication date
US20090052331A1 (en) 2009-02-26
JP4863090B2 (ja) 2012-01-25
JP2009055113A (ja) 2009-03-12

Similar Documents

Publication Publication Date Title
US11509582B2 (en) System and method for managing bandwidth usage rates in a packet-switched network
US8179806B2 (en) Device, method, and program for estimating quality-degraded location of communication network, and communication network system
Iyer et al. An approach to alleviate link overload as observed on an IP backbone
JP4244940B2 (ja) ネットワークの品質劣化箇所推定装置、品質劣化箇所推定方法及び品質劣化箇所推定プログラム
US8279753B2 (en) Efficient determination of fast routes when voluminous data is to be sent from a single node to many destination nodes via other intermediate nodes
Szymanski Max-flow min-cost routing in a future-internet with improved QoS guarantees
CN102640463A (zh) 动态路由分支系统和动态路由分支方法
US7206289B2 (en) Method of and apparatus for calculating traffic from data on packet transmission collected from routers
US20100157818A1 (en) Network system, server, quality degradation point estimating method, and program
CN101789949B (zh) 一种实现负荷分担的方法和路由设备
US8169932B2 (en) QoS degradation point estimation method, QoS degradation point estimation device, and program
JP5131608B2 (ja) 品質劣化箇所推定装置、方法、及び通信ネットワークシステム
US8064340B2 (en) Quality-degraded portion estimating apparatus, quality-degraded portion estimating method, and quality-degraded portion estimating program
US20180234345A1 (en) Routing Communications Traffic Packets Across a Communications Network
Molisz Survivability function-a measure of disaster-based routing performance
US20060036762A1 (en) System and method for automatic path generation in a computer network
Eramo et al. Design and evaluation of a new multi-path incremental routing algorithm on software routers
CN115150313A (zh) 发送报文、生成路由的方法、装置、存储介质及系统
CN107592269B (zh) 传输路径的负载信息的方法和网络节点
Tavernier et al. Packet loss reduction during rerouting using network traffic analysis
Matsui et al. Evaluation of a server-based traffic engineering architecture suitable for large-scale MPLS networks
Li et al. Optimizing the QoS performance of fast rerouting
CN116684347A (zh) 确定路径的方法和装置
Liu Capacity allocation for self-similar traffic
CN112737811A (zh) 获取转发参数的方法、装置和系统

Legal Events

Date Code Title Description
AS Assignment

Owner name: NEC CORPORATION, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KOBAYASHI, MASAYOSHI;KITAMURA, TSUTOMU;REEL/FRAME:021356/0644

Effective date: 20080728

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200515