WO2011024701A1 - ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム - Google Patents
ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム Download PDFInfo
- Publication number
- WO2011024701A1 WO2011024701A1 PCT/JP2010/063989 JP2010063989W WO2011024701A1 WO 2011024701 A1 WO2011024701 A1 WO 2011024701A1 JP 2010063989 W JP2010063989 W JP 2010063989W WO 2011024701 A1 WO2011024701 A1 WO 2011024701A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- site
- network
- network operation
- combination
- sites
- Prior art date
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
-
- 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
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H10—SEMICONDUCTOR DEVICES; ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
- H10N—ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
- H10N70/00—Solid-state devices without a potential-jump barrier or surface barrier, and specially adapted for rectifying, amplifying, oscillating or switching
- H10N70/20—Multistable switching devices, e.g. memristors
-
- 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/48—Routing tree calculation
Definitions
- the present invention relates to a network design system, a network design method, a data transfer route determination method, and a network design program, and more particularly to a network design system, a network design method, and a data transfer route determination for a network that accommodates a plurality of server sites or data centers.
- the present invention relates to a method and a network design program.
- the site refers to a place where one or a plurality of server machines capable of processing or storing data are installed as exemplified in FIG.
- the server machines 1030a to 1030n at the site 1000 are edge routers located to access an AS (Autonomous System) 1200 provided by an ISP (Internet Service Provider) via the L2 switch 1020. 1010 is connected.
- the L2 switch 1020 is not limited to this, and may be a multilayer switch, for example.
- the edge router 1010 is connected to the AS 1200, and the site 1000 uses the AS 1200 and is connected to the entire Internet 1100 through one AS 1200.
- At least one server machine 1030a to 1030n may be used, and the number of server machines is not limited.
- Site installations range from small ones that store server machines in racks and are installed on floors in buildings, to Internet data centers (iDCs) that house a large number of server machines exclusively. .
- iDCs Internet data centers
- High-speed transfer of data between geographically distributed sites include content such as websites and videos issued by content holders on CDN (Contents Delivery Network).
- CDN Content Delivery Network
- the content data is transferred from the origin site to the edge site. It is possible to transfer something.
- the experience and satisfaction of the end user can be increased.
- the Internet is configured in such a way that ASs, which are network units (network operation units) operated by ISPs and major portal operators, are interconnected.
- ASs which are network units (network operation units) operated by ISPs and major portal operators, are interconnected.
- AS is a set of individual routers and end systems, and each AS is assigned a number that is unique throughout the world.
- IP Internet Protocol
- BGP Border Gateway Protocol
- An IP address prefix refers to a set of IP addresses having consecutive numbers.
- each AS based on the received route information, indicates a hop (represented by an IP address assigned to a network interface of a router or a server) to be transferred next to a certain IP address prefix.
- a table is being created.
- connection between ASs is contracted and executed according to the business judgment of each operator, but there are mainly peering and transit as connection forms between ASs.
- Peering refers to ISPs connecting ASs and exchanging traffic under equal conditions. In peering, it is basically possible to send and receive data to and from each other free of charge, assuming that the same amount of traffic is exchanged.
- transit refers to a packet relay service provided by a certain ISP to other companies in the same industry.
- the ISP that provides the packet relay service guarantees the reachability of the packet to the entire Internet for customers (such as other companies in the same industry) who receive the packet relay service, and the amount of traffic transferred between the two The customer pays the ISP accordingly.
- connection relationship between ASs by peering, transit, etc. places great restrictions on how to take routes between two points on the Internet.
- a packet received from an AS of a peering partner by an AS is transferred to an upper AS that is a transit provider, a packet received from the same AS is forwarded to an AS of a peering partner, or a peering partner. If you send your data to another peering partner, they are effectively forwarding packets for free.
- the AS management entity usually exchanges route information by BGP according to the following policy. That is, the AS management entity notifies the peering partner or transit provider only the route that can be reached within the AS, or the customer's route if the transit provider is the transit provider.
- a route between two points by BGP is not necessarily a route optimized for performance.
- the number of router hops in a route between two points is not necessarily the smallest.
- FIG. 12 shows a situation in which data is transferred from the site X using AS1 to the site Y using AS3.
- the site may be subscribed to an ISP that operates the AS.
- the minimum hop route between site X and site Y is AS1 ⁇ AS4 ⁇ AS2 ⁇ AS5 ⁇ AS3, but it is selected when each AS has exchanged route information according to the policy of exchanging route information described above.
- the route is AS1 ⁇ AS4 ⁇ AS6 ⁇ AS8 ⁇ AS9 ⁇ AS7 ⁇ AS5 ⁇ AS3, and the route length is longer than the shortest route.
- Non-Patent Document 2 in regions such as Southeast Asia where the connection between ASs in the Internet Exchange etc. is not sufficiently advanced, even though the locations are relatively close to each other, they are routed through the continents of Europe and America. The situation where the packet is transferred is shown. When traveling between different continents, there will be a large propagation delay.
- TCP Transmission Control Protocol
- HTTP HyperText Transfer Protocol
- TCP data is transferred without error by receiving and processing the response of the reception confirmation for the transmitted data.
- the throughput at the time of data transfer by TCP depends on RTT (Round Trip Time) corresponding to the delay required for the round trip between transmission and reception, or the packet loss rate.
- RTT Random Trip Time
- the RTT includes a round-trip propagation delay between transmission and reception, a packet protocol processing delay in the apparatus during the round-trip, and a transfer delay on the line. Further, in the round trip between transmission and reception, the same path is not always passed on the forward path and the return path.
- the packet loss rate increases as the number of hops on the Internet between sending and receiving increases.
- the RTT increases due to propagation delay.
- Non-patent document 1 Non-patent document 2, and Non-patent document 3 are given as references for the above explanation.
- An object of the present invention is to provide a network design system, a network design method, a data transfer route determination method, and a network design program capable of designing a network that can transfer data with higher throughput between servers.
- At least one network operation unit candidate given to each site of a plurality of sites constituting a network is given to each pair of network operation unit candidates between different sites. Based on the connection relations, a combination of network operation units to be used by each site is determined so that all sites can be reached.
- a route for transferring data from one outgoing site to another incoming site is previously assigned to each pair of network operation units obtained by the network design method of the present invention. Determine based on the given connection relationship
- At least one network operation unit candidate given to each site of a plurality of sites constituting a network is given to each pair of network operation unit candidates between different sites.
- Each site is provided with processing means for determining a combination of network operation units to be used by each site so that all sites can be reached based on the connection relationship.
- the first network design program of the present invention is given to each pair of network operation unit candidates between different sites, with respect to at least one network operation unit candidate given to each of a plurality of sites constituting the network. Based on the connection relationship, a determination process for determining a combination of network operation units to be used by each site is executed so that all sites can be reached.
- FIG. 1 is a diagram showing a configuration of a network design system according to a first embodiment of the present invention.
- a network design system 100 includes an input device 1 such as a keyboard, a data processing device 2 that operates under program control, a storage device 3 that stores information, And an output device 4 such as a display device or a printing device.
- an input device 1 such as a keyboard
- a data processing device 2 that operates under program control
- a storage device 3 that stores information
- an output device 4 such as a display device or a printing device.
- the data processing apparatus 2 includes design information processing means 21, AS combination evaluation means 22, and optimization processing means 23.
- the design information processing means 21 creates an input format that is displayed on the output device 4 and allows the designer to input design information.
- the design information processing means 21 converts the design information input by the designer through the input device 1 into the format suitable for handling in each means of the data processing device 2 in accordance with the input format, and stores the design information storage. Processing to be stored in the unit 31 is performed.
- the design information includes information on a calculation method of one or a plurality of objective functions, a site, an AS candidate given to each site, and the presence / absence of a connection relationship between each AS candidate pair between different sites. If there is a connection relationship, the cost given to the connection relationship is included.
- the design information processing unit 21 stores the design information converted into a format suitable for handling in the design information storage unit 31, and then activates the AS combination evaluation unit 22.
- the AS combination evaluation unit 22 refers to the design information stored in the design information storage unit 31 and creates one set of AS candidate combinations used by each site one by one, and the minimum total area corresponding to the combination A tree is created by a prim method based on a cost given between ASs having a connection relationship.
- the cost given between ASs refers to the distance between ASs having a connection relationship.
- the minimum spanning tree refers to a spanning tree in which the “sum of edge weights” constituting the graph is minimum
- the graph refers to a graph composed of a set of nodes and a set of edges (links).
- connection between ASs is called an AS link
- AS link expressed as a graph
- the AS combination evaluation unit 22 determines whether all sites are reachable from the created minimum spanning tree.
- the reachability between all sites means that the created minimum spanning tree includes all sites included in the design information.
- the AS combination evaluation unit 22 refers to the design information stored in the design information storage unit 31, and determines whether or not the created minimum spanning tree includes all the sites included in the design information. .
- the AS combination evaluation unit 22 stores at least information regarding the combination of AS candidates in the reachable combination storage unit 32 for combinations of AS candidates determined to be reachable between all sites.
- the information related to the combination of AS candidates specifically refers to information on AS links that constitute the minimum spanning tree corresponding to the combination of AS candidates determined to be reachable between all sites.
- the optimization processing unit 23 When one or more combinations of AS candidates are stored in the reachable combination storage unit 32 after the AS combination evaluation unit 22 finishes processing, the optimization processing unit 23 reads the AS combination from the reachable combination storage unit 32. Extract information about candidate combinations. Then, the optimization processing unit 23 evaluates the objective function for all combinations of AS candidates stored in the reachable combination storage unit 32, and calculates an AS combination that is optimal for the combination of the AS candidates.
- the objective function means a value or a function value that is desired to be minimized or maximized in the optimization problem.
- the optimization processing means 23 evaluates the maximum cost value of the AS link constituting the minimum spanning tree corresponding to each AS candidate combination as an objective function, and the maximum cost value of the AS link is minimized. An optimal AS combination is calculated.
- the optimization processing means 23 evaluates the total number of AS links constituting the minimum spanning tree as an objective function, and calculates the optimal AS combination that maximizes the total number of AS links.
- the optimization processing means 23 evaluates the sum of the costs of the AS links constituting the minimum spanning tree as an objective function, and calculates the optimum AS combination that minimizes the sum of the costs of the AS links.
- optimization processing means 23 outputs the calculated optimum AS combination to the output device 4.
- the storage device 3 includes a design information storage unit 31 and a reachable combination storage unit 32.
- the design information storage unit 31 includes information on a calculation method of one or a plurality of objective functions, a site name, an AS candidate given to each site, presence / absence of a connection relationship between each AS candidate pair, connection If there is a relationship, design information including the cost assigned to the connection relationship is stored.
- the reachable combination storage unit 32 stores the AS combinations obtained by the AS combination evaluation unit 22 and reachable between all sites, and information related to the AS combinations.
- FIG. 2 is a flowchart showing the operation of the network design system 100 according to this embodiment.
- the AS combination evaluation unit 22 refers to the design information stored in the design information storage unit 31 and creates one combination of AS candidates that each site uses, and sets the combination of AS candidates.
- a corresponding minimum spanning tree is created by the prim method based on the cost given between ASs having a connection relationship (step S202). The minimum spanning tree will be described in the evaluation of the objective function.
- the AS combination evaluation unit 22 refers to the design information stored in the design information storage unit 31 to check whether all sites are reachable, and the minimum spanning tree obtained in step S202 is used as the design information. It is checked whether or not all the included sites are included (step S203).
- the AS combination evaluation unit 22 determines that the combination of AS candidates constituting the minimum spanning tree is a combination of AS candidates that can be reached between all the sites ( In step S203 “YES”), the AS candidate combination and the AS link information constituting the minimum spanning tree are stored in the reachable combination storage unit 32 (step S204), and the process goes to step S205.
- the AS combination evaluation unit 22 determines that the combination of AS candidates constituting the minimum spanning tree is not a combination of AS candidates that can be reached between all the sites (step S203). "NO"), the process proceeds to step S205.
- the AS combination evaluation unit 22 checks whether all patterns of combinations of AS candidates used by each site have been processed (step S205).
- step S205 If each site is processing all patterns of combinations of AS candidates used by one site (step S205 “YES”), the AS combination evaluation unit 22 proceeds to step S206.
- step S205 If not all patterns of combinations of AS candidates used by each site are processed (step S205 “NO”), the AS combination evaluation means 22 returns to step S202, and each site uses one AS candidate. Steps S202 to S205 are repeated until all patterns of combinations are processed.
- the optimization processing means 23 After processing all patterns of AS candidate combinations used by each site (step S205 “YES”), the optimization processing means 23 refers to the reachable combination storage unit 32 and can reach all sites. It is checked whether or not there is at least one combination of AS candidates (step S206).
- the optimization processing unit 23 calculates an AS combination that optimizes the objective function, and determines the AS combination. It outputs to the output device 4 (step S207), and operation
- step S206 “NO”) the optimization processing means 23 outputs a design inability message to the output device 4 (step S208), and ends the operation.
- FIG. 3 is a flowchart showing the operation of calculating the optimum AS combination according to the present embodiment.
- the purpose of the design considered in the present embodiment is to maximize the worst value of end-to-end data transfer throughput.
- the optimization processing means 23 evaluates, as an objective function, the cost maximum value of the AS link constituting the minimum spanning tree corresponding to each AS candidate combination stored in step S204, and combines all AS candidate combinations. Among these, a combination of AS candidates that minimizes the maximum cost of the AS link is obtained (step S301).
- the maximum link cost refers to the link distance (maximum link distance) that maximizes the link distance between ASs.
- each relay site operates as an HTTP proxy, and the TCP is terminated between the sites on both ends of the AS link. It is intended to maximize the minimum value of end-to-end throughput S.
- the throughput S is given the minimum value of the throughput in each AS link included in the end-to-end path.
- the throughput of each AS link is inversely proportional to the RTT affected by the distance between the sites that terminate the AS link on both sides (cost given to the AS link) because the TCP is terminated between the sites at both ends.
- the minimum value of the throughput S between each incoming and outgoing sites is the maximum link cost (maximum link distance) included in the AS graph. Determined.
- the AS link having the maximum cost is sequentially removed from the given AS graph within a range in which the connectivity is maintained. It will be. The final result of this procedure is not shown here but is considered to be equal to the minimum spanning tree.
- Non-patent document 4 is given as a reference for the above explanation.
- step S202 the minimum spanning tree is extracted earlier than the objective function is evaluated in step S207.
- step S301 when there is one AS candidate combination that minimizes the maximum link distance (step S302 "YES"), the optimization processing means 23 should use the combination of AS candidates at each site.
- the optimum AS combination is determined (step S306).
- step S301 when there are a plurality of combinations of AS candidates that minimize the maximum link distance (step S302 “NO”), the optimization processing unit 23 determines the combination of a plurality of AS candidates that minimizes the maximum link distance. Using the total number of AS links constituting the minimum search tree corresponding to each AS candidate combination as an objective function, a combination of AS candidates that maximizes the total number of AS links is obtained (step S303).
- the combination of AS candidates that maximizes the total number of AS links in step S303 is intended to allow more transfer paths between certain sites and to select a more appropriate path during a failure or congestion. ing.
- step S303 When the result of step S303 is that there is only one AS candidate combination that maximizes the total number of AS links (step S304 "YES"), the optimization processing means 23 uses the AS candidate combination at each site. It is determined that the combination is the optimal AS (step S306).
- step S303 when there are a plurality of combinations of AS candidates that maximize the total number of AS links (step S304 "NO"), the optimization processing unit 23 combines a plurality of AS candidates that maximizes the total number of AS links. , The sum of the distances of the AS links constituting the minimum search tree corresponding to each AS candidate combination is used as an objective function, and a combination of AS candidates that minimizes the sum of the distances of the AS links is obtained (step S305). The optimization processing means 23 sets the obtained combination of AS candidates as the optimum combination of AS to be used at each site (step S306).
- the optimization processing means 23 performs the second objective for a combination of a plurality of AS candidates that are the optimal solutions with the first objective function.
- the third objective function is evaluated for a combination of a plurality of AS candidates that are the optimal solutions in the second objective function, A combination of AS candidates that is an optimal solution in the objective function is determined as an optimal AS combination.
- the design information storage unit 31 stores information on the first, second, and third objective function calculation methods.
- FIG. 4 shows an example of a design problem showing five sites of TYO, HKG, HCM, JKT, and MNL, AS candidates given to them, connection relationships between AS candidates, and distances between sites. ing.
- FIG. 5 shows a result when the above-described operation of the present embodiment is applied to the example of the design problem shown in FIG.
- the result is stored in the reachable combination storage unit 32.
- (TYO, HCM, JKT, MNL) shown in FIG. 5 indicates the combination of AS selected at each site. However, since there is only one AS candidate in the HKG site, it is omitted from the combination elements.
- AS selected at each site is replaced with 0 and 1 as follows.
- the optimization processing unit 23 calculates the cost (city) of the AS link as the first objective function. Evaluate the maximum (distance between).
- the optimization processing means 23 next evaluates the total number of AS links as the second objective function.
- the optimization processing unit 23 determines that the combination of AS is (1, 0, 0, 1), that is, (AS2914, AS9304, AS7643, AS4761, AS6648) is a combination of AS that each site should use. .
- a combination of AS (ASa, ASb, ASc, ASd, ASe) is given to sites 1 to 5. For example, from site 2 to site 4, ASb ⁇ ASa ⁇ ASc. ⁇ The route is ASd, and the throughput is improved as compared with the case where many ASs other than this combination are inserted between ASb and ASd.
- a so-called exhaustive search is performed in order to optimize the objective function under a given constraint.
- a heuristic method called a constrained prim method is used. Find the AS combination that the site should use.
- the prim method is one method for obtaining the minimum spanning tree.
- a node to be newly added to the already obtained subtree is performed so that the cost of a link connected to the node in the current subtree is minimized. Do this recursively until there are no more nodes to add.
- priorities are assigned to the sites included in the design information.
- Priority of sites is determined in order of the order of the site (site order). That is, all sites included in the design information are prioritized in descending order of site order.
- the site order is the maximum AS order (AS order) at each site.
- AS order refers to the total number of other ASs with which each AS has a connection relationship, that is, the total number of AS links extending from the AS in a certain AS.
- an AS that gives the order of the site in each site for the sites having the same order of the site (that is, the AS order is maximum in each site).
- AS are compared with each other and the sites are prioritized in ascending order of the AS numbers.
- the priority order of AS is first ranked in descending order of the AS order at that time, and when there are a plurality of ASs having the same AS order, the AS is ranked in the order of the smallest AS number.
- a subtree is created by the constrained prim method with the following constraints.
- the first constraint is that the site that starts the creation of the subtree should have the highest site priority.
- the site with the highest priority of the site ahead of the AS link is selected as the site to be added.
- the second restriction is that if there are multiple reachable AS candidates in the site determined as the next site to be added according to the prim method, the AS having the highest priority among the plurality of AS candidates is selected.
- the third restriction is that, when one AS is selected at a certain site, other AS candidates at the site and AS links connected to the other AS candidates are deleted. And when entering or leaving the site, be sure to go through the selected AS.
- a network design system 100 includes an input device 1, a data processing device 5, a storage device 6, and an output device 4.
- the data processing device 5 includes design information processing means 51 and AS combination determining means 52.
- the design information processing means 51 creates an input format that is displayed on the output device 4 and allows the designer to input design information.
- the design information processing means 51 converts the design information input by the designer through the input device 1 in accordance with the input format into a format that can be easily processed by the AS combination determination means 52 and stores it in the design information storage unit 61. Perform the process.
- the design information includes the site, the AS candidate given to each site, the presence / absence of a connection relationship between each AS candidate, and the cost given to the connection relationship when there is a connection relationship.
- the design information processing means 51 stores the design information converted into a format that can be easily processed by the AS combination determination means 52 in the design information storage unit 31, and then activates the AS combination determination means 52.
- the AS combination determining means 52 takes out the design information stored in the design information storage unit 61 and stores it in the calculation storage unit 62.
- the AS combination determining means 52 determines the AS combination used by each site from the given AS candidates by the constrained prim method, and simultaneously determines reachability.
- the constrained prim method will be described in detail in the description of the operation.
- the storage device 6 includes a design information storage unit 61 and a calculation storage unit 62.
- the design information storage unit 61 includes a site, an AS candidate given to each site, presence / absence of a connection relationship between each AS candidate, and a cost given to the connection relationship when there is a connection relationship. Information is stored.
- the calculation storage unit 62 stores design information including updated data such as unvisited sites and inter-AS links by calculation processing based on the constrained prim method by the AS combination determination unit 52.
- FIG. 7 is a flowchart showing the operation of the network design system 100 according to the present embodiment.
- the design information processing means 51 displays the input format on the screen of the output device 4, and the designer inputs design information using the input device 1 according to the input format. After the design information is input, the design information processing unit 51 converts the design information into a storage format, stores it in the design information storage unit 61, and activates the AS combination determination unit 52 (step S701).
- step S703 the AS combination determination unit 52 takes out the design information stored in the design information storage unit 61 and stores it in the calculation storage unit 62 (step S702), and the combination of AS used by each site is restricted. It is determined by the prim method (step S703). The specific operation of step S703 will be described later.
- the AS combination determining unit 52 determines the partial tree information in the storage unit 62 for calculation and the design in order to determine whether all sites are reachable.
- the design information in the information storage unit 61 is referred to, and it is checked whether or not the currently obtained subtree includes all the sites initially given as design information (step S811). The partial tree information will be described later.
- the AS combination determining means 52 uses the AS combination selected when each site is added to the subtree as the all sites. It is determined that the AS combination can be reached (step S704 “YES”), the AS combination is output to the output device 4 (step S705), and the operation is terminated.
- the AS combination determining means 52 determines whether all the combinations of AS selected when each site is added to the subtree. It is determined that the sites are not reachable (step S704 “NO”), design failure is output to the output device 4 (step S706), and the operation is terminated.
- FIG. 8 is a flowchart showing the operation of creating a subtree according to this embodiment.
- the AS combination determining unit 52 prioritizes all sites included in the design information in descending order of the site order (step S801).
- step S801 when there is a site having the same site order (step S802 “YES”), the AS combination determining unit 52 gives the order of the site at each site for the sites having the same order of the sites. ASs, that is, ASs having the largest AS order in each site are compared with each other, and the sites are prioritized in ascending order of the AS number (step S803).
- the AS combination determining unit 52 stores the priority information of the sites in the calculation storage unit 62 (step S804).
- the AS combination determining unit 52 refers to the calculation storage unit 62, selects the site having the highest priority as the start site, selects the AS having the highest priority at the site, and selects the subtree. Is started (step S805).
- the AS combination determining unit 52 deletes the AS that was not selected and the AS link extending from the AS, and based on the deleted AS and AS link information, the design information stored in the calculation storage unit 62 is obtained. Update (step S806).
- the AS combination determination unit 52 refers to the design information in the calculation storage unit 62, performs the same processing as steps S801 to S804 on all sites that have not yet been added to the subtree, and performs prioritization again. Then, the priority order information stored in the calculation storage unit 62 is updated (step S807).
- the AS combination determining unit 52 refers to the design information of the calculation storage unit 62, determines a site to be added to the subtree next by the constrained prim method, and then prioritizes the calculation storage unit 62. With reference to the information, the AS having the highest rank in the site determined as the site to be added next to the subtree is determined as the AS to be used in the site, and is added to the subtree (step S808).
- the site to be added next is a site that has not yet been added to the subtree, and has an AS candidate that is connected to the AS link extending from the AS of the site that was added to the subtree immediately before (the site added immediately before). Of these, the site with the lowest link cost is selected.
- the AS combination determining unit 52 deletes the AS not selected in the site determined as the next site to be added to the subtree and the AS link connected to the AS, and uses the deleted AS and AS link information. Based on this, the design information stored in the calculation storage unit 62 is updated (step S809).
- the AS combination determining unit 52 refers to the calculation storage unit 62 and confirms whether there is a site (addable site) that can be added next (step S810).
- the AS combination determining unit 52 searches for a site having an AS candidate connected to the AS link extending from the AS of the immediately preceding additional site, and when there is no site connected to the AS of the immediately preceding additional site, one of the immediately preceding additional sites. Going back to the previous site, similarly, a site having an AS candidate connected to the AS link extending from the AS of the previous site is searched. Then, the site found by the above search is determined as an addable site.
- step S810 “YES”) the AS combination determining unit 52 returns to the process of step S807, and repeats the processes of steps S807 to S810 until there is no addable site, and in step S810. If it is determined that there is no site that can be added, the AS combination determining unit ends the operation of creating the subtree (step S810 “NO”).
- FIG. 9 shows a result when the operation of the present embodiment described above is applied to the example of the design problem given in FIG. The result is stored in the calculation storage unit 62.
- step S805 the TYO site is selected as the start site of the subtree.
- the AS2914 is selected at the TYO site because the AS order of the AS2914 is “3” while the AS order of the AS2914 is “4”.
- step S807 priorities are assigned again to the sites excluding the TYO site, and in step S808, the next site to be added to the subtree is determined.
- the HKG site is added to the subtree in step S808, and the design information is updated in step S809. Since the HKG site has only one AS, it is necessarily an AS used by the AS 9304.
- step S810 when an addable site is confirmed in step S810, since there are three AS links extending from HKG (AS9304), MNL, JKT, and HCM, the process returns to step S807.
- step S807 priorities are assigned to sites excluding the TYO site and the HKG site, and in step S808, the next site to be added to the subtree is determined.
- step S808 considering the above three sites as candidates to be added to the TYO-HKG subtree, the cost between TYO-MNL is minimum, so an MNL site is added, and the AS66648 with the higher rank is added. select.
- the possibility of increasing the number of routes that can be taken with other ASs can be increased by selecting an AS having a high degree.
- the amount of calculation by the normal prim method is L * logN, but with the constrained prim method, each time a site is added, the ASs that can be used at that site are sorted among the remaining sites, so the amount of computation for this processing is O (N * A * logA), and therefore the amount of calculation by the constrained prim method is O (L * N * logN * A * logA).
- the total number of combinations of AS in A N when extracting the minimum spanning tree in Prim's algorithm, the calculation amount of extract unloading becomes O (L * logN), thus, the minimum spanning tree
- the amount of calculation for extracting the prim by the prim method is O (A N * L * log N).
- connection relations based on information registered in the Internet Routing Registry is obtained from the Robotex site (http://www.robtex.com/).
- a design including a site specialized in relaying is performed in addition to a site for transmitting or receiving data.
- step S203 of FIG. 2 and step S704 of FIG. 7 it is assumed that the design has been completed if reachability can be confirmed at least between sites given as arrival and reception sites. That is, it is not necessary to ensure reachability between all given relay sites and other sites.
- the reason is, for example, in the problem example of FIG. 4, assuming that only the HKG site is a relay-dedicated site and all other sites are given as outgoing / incoming sites, if the data transfer path includes the HKG site, The minimum value of the maximum link distance is 3212 as shown in FIG.
- the minimum value of the maximum link distance can be reduced from 5768 to 3212, leading to an improvement in data transfer throughput.
- the IP address is transferred to the called site at the calling site.
- the set packet is transferred as it is to the Internet, if there is no connection relationship between the AS used by the calling site and the called site, the packet is transferred according to BGP routing, and the design method provided by the present invention is not necessarily provided. It is not always transferred on the intended route.
- each relay site when transferring HTTP data between the originating site and the terminating site, each relay site terminates TCP and operates as a proxy that extracts HTTP data.
- each relay site is operated as a proxy cache so that the data can be returned each time there is a request.
- each edge site is set so that it can be transferred based on the route between the outgoing and incoming sites that can be set on the AS graph obtained by design.
- the next transfer destination of the HTTP get request is set as the “parent” of the proxy for the domain included in the URL requested by the HTTP get request. Set it.
- the route with the smallest AS link distance included in each route is preferentially selected.
- the distance of the AS link is given by the distance between the sites that terminate the AS link on both sides. The reason for this is the same as trying to maximize end-to-end TCP throughput at design time.
- TYO-MNL 1-hop route 2990 km
- TYO-HKG-MNL 2-hop route 2854 km + 1013 km
- 2-hop route of TYO-HKG-MNL is used in preference to the 1-hop route of TYO-MNL.
- the HKG site and the TYO site are set as parents at the MNL site, and the weight assigned to each is set so that HKG> TYO.
- the calling site when data is transferred between the calling site and the called site by the route based on the AS graph obtained by the first embodiment and the second embodiment, in the calling site, If a packet whose IP address is set at the incoming site is transferred to the Internet as it is, even if there is no connection relationship between the AS used by the outgoing site and the incoming site, along the route based on the AS graph Transferred.
- each site has used the AS constituting the Internet as a network operation unit to be selected / determined, but as a network operation unit based on other technologies,
- An Ethernet domain discussed in MEF (Metro Ethernet Forum) shown in Non-Patent Document 6 is also conceivable.
- E-NNI E-NNI
- Non-patent document 5 and non-patent document 6 are given as references for the above explanation.
- FIG. 10 is a block diagram illustrating a hardware configuration example of the network design system 100.
- the network design system 100 has a hardware configuration similar to that of a general computer device, and includes a data work area including a memory such as a CPU (Central Processing Unit) 801 and a RAM (Random Access Memory). And a main storage unit 802 used for a temporary data saving area, a communication unit 803 that transmits and receives data via a network, an input / output interface that transmits and receives data by connecting to the input device 805, the output device 806, and the storage device 807 A unit 804 and a system bus 808 for interconnecting the above components.
- the storage device 807 is realized by, for example, a hard disk device including a non-volatile memory such as a ROM (Read Only Memory), a magnetic disk, and a semiconductor memory.
- the data processing device 809 of the network design system 100 of the present invention implements its operation in hardware by mounting circuit components which are hardware components such as LSI (Large Scale Integration) incorporating a program. Needless to say, it is also possible to realize the program by storing a program providing the function in the storage device 807, loading the program into the main storage unit 802, and executing it by the CPU 801.
- LSI Large Scale Integration
- a content distribution service and an application distribution service are provided from a plurality of geographically distributed server sites or data centers on the Internet composed of a large number of ASs as network operation units. It can be applied to any use.
- not only content distribution from the origin site to the edge site but also the result processed by the application of the origin server is transmitted to the end user's Web client via one or a plurality of relay sites. It can also be used for application distribution.
Abstract
Description
本発明の目的は、サーバ間でよりスループットの高いデータ転送ができるネットワークの設計が可能なネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラムを提供することである。
図1は、本発明の第1の実施の形態によるネットワーク設計システムの構成を示す図である。
次に、図1及び図2を参照して、本実施の形態の動作について詳細に説明する。図2は、本実施の形態によるネットワーク設計システム100の動作を示す流れ図である。
以下、図2のステップS207において最適なASの組合せを算出するための具体的な方法について、図3を参照して詳細に説明する。図3は、本実施の形態による最適なASの組合せ算出の動作を示す流れ図である。なお、本実施の形態で考える設計の目的は、エンドツーエンドのデータ転送スループットの最悪値を最大化することである。
図4はTYO,HKG,HCM,JKT,MNLの5つのサイトと、それぞれに与えられたAS候補と、AS候補間にある接続関係と、サイト間の距離とを示した設計問題の例を示している。
TYOサイト: AS2516=0, AS2914=1
HCMサイト: AS7643=0, AS18403=1
JKTサイト: AS4761=0, AS7713=1
MNKサイト: AS4775=0, AS6648=1
次に、図5に示すテーブルの中身と、最適化の過程について説明する。
次に本実施の形態の効果について説明する。
次に、本発明の第2の実施の形態によるネットワーク設計システム100について、図面を参照して詳細に説明する。
次に、図6及び図7を参照して、本実施の形態の動作について詳細に説明する。図7は、本実施の形態によるネットワーク設計システム100の動作を示す流れ図である。
ここで、ステップS703の動作について、図8を参照して説明する。図8は、本実施の形態による部分木作成の動作を示す流れ図である。
図9は、図4で与えられた設計問題の例に対して、上述した本実施の形態の動作を適用したときの結果を示している。当該結果は、演算用記憶部62に格納されている。
以下、本実施の形態による制約付きプリム法により図9の解を求めた手順を説明する。
次に本実施の形態の効果について説明する。
次に、本発明の第3の実施の形態によるネットワーク設計システム100について、詳細に説明する。
次に本実施の形態の効果について説明する。
次に、本発明の第4の実施の形態によるネットワーク設計システム100について、図面を参照して詳細に説明する。
次に本実施の形態の効果について説明する。
Claims (26)
- ネットワークを構成する複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて全サイトが到達可能になるように、各々のサイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定することを特徴とするネットワーク設計方法。
- ネットワークを構成するデータの発信もしくは着信を行う複数のサイトと中継のみを行う複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて少なくともデータの発信もしくは着信を行う全サイトが到達可能となるように、各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定することを特徴とするネットワーク設計方法。
- 各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、
異なるサイト間の接続関係のある前記ネットワーク運用単位の各ペア間に与えられたコストに基づいて最小全域木を作成し、前記最小全域木において前記コストの最大値を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項1又は請求項2に記載のネットワーク設計方法。 - 各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、前記ネットワーク運用単位の各ペア間で有する接続関係の総数を最大とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項3に記載のネットワーク設計方法。
- 前記各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、接続関係を有する前記ネットワーク運用単位の各ペア間に与えられたコストの総和を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項4に記載のネットワーク設計方法。
- 使用すべき前記ネットワーク運用単位を順番にサイトを選択する毎に決定し、新たに選択すべきサイトをプリム法に基づいて決定し、前記新たに選択すべきサイトで使用すべき前記ネットワーク運用単位を、他のサイトの前記ネットワーク運用単位との間に予め与えられた接続関係の総数に基づいて決定することを特徴とする請求項1又は請求項2に記載のネットワーク設計方法。
- 前記ネットワーク運用単位が、インターネットを構成する自律システムであることを特徴とする請求項1から請求項6の何れかに記載のネットワーク設計方法。
- 前記ネットワーク運用単位が、イーサネット・ドメインであることを特徴とする請求項1から請求項6の何れかに記載のネットワーク設計方法。
- ある発信サイトから別の着信サイトにデータを転送する際の経路を、請求項1から請求項8の何れかに記載のネットワークの設計方法で得られた前記ネットワーク運用単位の各ペアに予め与えられた接続関係に基づいて決定することを特徴とするデータ転送経路決定方法。
- あるサイトから、他の1以上のサイトに対してHTTPデータを分配する場合、分配経路上の各サイトを、HTTPのプロキシーサーバもしくはキャッシュサーバとして動作させることを特徴とする請求項9に記載のデータ転送経路決定方法。
- ネットワークを構成する複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて全サイトが到達可能になるように、各々のサイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定する処理手段を備えることを特徴とするネットワーク設計システム。
- ネットワークを構成するデータの発信もしくは着信を行う複数のサイトと中継のみを行う複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて少なくともデータの発信もしくは着信を行う全サイトが到達可能となるように、各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定する処理手段を備えることを特徴とするネットワーク設計システム。
- 前記処理手段は、
各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、
異なるサイト間の接続関係のある前記ネットワーク運用単位の各ペア間に与えられたコストに基づいて最小全域木を作成し、前記最小全域木において前記コストの最大値を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項11又は請求項12に記載のネットワーク設計システム。 - 前記処理手段は、
各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、前記ネットワーク運用単位の各ペア間で有する接続関係の総数を最大とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項13に記載のネットワーク設計システム。 - 前記処理手段は、
前記各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、接続関係を有する前記ネットワーク運用単位の各ペア間に与えられたコストの総和を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項14に記載のネットワーク設計システム。 - 前記処理手段は、
使用すべき前記ネットワーク運用単位を順番にサイトを選択する毎に決定し、新たに選択すべきサイトをプリム法に基づいて決定し、前記新たに選択すべきサイトで使用すべき前記ネットワーク運用単位を、他のサイトの前記ネットワーク運用単位との間に予め与えられた接続関係の総数に基づいて決定することを特徴とする請求項11又は請求項12に記載のネットワーク設計システム。 - 前記ネットワーク運用単位が、インターネットを構成する自律システムであることを特徴とする請求項11から請求項16の何れかに記載のネットワーク設計システム。
- 前記ネットワーク運用単位が、イーサネット・ドメインであることを特徴とする請求項11から請求項16の何れかに記載のネットワーク設計システム。
- コンピュータに、
ネットワークを構成する複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて全サイトが到達可能になるように、各々のサイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定する決定処理を実行させることを特徴とするネットワーク設計プログラム。 - コンピュータに、
ネットワークを構成するデータの発信もしくは着信を行う複数のサイトと中継のみを行う複数のサイトの各サイトに少なくとも1つ与えられたネットワーク運用単位の候補について、異なるサイト間の前記ネットワーク運用単位の候補の各ペアに与えられた接続関係に基づいて少なくともデータの発信もしくは着信を行う全サイトが到達可能となるように、各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを決定する決定処理を実行させることを特徴とするネットワーク設計プログラム。 - 前記決定処理において、
各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、
異なるサイト間の接続関係のある前記ネットワーク運用単位の各ペア間に与えられたコストに基づいて最小全域木を作成し、前記最小全域木において前記コストの最大値を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項19又は請求項20に記載のネットワーク設計プログラム。 - 前記決定処理において、
各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、前記ネットワーク運用単位の各ペア間で有する接続関係の総数を最大とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項21に記載のネットワーク設計プログラム。 - 前記決定処理において、
前記各サイトが1つ使用すべき前記ネットワーク運用単位の組合せを、更に、接続関係を有する前記ネットワーク運用単位の各ペア間に与えられたコストの総和を最小とする前記ネットワーク運用単位の組合せを算出することにより決定することを特徴とする請求項22に記載のネットワーク設計プログラム。 - 前記決定処理において、
使用すべき前記ネットワーク運用単位を順番にサイトを選択する毎に決定し、新たに選択すべきサイトをプリム法に基づいて決定し、前記新たに選択すべきサイトで使用すべき前記ネットワーク運用単位を、他のサイトの前記ネットワーク運用単位との間に予め与えられた接続関係の総数に基づいて決定することを特徴とする請求項19又は請求項20に記載のネットワーク設計プログラム。 - 前記ネットワーク運用単位が、インターネットを構成する自律システムであることを特徴とする請求項1から請求項6の何れかに記載のネットワーク設計プログラム。
- 前記ネットワーク運用単位が、イーサネット・ドメインであることを特徴とする請求項1から請求項6の何れかに記載のネットワーク設計プログラム。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/392,077 US9197534B2 (en) | 2009-08-26 | 2010-08-19 | Network designing system, network designing method, data transfer path determination method and network designing program |
JP2011528755A JP5598474B2 (ja) | 2009-08-26 | 2010-08-19 | ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2009-195499 | 2009-08-26 | ||
JP2009195499 | 2009-08-26 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2011024701A1 true WO2011024701A1 (ja) | 2011-03-03 |
Family
ID=43627807
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2010/063989 WO2011024701A1 (ja) | 2009-08-26 | 2010-08-19 | ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム |
Country Status (3)
Country | Link |
---|---|
US (1) | US9197534B2 (ja) |
JP (1) | JP5598474B2 (ja) |
WO (1) | WO2011024701A1 (ja) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5598474B2 (ja) * | 2009-08-26 | 2014-10-01 | 日本電気株式会社 | ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム |
US8750095B2 (en) * | 2012-06-26 | 2014-06-10 | Cisco Technology, Inc. | System and method for protection against edge node failure |
US9973418B2 (en) * | 2013-11-12 | 2018-05-15 | Software Ag | Techniques for change propagation across broker territories |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6987740B1 (en) * | 2000-09-11 | 2006-01-17 | Cisco Technology, Inc. | STP root guard |
US7036119B1 (en) * | 2002-07-15 | 2006-04-25 | Cisco Technology, Inc. | Method and apparatus for creating a network topograph that includes all select objects that are in a network |
US20040034702A1 (en) * | 2002-08-16 | 2004-02-19 | Nortel Networks Limited | Method and apparatus for exchanging intra-domain routing information between VPN sites |
JP3968060B2 (ja) | 2003-07-11 | 2007-08-29 | 日本電信電話株式会社 | セッションメディア保留方法、保留装置、保留プログラム及び該プログラムを記録した記録媒体 |
US20050083964A1 (en) * | 2003-10-15 | 2005-04-21 | Tatman Lance A. | Method and system for the centralized collection of link state routing protocol data |
US20060067337A1 (en) * | 2004-09-30 | 2006-03-30 | Netravali Arun N | Methods and devices for generating a hierarchical structure for the internet |
US7693071B2 (en) | 2005-05-27 | 2010-04-06 | Microsoft Corporation | System and method for routing messages within a messaging system |
US7936719B2 (en) * | 2006-04-20 | 2011-05-03 | Toshiba America Research, Inc. | Packet loss prevention during handoff using packet copy-and-forward |
US7760668B1 (en) * | 2006-06-20 | 2010-07-20 | Force 10 Networks, Inc. | Self-reconfiguring spanning tree |
US8161550B2 (en) * | 2007-01-23 | 2012-04-17 | Knowledge Based Systems, Inc. | Network intrusion detection |
US8102775B2 (en) * | 2007-03-12 | 2012-01-24 | Cisco Technology, Inc. | Joining tree-based networks into an autonomous system using peer connections between the tree-based networks |
JP2010525638A (ja) | 2007-04-19 | 2010-07-22 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 複数のスパニング・ツリーの決定のための方法及び装置 |
AU2008338259A1 (en) * | 2007-12-17 | 2009-06-25 | Leximancer Pty Ltd | Methods for determining a path through concept nodes |
JP5058135B2 (ja) | 2008-02-08 | 2012-10-24 | パナソニック株式会社 | 端末装置 |
US8224804B2 (en) * | 2009-07-22 | 2012-07-17 | Microsoft Corporation | Indexing of partitioned external data sources |
JP5598474B2 (ja) * | 2009-08-26 | 2014-10-01 | 日本電気株式会社 | ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム |
-
2010
- 2010-08-19 JP JP2011528755A patent/JP5598474B2/ja not_active Expired - Fee Related
- 2010-08-19 WO PCT/JP2010/063989 patent/WO2011024701A1/ja active Application Filing
- 2010-08-19 US US13/392,077 patent/US9197534B2/en not_active Expired - Fee Related
Non-Patent Citations (3)
Title |
---|
KAZUHIKO YAMAMOTO ET AL.: "Nippon Internet no AS eno Bunkatsu ni Tsuite", INFORMATION PROCESSING SOCIETY OF JAPAN KENKYU HOKOKU, 93-DPS-59-5, 29 January 1993 (1993-01-29) * |
MASAAKI YONEDA: "Kawaru Internet no Kozo Provider Kan Setsuzoku ni Shin Rule", NIKKEI COMMUNICATION, 15 December 1997 (1997-12-15), pages 146 - 155 * |
MOTOHISA KONNO: "Traffic o Jyunan ni Sosa suru BGP no Keiro Sentaku o Master", NIKKEI NETWORK, 22 June 2007 (2007-06-22), pages 174 - 178 * |
Also Published As
Publication number | Publication date |
---|---|
US9197534B2 (en) | 2015-11-24 |
JPWO2011024701A1 (ja) | 2013-01-31 |
US20120158924A1 (en) | 2012-06-21 |
JP5598474B2 (ja) | 2014-10-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
TWI803687B (zh) | 用於路由最佳化的系統及其方法 | |
Godfrey et al. | Pathlet routing | |
US7619982B2 (en) | Active probe path management | |
US7401160B2 (en) | Registration of routers in a hierarchy of routers | |
CN100555968C (zh) | Igp中的bgp下一跳路由的自动路由标记 | |
JP5391777B2 (ja) | 経路選択方法及び経路選択システム並びにそれに用いるルータ | |
Rakheja et al. | Performance analysis of RIP, OSPF, IGRP and EIGRP routing protocols in a network | |
US20020051449A1 (en) | Interdomain routing system | |
RU2558624C2 (ru) | Устройство управления, система связи, способ связи и носитель записи, содержащий записанную на нем программу для связи | |
JP2006333469A (ja) | 自律システムにおけるトラフィックエンジニアリングに関するトポロジの追跡 | |
WO2016094037A1 (en) | Stateful load balancing in a stateless network | |
JP4598789B2 (ja) | 経路計算制御方法、経路計算制御プログラムおよび経路計算制御装置 | |
ITTO20060149A1 (it) | Tecnica per l'instradamento ottimizzato di flussi di dati su una dorsale ip in una rete di computer. | |
US20130151445A1 (en) | Method and System for Survival of Data Plane Through a Total Control Plane Failure | |
JP4320433B2 (ja) | オーバーレイリンク計算装置およびその計算方法ならびにプログラム | |
US8811226B2 (en) | Management of routing topology in a network | |
JP2010200026A (ja) | 論理ネットワークのトラヒック制御方法とシステムおよびプログラム | |
JP5598474B2 (ja) | ネットワーク設計システム、ネットワーク設計方法、データ転送経路決定方法、ネットワーク設計プログラム | |
CN104158736B (zh) | 一种确定下一跳、发布路由信息的方法和装置 | |
Coltun et al. | The ospf nssa option | |
JP5598475B2 (ja) | ネットワーク運用システム、ネットワーク運用方法、及びネットワーク運用プログラム | |
JP2006270781A (ja) | リソース管理装置、システムおよび方法 | |
Cisco | Configuring OSPF | |
Chen et al. | Distributed qos routing | |
US20090271523A1 (en) | System, Method and Software for Using One Computer Network to Bypass a Portion of Another Computer Network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 10811751 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2011528755 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13392077 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 10811751 Country of ref document: EP Kind code of ref document: A1 |