WO2004086697A1 - Node device having links and method for allocating user band to links - Google Patents

Node device having links and method for allocating user band to links

Info

Publication number
WO2004086697A1
WO2004086697A1 PCT/JP2003/003572 JP0303572W WO2004086697A1 WO 2004086697 A1 WO2004086697 A1 WO 2004086697A1 JP 0303572 W JP0303572 W JP 0303572W WO 2004086697 A1 WO2004086697 A1 WO 2004086697A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
link
user
bandwidth
links
packet
Prior art date
Application number
PCT/JP2003/003572
Other languages
French (fr)
Japanese (ja)
Inventor
Hiroshi Tomonaga
Kenichi Kawarai
Kazuto Nishimura
Naoki Matsuoka
Original Assignee
Fujitsu Limited
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks

Abstract

A node device connected to adjoining other node devices through links and even transmitting distributed packets to the links while securing the packet order. The node device holds a table where user identification information is related to one link for transmitting the packet of the user of the user identification information. The node device extracts the user identification information contained in the received packet and finds the link corresponding to the extracted user identification information from the table, and transmits the received packet to the found link. Since one link is allocated to each user, the packet order of each user is secured.

Description

User bandwidth allocation method art to Roh one de device and a plurality link having a plurality link

The present invention is provided in a communication network are connected via a node device and a plurality link adjacent to the downstream side, it relates node device that transmits the received packet to Roh one de device adjacent to the downstream side, in particular, a plurality links for node device can guarantee the order of the packet even when the transmission distributes the packet to. Further, the present invention is related to allocation method to multiple links users bandwidth that can guarantee the order of Baketsuto. BACKGROUND

In recent years, the advent of media such as light to handle the explosive growth Ya large-capacity, high-quality information on the Internet, and is expected to the development of large-scale communications infrastructure are asked that can handle large volumes of data in flexible there. In communications infrastructure, there is a method as a method of accommodating the traffic to expand, providing a plurality of links between the transmission device. For example, a method such as increasing the link bandwidth of 1 G bps between the transmission apparatus to three from one. This method is, in the I one Sir net, has been called a link § Gris game Chillon, are defined in the IEEE 8 0 2. 3.

If multiple links are provided between the transmission device, it distributes one to the packet (frame) of a plurality of links from the transmission apparatus (assigned) force, realize band guarantee service, the effective utilization of the link (band) it becomes important from the point of view.

IEEE 8 0 2 In. 3 links § Gris Gen ® down, in case of providing a plurality of links, (1) that the order of Baketsuto per flow is ensured, and (2) bucket Bok replication stuffiness, it , but the algorithm shown how to transmit it Ri divided vibration packets to force more links that is the condition is not specified.

The packet as one method of how distributed to a plurality of links, each for transmitting Baketsuto, there is a method of gradually switching the link cyclically. However, in this method, since the packet length is variable, the order of the packets is not guaranteed. For example, after the first packet of the same user is transmitted to the first link, in the case where the second bucket Bok is transmitted to the second link, when the first Baketsuto is Baketsuto length is longer than the second Baketsuto is second bucket Bok sent later to reach the transmission destination apparatus before, it may order reversal occurs. To prevent such an order reversed securely, the source transmission apparatus, MA C address, the input port, IP § address, identify the attributes of the packet, such as port number, the packet identical with the same attribute values by distributing the link, Rereru to guarantee the order of the packet of flow per scratch. Further, in order to evenly distribute the packets to a plurality of links, the hash value obtained by substituting the attributes I straight of the packet to the hash function, there is a method to distribute the link packets randomly. Baketsuto belonging to the same flow (or user), because they have the same hash value is distributed to the same link. Thus, the order of the packets for each full port one is guaranteed. However, Nono Mesh value determined by the attribute value of the packet, might biased by the attribute value, as a result, Baketsuto is distributed more to a particular link, such necessarily be evenly distributed les. Therefore, it is impossible to effectively use the enhanced link band. Although base may be this against Sutefo bets (Best Effort) service, you can guarantee a reliable bandwidth bandwidth guaranteed service, considering the worst case, limited to the band of 1 links worth no matter how increasing the number of links It would be.

As the prior art for realizing a band guarantee service, there are concerns network management system, not assume multiple links, thus the distribution of Baketsuto to multiple links between transmission devices are considered not (for example, see Patent Document 1).

As the conventional band control device, and trunking multiple physical links into a single logical link, the specific number of the physical links in the logical link, and converges to fit the traffic of the particular condition sub-logical link at the traffic min Rooster himself to shall in (for example, see Patent Document 2).

Patent Document 1

JP 1 1 1 7 7 6 1 7 JP (page 2) Patent Document 2

JP 2 0 0 2 - 2 3 2 4 2 7 JP (page 2) Disclosure of the Invention

The present invention aims at Roh one de having a plurality link, that you guarantee the order of the packets.

Node So匱 according to the invention is provided in a communication network are connected via a node device and a plurality of links adjacent to the downstream side, there in the node apparatus for transmitting Baketsuto received in 瞵 contact node device downstream side Te, wherein included in the received Baketsuto, the user information extraction unit for extracting user identification information indicating the transmission source user of the Baketsuto, the user identification information of the transmission source user of Baketsuto, among the plurality of links, the holding the assignment data that associates the identification information of one of the links on the assigned user of the user identification information, obtaining the identification information of the user information extraction unit link corresponding to the user identification information extracted by the data be transmitted and holding portion, the link corresponding to the identification information of the link that has been determined by the data holding unit, the received packet Includes a packet transmission unit that, the.

According to the present invention, packets transmitted from a user is transmitted being distributed to predetermined one link of the multiple links. Thus, it is possible to order reversal between buckets bets the user is avoided, to ensure the order of Baketsuto.

Preferably, one link assigned to the user of the user identification information is the link to guarantee the requested bandwidth of the user. Thus, bandwidth assurance service is realized.

The node device according to the invention is provided in a communication network are connected via a next contact Roh one de device and a plurality of links on the upstream side, further downstream packets received from the adjacent Roh one de in the upstream Roh one de apparatus der transmitted to the side of the node device connexion, and a plurality of reception buffers for temporarily storing packets received from each of the plurality of links, the plurality of reception buffer monitor, said upstream It is to that node device adjacent sent when switching the link to send Baketsuto to, when the control Baketsuto showing the link switching is received in at least one reception buffer wherein the plurality of the plurality of receive buffers until all the control Baketsuto is received, Baketsuto reading of the control Baketsuto is subsequently received to the receive buffer that has been received It stopped and all the control bucket Bok of the plurality of receiving buffers Ru is received, and a read control unit for transmitting a packet to resume reading the packet from the 'plurality of receive buffers.

User bandwidth allocation method according to the invention is carried out in Nettowa Ichiku management apparatus for managing a communication network in which a plurality of links between adjacent Roh one de device is provided, the allocation of the bandwidth of the user to the plurality link Interview one the bandwidth allocation method der connexion, among the plurality links, if one link is selected by selecting a link having a free bandwidth of more than the required bandwidth of a user, said selecting step, said assign the required bandwidth of the user to one of the links, when two or more links is selected, one of the two or more links, the largest link free band, the smallest link free band, utilization most select a high link or lowest I link utilization, Bei a, and allocating the requested bandwidth of the user to the selected link That.

According to the present invention, the required bandwidth of the user is assigned to a predetermined one link of the multiple links. Thus, the packet of a certain user is transmitted over a single link which hail allocated, as possible out to ensure the order of the packet of the user.

Further, the invention is implemented in a network management device for managing a communication network in which a plurality of links provided between the adjacent node device, a user bandwidth allocation method of allocating the bandwidth of the user to the plurality link Te, allocation of the when bands of a plurality link to one or more users have already been allocated, when allocating the requested bandwidth of the user to be newly Tsuika卩, band of users assigned to 該既and releasing the, among the requested bandwidth and the requested bandwidth of the newly added user of the user who has the release, the step of selecting the maximum required bandwidth from among the required bandwidth allocation is not determined user When the one of the plurality link, select the link having the largest request bandwidth over available bandwidth, wherein the selected step And flop, if one link is selected by said selecting step assigns the maximum requested bandwidth to the one link, when two or more links have been selected by said selecting step, said of the two or more links, most significant link free band, the smallest link free band, the highest link utilization, or select the lowest link utilization, bandwidth request outermost size to the selected link and a step to assign.

Also according to this invention, the required bandwidth of the user, because it is assigned to a predetermined single link of the multiple links, can be achieved order guarantee bucket Bok. BRIEF DESCRIPTION OF THE DRAWINGS

Figure 1 shows an example of a communication network in which the present invention is applied.

Figure 2 is a Furochiya one preparative showing the flow of overall processing of NM S.

Figure 3 is a block diagram showing a configuration of each switch in the carrier network. Figure 4 is a flow Chiya one preparative showing a flow of a user bandwidth allocation process performed by the NM S.

Figure 5 shows the yield Yorei additional user bandwidth when the link 1 G bps is provided this 4.

6, one link of 1 G bps, showing a housing examples of additional user bandwidth when the link 1 0 OM bps is three.

Figure 7 is a flow chart showing the flow of a user bandwidth allocation process performed by the NM S.

Figure 8 illustrates a bandwidth allocation example according to the flow chart in FIG.

Figure 9 is a Proc diagram showing a configuration of a switch.

Figure 1 0 is a block diagram showing the configuration of a switch.

Figure 1 1 is a flowchart illustrating the flow of link assignment process when a link failure occurs due NM S.

Figure 1 2 shows the bandwidth allocation example according to the flowchart of FIG 1.

Figure 1 3 is a flowchart showing a flow of a process of allocating a bandwidth according to priority.

Figure 1 4 is a block diagram showing the configuration of a switch. Figure 1 5 is a block diagram showing the configuration of a switch.

Figure 1 6 is a Proc diagram showing a configuration of a Suitsuchi.

Figure 1 7 is a full opening one Chiya one preparative showing processing off port one read controller of the receiving side Suitsuchi.

Figure 1 8 is a block diagram showing the configuration of a switch.

Figure 1 9 is a block diagram showing the configuration of a switch. BEST MODE FOR CARRYING OUT THE INVENTION

Figure 1 shows an example of a communication network in which the present invention is applied, Virtual LAN: shows a configuration example of a wide area L AN using (VL AN Virtual LAN). For example headquarters of a certain user (e.g., companies), branches, the plurality of locations A~E such as factories, the user of the L AN (not shown) are disposed respectively. And, of these bases

By L AN is connected to a carrier network 1, one of the user V

L AN 2 is formed.

In Figure 1, but shows only VL AN of one user, the carrier net Wa chromatography click 1, also bases L AN other users are connected, of the other users VL AN is made form even good record,.

Carrier network 1 has a switch 1 1 to 1 7 as an example of a node device, a plurality link is provided in a part between the switches. For example, between switch 1 1 1 2 and between switch 1 3 1 6, 1 link G bps is provided two, between switch 1 1 one 1 3, provided links l G bps is present 3 are provided links 1 0 0 M bps are two between Suitsu Chi 1 3 _ 1 7. In the form status of this embodiment, the present investigation is applied to the distribution of packets in the plurality link between the switch (assignment).

The Baketsuto inputted from each site to Kiyariane' network 1, in Suitsuchi 1 4-1 7 is the entry node, VLAN tag assigned to each user (VLAN-TAG) is added. Packets VLAN-tagged, are switched based on the MAC (Media Access Control) address included in the header of Kiyari Ane' Bok work within 1 VLAN tag and buckets Bok to the, is transferred to the base L AN purposes . In switch 14-17 is connected to the egress node on the destination site, V LAN tag is removed, packet Bok after removal is sent to the desired site LAN.

In this embodiment, the packet of a certain user is allocated to one link selected from a plurality links between switches, never be distributed et distributed across two or more links. Thus, the order of the packet of the user is ensured. The good Unapaku - in order to perform the sorting of Tsu bets, in this embodiment V and AN tags are used.

Setting or distribute the Baketsuto of each user on any link, network management system for managing the careers net Wa over click 1 (NMS: Network Management System) 10 months ^ Gyou. In the large carrier network, NMS is hierarchical, there is a case where EMS to the lower-level NMS (Element Management System) is provided, in this case, EMS may perform setting of the sorting . In the following there will be described as an example a case where the NMS 10 is performed.

First, the setting of the user band by NMS 10, after describing the overall off port one up to the distribution set for each switch, that describes a specific method of sorting. Further, thereafter, in the case of changing from one distributed to other distribution will be described how to change the order to the order guarantee packet.

Figure 2 is a flow chart showing the flow of overall processing of NMS 1◦.

When a user (here, the user of the V LAN 2 of FIG. 1.) Joins the wide area LAN service by VLAN, NMS 10 sets Interview one The bandwidth for each site for the user (S 1) . For example, in FIG. 1, 1Gb ps is set based in A~C and E 100M bps, based in D.

Subsequently, NM S 10 is the network structure of Kiyari network 1, Interview - The calculates the bandwidth of each link bundle used (S 2). For example, in FIG. 1, 300 Mb ps of the band of 1Gb ps X 2 between Suitsu Ji 1 1 one 1 2 is calculated. Among the numbers shown adjacent to the link between switches in FIG. 1, the denominator represents the total bandwidth between Suitsu Ji, molecules indicates a band which is calculated for the user.

Then, NMS 10 checks the free band of each link of each link bundles, to determine the distribution link (S 3). In this method, there are a number of ways, will be described in detail later. Finally, NM S 1 0, based on the determined distribution link, the distribution tape le created for each Suitsuchi, set for each switch (S 4). The setting of each Suitsuchi the distribution table is indicated by broken line arrow in FIG. 1, it is carried out via a control line for connecting the NM S 1 0 and hide switch.

Figure 3 is a Proc diagram showing the configuration of each Suitsuchi carrier network 1. Suitsuchi has a distribution table holding unit 3 1, the user information extracting section 3 2, and the output link sorting section 3 3.

Sorting table holding unit 3 1 holds NM S 1 0 of the step S sorting table 3 1 a which is set by the processing of 4. Sorting table 3 1 a, in this embodiment, the VL AN tag as an example of user information (user identification information), the VL AN tag assignment link number packet users are distributed with a (link identifier) ​​Power Ranaru. In Figure 3, VL AN tag = 1 link 1 the user of the packet of the user links 2 force VL AN tag = 2 or 3 in Baketsuto is, the VL AN tag = 4 users packet link 3, assigned each is, Ru.

Packet input to switch is input to the user information extracting section 3 2. User information extracting section 3 2 extracts the VL AN tag as the user information included in Baketsuto, extracted with giving the Tepunore holder 3 1 distributes VL AN tag, outputs the input Baketsuto link sorting section 3 3 give in. Sorting table holding unit 3 1, determined from the sorting table 3 1 a of the assignment link number corresponding to the VLAN tag provided by the user information extracting section 3 2, gives the output link sorting section 3 3 allocation link number obtained .

Output link sorting section 3 3, the distribution table holding section 3 1 corresponding links in spite Ri rely link number given from outputs the packets supplied from the user information extracting section 3 2. Thus, the user of the bucket VL AN tag = 1 is output to the link 2, VL AN bucket Bok tag = 2 or 3 of the user is output to the link 1, VL AN tag = 4 in the packet link user is output to the 3. As a result, the order assurance of packets of each user can be reduced. Further, by making the distribution table and also an appropriate, it is also possible to effectively use the bandwidth of each link.

Here, the force \ ie Then distributes how packets of each user into a plurality of links, the force created how the distribution table \ In other words, the method of the step S 3, since there are several methods, in the following, we describe these methods.

First, it describes the assignment how users bands to multiple links provided between Suitsuchi. Figure 4 is a flowchart showing a flow of user bandwidth allocation process performed by the NM S 10.

In bandwidth guaranteed service, when the user contracts, subscribers, the guaranteed bandwidth of the user is determined. NMS 10, among the plurality links between switches present on its root determined in the carrier network 1, to select a link having a free bandwidth than the guaranteed bandwidth (S 1 1). For example, 1 with 1, when assigning user guaranteed bandwidth 300 Mb ps to three links between switches 1 1 one 1 3, among the three links (link bundle), the more free bandwidth 300 Mb ps One of the link is selected. This makes it possible to guarantee the bandwidth for each user, and it is possible to realize the order guarantee of packets of the user.

Incidentally, when a link having a free bandwidth over guaranteed bandwidth does not exist, since the guaranteed bandwidth of the user can not be secured, NMS 10 changes the route of the user, for other routes, in the flowchart of FIG. 4 process to run.

The If the link having a free bandwidth over guaranteed bandwidth users (additional user) is present, NM S 10 determines whether such link is a plurality of presence (S 12), a plurality of presence in the case of (Y in S 12), (1) empty band is most often linked, (2) free band the least link, (3) the load (usage) of the lowest link, (4) a load (use rate) is the highest link, based on any selection criteria to select the link, assign users to link to the selected (S 1 3). In any or selection criteria (1) to (4) it is predetermined by an administrator or the like. If available bandwidth link is one which the user warranty band or Zantsu (New in S 12), the selected link, namely the one link is finally selected and assigned to the user .

In the selection criteria (1), the most common link free band is selected, additional user band is allocated. Thus, as possible out to go to balance the load between multiple links. In selection criterion (2), against which additional user bandwidth Ri assigned to the fewest links free band. Thus, a large link free band is left, after, if another user has subscribed to use a more larger bandwidth, the user of said another, can be assigned a link that has been left.

According to the selection criteria (3), it can be like the selection criterion (1), to equalize the load on each link. Here, load is the bandwidth used for the link, refers to a value obtained by dividing the total bandwidth (= the used bandwidth + free bandwidth) of the link. If all the bands of each link are equal, using any of the selection criteria (3) and (1), becomes to the that same link is selected, in some cases the entire bandwidth of each link is different in this case, sometimes both selection result is different. Selection criteria (4), if the total bandwidth of 1 each link is the same as the selection criterion (2) are equal, but the selected result of the selection criteria (4) and selection criteria (2) coincide, the If the entire bandwidth of the link is different, sometimes both selection result is different.

For example, Figure 5 shows the housing examples of additional user bandwidth when the link 1 Gb ps is provided present 4, 6, this one links 1 Gb ps, links 100Mb ps 3 It shows an accommodated examples of additional users band case. 5, when the add Caro user bandwidth with 30 OMB ps, when using the above selection criteria (1) or (3), in any of the selection criteria, the user bandwidth is allocated to the link 2, the upper Symbol selection criteria (2) or (4) is used, in any way, the user - band is assigned to the link 3. 6, add the user band and 5 OMB ps, when using the above selection criteria (1), whereas the user bandwidth is assigned to the asset link 1, when using the above selection criteria (3), the user the band is allocated to the link 3. Also, when using the above selection criteria (2), the user bandwidth is allocated to the link 2, also when using the above selection criteria (4), the user bandwidth is allocated to the link 2.

Based on the selected link by the step S 14 in FIG. 4, the sorting table - is created. Accordingly, while ensuring a bandwidth for each user, it is possible to use the bandwidth of the link bundle enabled. In the carrier network to use MPLS (Multi-protocol Label Switching), it may be assigned a link for each label path in place of the VL AN tag.

The setting of either allocating the packet Bok each user to which link (tape pull generator (not shown) provided, for example, the sorting table holding unit 3 1 or node) node itself may be performed. In this case, the bandwidth of the link bundle is determined by the NM S or EM S, or determined through signaling between nodes, the node performs only determination Ri divided vibration.

Then, to assign additional user bandwidth to the link bundle, a method is described to reassign again also user bands already assigned to the link bundle. Figure 7 is a flow chart showing the processing flow of NM S 1 0 by this method. If the newly allocated guaranteed bandwidth for additional users to link bundle, NM S 1 0, first, Kuria setting of the link bundle Te to base (S 2 1). Thus, bandwidth allocation of the user that has already been set to the link stack is cleared. Subsequently, NM S 1 0, from the unconfigured user (already includes both assigned have users and Tsuika卩 user), guaranteed bandwidth selects the maximum of the user (S 2 2), select the link based on the additional user bandwidth allocation flow of FIG. 4 described above, setting the band (S 2 3). Such processing is performed for all users to use the link bundle (S 2 4). Steps S 1 3 of the selected link by the selection criteria of Figure 4 is in some cases 2 or more, any link is selected based on criteria such as a link of the minimum number of links Ya maximum number.

Thus, the link from a large user of used bandwidth is allocated sequentially go are determined. Since already performed even resetting the bandwidth of the user that is set, before resetting, even if the bandwidth of the additional user process is not performed it can be assigned to any of the links of the link bundle assignment after resetting it may become possible. Accordingly, it is possible to make effective use of the link bandwidth.

Figure 8 shows the bandwidth allocation example according to the flow chart in FIG. As shown in FIG. 8 the upper part, one of the two links 1 and link bundle of two G bps, the link 1, the band 5 0 0 M bps user 1 is already assigned, the link 2, It shall band 3 0 0 M bps user 2 has already been assigned. In this context, we consider the case of allocating additional bandwidth 8 0 0 M bps for a new user 3. In this case, the bandwidth of the user 3 can not be assigned to any of the links 1 and 2. - How, when the reconfiguration according to the flowchart of FIG. 7, as shown in the lower part of FIG. 8, the band 8 0 0 M bps user 3 is assigned to the link 1, the link 2, band 5 0 0 users 1 band 3 0 0 M bs of M bs and user 2 are assigned to, it is possible to allocate a band for all users in the two links.

Incidentally, also in this method, the there is no free bandwidth that can be allocated, for a user who can not perform link assignment, Noreto is changed, so that the link allocation is made in the modified route.

Next, a description will be given of link allocation method in the case of a failure in one link of the link bundles occurred (allocation method). Figure 9 is a plot click diagram showing a configuration of a transmission side Suitsuchi and receiving Suitsuchi for explaining a method of linking the distribution when a link failure occurs.

To guarantee the bandwidth even in the event of a failure, there is a method to be prepared a backup link, which usually do not use. In Figure 9, among the three links, a link 1 and 2 are working link, a backup link link 3 is used in the event of a failure. For example, the working link 2 fails, the receiving side switches (downstream side switch) failure detection unit 4 1 provided in 4 detects a fault. Failure detection unit 4 1 notifies the failure to the transmitting side switch (upstream neighbor switch) 3. The fault notification to the recipient switch 4 can also be performed via an uplink (not shown) toward the transmitting side Suitsuchi 3 can also be performed via the NM S 1 0 and the control line. The failure notification, the link identification information indicating a link failure has occurred (e.g., link number, etc.) including Murrell.

The sender Suitsuchi 3, Bakkuappu conversion table holding unit 3 4 is provided. The back up-conversion Te one pull holding part 3 4, Bakkuatsu flop conversion table 3 4 a to be used when a failure is maintained. As shown in FIG. 9, this backup conversion table 3 4 a, (when there is no failure) usually has links used is set (set by NM S 1 0), failure in the event of a failure It is modified so as to avoid the link.

Bakkuappu conversion table 3 4 a is a table showing the link that is actually used for disaster, that shows the correspondence between the assigned link and the actual use links. 9, a packet which has been allocated before the failure in the link 1, After the failure is also allocated to the same link 1, the packet that was allocated before the failure in the link 2, after a failure in the link 3 that are distributed are shown. Na us, if failure link is a link 1, the actual use link assignment link 1 is set to the link 3; Ru.

Bakkuappu conversion table holding unit 3 4 receives the fault detection unit 4 1 or we sent fault notification recipient switch (. Including failed link identification information), as well as change the Bakkuatsu flop conversion table, its backup conversion based on the table, and instructs the output link sorting section 3 3 changes of the distribution of the output links Baketsuto. Accordingly, the output link sorting section 3 3 distributes the packets to distribute the failure link 2 to the backup link 3. In this way, it is possible to cope with a failure.

Incidentally, without using the backup conversion table may be changed distribution table directly. In this case, the table change is required only failed link use user minutes. Next, a description will be given link change method when a failure occurs when the link backup is not particularly provided. Figure 1 0 is a Proc diagram of a transmitting side Suitsuchi and receiving Suitsuchi for explaining the link allocation method when link failure occurs. Figure 1 1 is a Furochiya one bets illustrating the flow of link assignment process when a link failure occurs due NM S 1 0.

Among the three working links 1-3 between the transmitting side Suitsuchi 3 and the receiver Suitsuchi 4, it is assumed that the link 2 fails. In this case, the failure detection unit 4 1 of the receiving side switch 4 transmits the failure notification including the link identification information indicating the failure link to the transmitter sweep rate Tutsi 3 and NM S 1 0. In the case where failure notification is given to the sending switch 3 via NM S 1 0, it said notification is sent only to the NM S 1 0.

NM S 1 0 by receiving the failure notification, changes the swing classification table of the transmitting side Suitsuchi 3. Here, reviewing allocation of only users that have been assigned to the failed link (the distribution), assignment of users already allocated to the link that is no failure shall stay the.

NMS 10, first of all, to clear the setting of a failed link (S 3 1). In the example of FIG. 10, the setting of the link 2 are cleared. Subsequently, NMS 10 is guaranteed bandwidth among the users (i.e. unconfigured user) related to the cleared set to select a maximum of the user (S 32). Subsequently, NMS 10, of the link failure has not occurred (Figure 10, link 1 and 2), whether it is possible to assign the band of the selected user, i.e., among the links that failure has not occurred , it is determined whether or not the link having a free bandwidth of more guaranteed bandwidth of the selected user is present (S 33).

Where such a link there are a plurality (Y in S 33), NMS 10 selects a link by one of the selection criteria in step S 14 of FIG. 4 mentioned above (1) to (4), selected It allocates a bandwidth users in the link (S 34). If such link is present one 1 (Y in S 33), NMS 10 allocates a bandwidth of user to the one link. In these cases, as possible out to achieve bandwidth guarantee of the user.

- How, if such a link does not exist (N in S 33), NMS 10 selects a link by at excessive band allocation processing, and sets (S 35). Specifically, the load of each link is equalized (a), or a method of selecting a link to be close to equal, becomes equal bandwidth that (b) over, or distributes to approach uniform there is a method. Link that is selected by both methods, the same in the case the total bandwidth of each link that make up a link bundle are equal. On the other hand, if the bandwidth of each link difference exists is, (a) are loaded uniformly, or a method of evenly close is preferred because characteristics becomes uniform. In this case, all of the Interview monodentate assigned to the link (both users that were assigned before newly allocated users and failure after a failure), especially when there is no priority , the bandwidth guarantee of all users necessarily achieved is not, the base strike F auto-type services.

Such allocation change process, the sorting table 31 a W 200 in FIG. 10, for example

It is changed to the distribution Tepunore 3 1 b. Table 3 1 b after the change is set to the distribution Tepunore holder 3 1 of the transmission side Suitsuchi 3 by NMS 1 0, output link sorting section 3 3 Shin side Suitsuchi transmission, the output links according to Table 3 1 b select, and outputs the Baketsuto. Thus, when an error occurs, it performs order guarantee packet, also, that Do allow sorting of packets effectively use the bandwidth of the link.

Furthermore, it as table 3 1 b ', is prepared in advance a table before and after the change (1 link failure only), also to set obtained in advance the assignment destination failure. As a result, as possible out to make changes to the link to the high-speed only at the time of 1 link failure.

Figure 1 2 shows the bandwidth allocation example according to the flowchart of FIG 1. Shows the assignment of three links 1-3 is before failure of Hidari俱 IJ, the right three links 1-3 shows the assignment after a failure occurs in the link 2. In this example, when the the failure occurrence link 2, as much as possible using the load is equalized, i.e. the influence of the failure Interview - sorting is performed such that the equivalent per THE. First, the link 2, the bandwidth of the largest 4 0 OM bps is user bandwidth, most free band of high (most used load is low) is allocated to the link 3. Then the band is greater 3 0 band power most available bandwidth OM bps often (most used load is low) is assigned to the link 1. By this, since the free bandwidth in both links 1 and 3 has decreased without, bands of the last ZanTsuta 2 0 OM bps is allocated the most bandwidth less beyond (most used low load) to the link 3.

Next, when the backup link when a fault is not provided, when a failure onset production, including user fault was already assigned to a link not occurred, how to reconfigure the allocation to all users explain.

If the priority among users is not set, the Furochi Ja Bok shown in FIG. 7 described above, it is possible to allocate the bandwidth for each user. In this case, the user can not secure a bandwidth, allocation by selecting the link in the process of step S 3 5 in Figure 1 1 as described above, or to provide the best F auto service, Or, change the route Te may be allocated bandwidth in link on the modified route.

If the priority among users is set, the priority of the high-les, user Nirre Te, previously allocated bandwidth, the lower priority user after, may be allocated bandwidth. Figure 1 3 is a flow chart showing the flow of a process of allocating a bandwidth according to priority. Here, as the priority, it is assumed that either Re Izu "high" two priority "low" is set to the user.

NM S 1 0 clears the set of all links, including the failure live link (S 4 1). Subsequently, NM S 1 0 is the priority "high", and, in the unset user, guarantee band selects the maximum of the user (S 4 2), the process of FIG. 4 described above (added select the link by the user bandwidth allocation flow), set (S 4 3). NM S 1 0 performs allocation for all users of the priority "high" (S 4 2~S 4 4), the assignment is completed, subsequently, in the same manner for the user of the priority "low" band carry out the assignment of (S 4 5~S 4 7).

Such allocation, bandwidth for all users of the priority "high" and "low", when secured in the link, which is not failed, the offer bandwidth-guaranteed service to all users can do.

Although the priority may bandwidth for all users ensure "high", if the band for all users of the priority "low" can not be secured, the user of the priority "low", the Sutetsu flop S 4 6 instead of processing, it is possible to assign the band over time allocation flow of step 3 5 in Figure 1 1. In this case, the service to the user of the priority "high" becomes a guaranteed bandwidth service, service to the user of the priority "low" is a base strike F auto-type services. Further, the user of the priority "low", may be carried out band allocation by changing the route.

If a band of both users in the priority "high" and "low" can not be secured, it is possible to assign the bandwidth over time assignment flow, in this case, Sutefoto type base to all users it can be.

Next, a description will be given change timing for changing the allocation of the link. Figure 1 4 is a block diagram showing a configuration of Suitsuchi with a timer which performs assignment change control. The sender switch is sorting table 31, in addition to the user information extracting section 32, and the output link distribution section 33, a timer 35, a selector 36, and is provided a link 1 respective transmission buffers 37 a to 37 c of 3 It is.

If you change the link allocation, before and after the change, packet reordering is likely that occur. To prevent this, the timer 35, the predetermined time questions corresponding to each link is calculated / set by NMS 10, the timing of the link switching is determined. A predetermined time of each link is set in the timer 35 is calculated by the following equations.

Setting time = (maximum length of the packet) ÷ (the rate of change before the link) + | (delay time of change before the link) one (delay time of change after the link) | + α ... Fei)

The ratio (> 0) is to consider the error of the link speed and delay time is a value for slightly larger than the theoretical value set time.

For example, to change the allocation of Baketsuto from link 1 to link 2, Lma maximum length bucket preparative (number of bits) X, B 1 the link speed of the link 1 (bps), 1 Te delay time of the link 1, link and 2 2 a delay time of the chill, the timer 35, + set of links 1 time T l = Lma x ÷ B l | T l - T 2 | + α is set. Incidentally, Lma x, B 1, Te 1 and tau 2 values ​​can be determined in advance. The user information extraction unit 32 receives the packet and provides the tables holding unit 31 distributes V LAN tag included in the received packet.

Sorting table holding section 31 holds a sorting table 31 c of the pre-change link and the post-change link is defined for each user (VL AN tag). Distribution table holding section 31, as well as providing both a pre-change link number and the post-change link number corresponding to the VL AN tag received from the user information extraction unit 32 to the selector 36, giving a pre-change link number in the timer 35. For example, in the case of VLAN tag = 1 is given link number 1 and 2 to the selector 36, the link number 1 is given to the timer 35. Ru.

Selector 36, the state in which the switching signal from the timer 35 has not been input (initial state), and select the pre-change link number, to the output link distribution section 33. Thus, in the initial state, the packet is transmitted to the link before the change. The timer 35, the link change instruction is input from the NM S 1 0. Timer 35 after the change instruction received allocation before the change from the table holding unit 3 first link number receiving result immediately, it starts counting the set time corresponding to the pre-change link number. And, if the timer 35 has until this time expires, if it does not receive from the table holding unit 3 1 divided Ri shake the same change before the link number (i.e. the next packet to be distributed to the same link is not received ), the output switching signal of the pre-change link number at the expiration of the time to the selector 3 6. On the other hand, before the expiration of this time, when receiving the same before-link number (i.e. when it is received next Baketsuto to be allocated to the same link), the timer 35 resets the counted, 0 new repeats the counting from. For example, the link number 1 is given to the timer 35, the timer 35 starts counting of the preset time T 1, until the time T 1 is expires, if it does not receive a link number 1 , while outputting the switched image signal of link 1 at the expiration of time T 1 to the selector 3 6, upon receiving the link number 1 resets the counted newly repeats counting from zero.

The selector 3 6 receives the switching signal, thereafter, for a link that corresponds to the switching signal, and selects and outputs the post-change link number to the output link sorting section 3 3. Thus, the packet is transmitted to the link of the post-change link number. Thus, the timer 35, the time of which the delay time difference between the link to the time required for transmission of the maximum packet length L ma X is timed during which the case of not receiving packets link switching is performed. This prevents the order in reversal of the same link packet, it is possible to guarantee the order.

Incidentally, the timer 35, the after outputting a switching signal for a link, even if it receives the same pre-change link number, does not perform the output time of the timer and switching signals. Thus, re-switching of the link is prevented.

Switching by the timer but having conducted for each link, then set the user (i.e. VL AN tag) time of the timer for each, a description will be given of a method of switching control of the link to each user.

Figure 1 5 is a view to a block diagram the structure of Suitsuchi for performing switching control of the link to each user. The sender switch is sorting table 31, in addition to the user information extracting section 32, and the output link distribution section 33, a timer 35 a and the link 1-3 transmission buffer 37 of their respective a ~ 37 c are provided .

The timer 35, VL AN tag predetermined time corresponding to each of the (Interview one THE) is set by the NMS 10, the timing of the link switching is determined. Predetermined time of each V LAN tag that is set in the timer 35 is the same as the above formula (1), that provided for each VLAN tag is different. '

For example, to change the VLAN tag = 1 Baketsuto from link 1 to link 2, the maximum length of the packet Bok (the number of bits) Lma x, link speed of the link 1 (bs) B l, Te delay time of the link 1 1, if the delay time tau 2 link 2, the timer 3 5, VLAN tag = 1 set time T l = Lma x ÷ B 1+ | Te 1 one Te 2 | + Higa is set.

The user information extraction unit 32 receives the packet and provides the table holding section 31 and the timer 35 distributes the VLAN tag included in the received packet.

Sorting table holding section 31 holds a sorting table 31 c of the pre-change link and the post-change link is defined for each user (each VLAN tag). Sorting Te one table holding unit 31, the state does not receive the switching signal from the timer 35 (initial state), the output link allocation unit changes the front link number corresponding to the VLAN tag received from the user information extracting section 32 give to 33. For example, ¥ in the case of tag = 1, the pre-change link number 1 is given to the output link distribution section 33. This ensures that output link distribution unit 33 outputs via a bus Ffa 37 a link 1 before changing the received packet.

The timer 35 a, the link switching instruction is input from the NMS 10. Timer 35 a after the reception of the switching instruction, and starts time count set time corresponding to all VLAN tags. Then, the timer 35 a, at the time the packet reception, the timer corresponding to the VLAN tag received from the user information extracting section 32, when checks whether the expiration time has expired, the appropriate VLAN tag table to switch. On the other hand, if no time has expired, the timer 35 a resets the counted newly repeats counting from zero. For example, the timer 35 a, when it receives the VLAN tag = 1, if appropriate timer value has expired, while outputting the table sorting the cut replacement signal VL AN tag = 1, the corresponding timer value if Kere but such has expired, to reset the timing, newly repeat counting from 0.

In this way, since the switching is dependent on the received packet, there is a case where the switch completion of late by the traffic. Therefore, in order to verify Tima value, that will switch the expired Te one Bull timer value, it is possible to speed up the switching completion to parallel non-user switching (VLAN Tag).

Sorting table holding unit 3 1 receives the switching signal, the switching signal before changing the link VL AN tag corresponding to change the link to the post-change link, than after, VL AN tag from the user information extracting section 3 2 Upon receiving the pair to the VLAN tag - output change link number to respond to the output link sorting section 3 3.

By this way, the timer 3 5 a, the time of which the delay time difference between link between time required for transmission of the maximum packet length L ma X is timed during which the case of not receiving packets link switching is performed. This prevents the packet reordering of the same user (the same VLAN tag), it is possible to guarantee the order.

Incidentally, the timer 3 5 a, the after outputting the switching signals, also receive the same VL AN tag, the output time of the timer and switching signal is not output. Thus, re-switching of the link is prevented.

Next, the control packet indicating the change of the link to the receiving switch (hereinafter referred to as "change notification packet".) Switching control by will be described.

Figure 1 6 is a Proc diagram showing a configuration of a line U Suitsuchi the switching control by the change notification packet. Figure 1 7 is a Furochiya one preparative showing a read control portion 4 2 of the processing flow one recipient switch.

The transmitting side switch, the control Baketsuto 揷入 unit 3 8 is provided. NM S 1 0 provides a link switching instruction to the control bucket Bok insertion portion 3 8 and sorting table 3 1.

Sorting table holding unit 3 1 1 5 holds a table similar to the distribution table 3 1 c shown in, linked by switching instruction, it outputs a link number is changed to the post-change link from changing before Links sorting section 3 give to 3. Thus, packet (data packet, the user packets), Ru sorting et † 1 link after switching.

- How the control packet inserting unit 3 8, Ri by the link switching instruction from NM S 1 0, writes the buffer 3 7 a~3 7 changes to each c notification Baketsuto (control Baketsuto). Change notification packet includes a written data packet (Interview one Zabaketsuto) before switching is written to be inserted between the written data buckets preparative after switching (User bucket g). That is, Te switching instruction received during smell, already after the last data packet sorting already or in distributing, change notification packet is 揷入. Written change notification packet, the data packet the same way, is transmitted to the receiving side Suitsuchi via links 1-3, respectively.

The recipient Suitsuchi, link 1 receiving buffer of 3 packets received respectively in temporarily via serial 'It is for 4 3 A~4 3 c, the read control section 4 2, Contact and buffer 4 3 a~4 3 multiplexer 4 4 for transmitting c are multiplexed into a single output Karinku is provided.

Referring to FIG. 1 7, the read control section 4 2, when the packet is received in Bruno Ffa 4 3 a to 4 3 c, the received packet to determine whether the change notification packet (control packet) (S 5 1). For control Baketsuto (S 5 1 in Y), the read control unit 4 2 removes the control Baketsuto from the buffer (S 5 8), set to ON switching flag provided in the read control unit 4 within 2, co When indicating that the link is being switched (S 5 9), in the control Baketsuto reception flag provided for each link to the read control section 4 2, a control packet reception flag of the link that received the change notification packet the set to oN, indicates that the change notification packet has been received in the link (S 6 0). Then, the read control unit 4 2 will standby state for receiving the next packet.

On the other hand, if the received Baketsuto is not a change notification Baketsuto, that is, when the data bucket bets (N in S 5 1), the read control section 4 2, based on the switching flag, it is determined whether currently or in the switching of the link (S 5 2).

Switching flag is not ON (i.e. not in switching link) if (N in S 5 2), the read control section 4 2, received data bucket preparative buffer to the read, the multiplexer 4 4 via to send Te (S 5 5). On the other hand, when the switching flag is 〇_N (that is, when in the switching of the link) (N in S 5 2), the read control section 4 2, a control packet reception flag of all links (ie all links 1-3) is it is determined whether the ON (S 5 3). In other words, all links already whether a change notification bucket 1, is received is determined.

If the control Baketsuto reception flags of all links is not ON (S 5 3 in N), reading out the control unit 4 2, the control packet receiving Bragg link that received the data packet to determine whether the 〇 N (S 5 6). Control Baketsuto reception flag is ON - If (Y in S 5 6), already because change notification packet to the link is received, the read control section 4 2, received data bucket bets is read from the buffer temporarily stop the (S 5 7). On the other hand, if the control packet receiving flag is OFF (N at S 5 6), in its link, since the change notification Baketsuto not yet been received, the control unit 4 2 out read reads the received data packets from the buffer , and transmits via the multiplexer 4 4 (S 5 5).

In step S 5 3, when the control Baketsuto reception flags of all links is ON (Y at S 5 4), all links are switched link is completed for immediately transmitting a received data buckets DOO It does not cause a problem of order reversal be. Thus, the read control unit 4 2 are both returned to the OFF control packet receiving flag of switching flag Oyobi all links (S 5 4), to read / transmission processing of the received data packets (S 5 5). Thus, temporarily transmitted at step S 5 7 to De was stopped - is also transmitted Tapaketto. Thereafter, the received data packet, as usual, be transmitted is read from the buffer.

Thus, if for a link change notification packet is received, until the change notification Baketsuto is received, reading and transmission of data buckets bets of all links change notification Baketsuto after being temporarily stopped even for the other links . After the change notification Baketsuto received in all links, data bucket WINCH read / transmission is resumed. The change notification packet, the transmitting-side switch, since it is a control packet indicating the boundary between before and after switching, at reception side switch after reception of the change notification bucket Bok, by temporarily stopping the transmission, it is possible to guarantee the order of the data packets in the allocation change before and after the entire link. Instead of the change notification packet, and transmitted to the receiving side Suitsuchi written at the transmission side switches the flag or data indicating a change notification in the header of the data packet, the read control section 4 2 of the receiving side Suitsuchi is included in the header flag or data, it is also possible to perform the same processing.

In the above description, the control Baketsuto has been described to be applied to each link, it is also possible to apply the control packet Bok for each user.

Next, the transmitting-side switch, a predetermined time before and after the link allocation change, by stopping the transmission of Baketsuto, that describes how to achieve order guarantee.

Figure 1 8 is a Proc diagram showing a configuration of Suitsuchi realizing the order guarantee by stopping the transmission of the packet on the transmitting side Suitsuchi. The sender Suitsuchi reads the control unit 3 9 is provided.

The distribution table storage section 3 1, the switching instruction is input from the NM S 1 0. Sorting table holding unit 3 1, when NM S 1 0 Power et switching instruction is input, Roh Ffa 3 7 a to 3 7 reads the pause signal to temporarily stop the reading / transmission of packets from the c controller give to 3 9.

Read control unit 3 9 receives a pause signal from the distribution table holding section 3 1 Then, Baketsuto buffer 3 7 a~3 7 c of Baketsuto or currently sorting already sorting is completed by the output link sorting section 3 3 after being sent from a certain time stop reading Z transmission of packets from the buffer 3 7 a~ 3 7 c. Time to stop is the time the transmission of Baketsuto sorting already or in distributing is completed, preferably, the maximum packet transmission completion time based on the length (time required Ri by the above formula (1)).

Sorting table holding unit 3 1, after the read has been stopped by the pause signal, switching to the sorting table 3 1 c Modified link before the change link (see Fig. 1 5).

Since the predetermined time between the data bucket Bok sent after data packet Bok and switching transmission before switching is opened, as in the case of pause reading received Baketsuto by the receiving side switches , the reordering of Baketsuto is avoided.

Downtime by this method is required longer than during the time of transmission of the change notification packet (control packet), effect because the time difference is the difference of the order of at most 1 Baketsuto is small. Further, in this method, it is a special packet such change notification packet unnecessary, since special processing is not required on the receiving side, the merit is large. Here, placing the common buffer in front of the force Roh Ffa 3 7 a~3 7 c which stops the reading of the buffer 3 7 a~3 7 c of each link each reading buffer of the common the may be stopped.

Then each link pair - a band change of a user response, the buffer of the link by performing when it is empty, the method for implementing the order guarantee. Figure 1 9 is a block diagram showing the configuration of a switch to change the link by this method. The transmit side Suitsuchi, the buffer management unit 4 0 that manages the buffer 3 7 a~3 7 c of the link 1-3 is provided.

The user information extracting section 3 2 gives the VL AN tag of the received packet sorting table 3 1. The distribution table storage section 3 1, similar sorting Te one table 3 1 c as described previously is held. Sorting table holding unit 3 1, together provide a VL AN change before the link number and the post-change link number corresponding to the tag from the user information extracting section 3 2 to the selector 3 6, the pre-change link number in the buffer manager 4 0 give. The selector 3 6, in a state where the switching signal from the buffer management unit 4 0 is not input (initial state) are set so as to select the pre-change link number on the output link sorting section 3 3. Accordingly, the output link sorting section 3 3 through the buffer corresponding to the link before the change, and transmits the received packet to the link before the change. -

The Roh Ffa manager 4 0, the switching instruction is input from the NM S 1 0. After receiving the switched example indicated, the buffer management unit 4 0 receives from the table holding unit 3 1 allocation changes before the link number, the buffer corresponding to change before the link number received the checks whether empty. For example, if the pre-change link number = 1, bar Ffa manager 4 0 pair link 1 - to check the status of response buffers 3 7 a. If the buffer is empty, the buffer management unit 4 0, may grant the switching signal of the selector 3 6. Thus, the selector 3-6 selects the post-change link, on the output link swing classification unit 3 3. Thus, the reception buffer is transmitted to the post-change link. On the other hand, if the buffer is not empty, the buffer management unit 4 0 provides no example signals switched to the selector 3 6.

Buffer is empty, i.e., after the data that constitutes the packet previously transmitted is completed transmitted Te to base, because switching the output link, between a packet Bok previously transmitted, and transmits after the link switching packets the problem of order reversal does not occur. In this way, since the timer control is not required, there is an advantage that can be realized circuits easily.

In the embodiment described so far, Interview one The had subscribed to a wide area LAN service one bis will eliminate the service contract, or by the service deadline expires, of the user in NM S 1 0 and the switch If the data is no longer needed, remove the NM S 1 0 data and data 該Yu one the from the distribution table for each Suitsuchi, the available bandwidth links NM S 1 0 and each Suitsuchi manages it can be addressed by increasing.

In addition, the link, also a two-way link, may be a one-way link. Further, the description has been given of the case the node device of the carrier network 1 is switch node device may be a router. Industrial Applicability

The present invention is a node device constituting a communication network can be utilized in the node device having a plurality of links (eg switches, routers, etc.). Further, the present invention can be a child available to the network management system for managing a communications network.

Claims

The scope of the claims
1. Provided in the communication network are connected via a node device and a plurality of links adjacent to the downstream side, a node device for transmitting Baketsuto received the node device adjacent to the downstream side,
Included in the bucket Bok said received, the user information extraction unit for extracting Interview one The identification information indicating the transmission source user of the Baketsuto,
And the user identification information of the transmission source user of the packet, among the plurality of links maintains the assignment data that associates the identification information of one link assigned to the user of the user identification information, the user information extraction a data holding section for obtaining identification information of the link corresponding to the user identification information extracted by the section,
The link corresponding to the identification information of the link that has been determined by the data holding unit, and a packet transmission unit that transmits Baketsuto said received,
Node device comprising a.
2. In claim 1, wherein,
One link assigned to the user of the user identification information is the link to guarantee the requested bandwidth of the user, the node device.
In 3. Claim 1, wherein,
The assignment data is generated by a network management apparatus for managing said communication network, it is kept being sent to 該Deichita holder, Bruno once device.
4. In claim 1, wherein,
The assignment data, the generated by the data holding unit, or is generated by the data generating unit, the node device.
In 5. Claim 1, wherein,
The assignment data, when the requested bandwidth of the new user is assigned to Izu Re of the plurality of links, of the links that have a free bandwidth of more than the required bandwidth of the new user, the largest available bandwidth link or most the required bandwidth of a new user to a small link is generated by assigning node device. . In the first aspect,
The assignment data, when the requested bandwidth of the new user is assigned to Izu Re of the plurality of links, of the links that have a free bandwidth of more than the required bandwidth of the new user, the utilization lowest link or requested bandwidth Do users were 該新 the highest link is generated by the assigned node device. . In the first aspect,
The assignment data, when the requested bandwidth of the new user is assigned to Izu Re of the plurality of links, the required bandwidth for all users, including the Do user was users and 該新 already assigned, the plurality is generated by the newly assigned directly to the link, at paragraph 7 range of no. claims,
The assignment data, the out of requested bandwidth of all users is generated by reassigned to order from a user of the large required bandwidth to the user of a small required bandwidth, the node device. . In Claim 8,
The assignment data of the link having the required bandwidth of free bandwidth of the selected user in order from the user of the large required bandwidth to the user of a small required bandwidth, the largest link or smallest link free band is generated by the required bandwidth of the selected user is assigned, the node device. 0. In Claim 8,
The assignment data of the link having the required bandwidth of free bandwidth of the selected user in order from the user of the large required bandwidth to the user of a small required bandwidth, the lowest link or highest link utilization is generated by the required bandwidth of the selected user is assigned, the node device. In 1 1. Claim 1, wherein,
Wherein the data holding portion includes user identification information, the first link identification information assigned to a user of a plurality of said user identification information in a normal state where no failure occurs in the link, and, at least of the plurality of links holding the assignment data that associates the identification information of the second link assigned to a user of the user identification information at the time of failure in one fails, wherein the normal, which is extracted by the user information extracting section the determined first link identification information corresponding to the user identification information, when the fault is determined the identity of the second link corresponding to said user identification information extracted by the user information extracting section,
The Baketsuto transmission unit, the link may first link also corresponding to the identification information of the second link determined by the data holding unit, that sends the received packet,
Roh once devices.
In 1 2. Claim 1, wherein,
The data holding unit, in the event of a failure of at least one failure of said plurality of links, all of the user identification information of the assignment data, so as to correspond to a link failure has not occurred, the allocation data rewriting all or part of the identification information of the link, at the time of the failure, based on the allocation data after rewriting, we obtain the identification information of the link that corresponds to the user identification information extracted by the user information extracting section,
No
In 3. The first 1 or the first two terms claims,
Wherein at least one of the plurality of links are Bakkuatsu Uplink used only in case of a failure, the rest is a working link that is used during normal, the first link is one of the working links the second link is one of one or working link back Atsu pre link, the node device. In 1 4. The first 1 wherein the claims or the first two terms,
Working all of the plurality of links, a working link that is used during normal, the first link is one of the working links, the second link, the faulty when failure has not occurred it is one of the links, Roh once devices. In 1 5. The first four terms claims,
The second link of the allocation data, in case of a failure, of the working link failure has not occurred, one link having an available bandwidth than the requested bandwidth, or, if the link with available bandwidth than requested bandwidth is not present load failure is not a have working links generated in is one of the links selected as close evenly, Bruno once device.
In 6. The first 5 wherein the claims,
The second link of the allocation data, in case of a failure, of the working link failure has not occurred, one link having an available bandwidth than the requested bandwidth, or, if the link with available bandwidth than requested bandwidth is not present the Ru selected link der as bands failure over the though such have working link occurs approaches evenly node device.
In 1 7. The first 5 wherein the claims,
The second link of the assignment data assigns when a fault, with respect to the working link failure has not occurred, reassign requested bandwidth of high priority users first, after a request band Castle lower priority users It is determined by cure, node
In 8. Claim 1, wherein,
Wherein the data holding portion includes the user identification information of the transmission source user of the packet, among the multiple links, the identification information of the first link identification information and the second link assigned to the user of the user identification information holding the allocation de one data made to correspond to obtain the identification information of the first Oyopi second link corresponding to the user identification information, the packet transmission unit is a network management device or the downstream managing said communication network for packets received before receiving the link switching command from the node device adjacent to the side, and transmitted to the first link that has been determined by the data holding unit, when receiving the switching command, bEFORE switching command received There Baketsuto to be distributed to the first link is, it is determined whether the received for a predetermined time, the predetermined time period If not during the reception, the received packet is thereafter, transmitted to the second link determined by the data holding unit,
Roh once devices.
9. In the first 8 wherein the claims,
The packet transmission unit after receiving the switching command, if Baketsuto between the user for a predetermined time in the first link is not received, for Baketsuto received thereafter, determined in the data hold unit performed for each user a process of transmitting to the second link, which is,
Roh once devices. 0 · In according paragraph 1 range,
Wherein the data holding portion includes the user identification information of the transmission source user of the packet, among the multiple links, the identification information of the first link identification information and the second link assigned to the user of the user identification information holding the assignment data that associates obtains the identification information of the first and second link corresponding to the user identification information, the Baketsuto transmission section is adjacent to the network management device or the downstream managing said communication network for Baketsuto received before receiving the link switching command from Roh Once device and transmitted to the first link that has been determined by the data holding unit, for receiving the switching command, the link switch to the plurality of links transmits a control packet indicating, then, transmits the Baketsuto the second link is determined Me by the data holding unit That,
Node device. In 1. Claim 1, wherein,
Wherein the data holding portion includes the user identification information of the transmission source user of the packet, among the multiple links, the identification information of the first link identification information and the second link assigned to the user of the user identification information holding the assignment data that associates obtains the identification information of the first and second link corresponding to the user identification information, the Baketsuto transmission section is adjacent to the network management device or the downstream managing said communication network for Baketsuto received before receiving the link switching command from the node device transmits a Baketsuto said received to the first link that has been determined by the data holding unit, when receiving the switching command, the plurality of links during a predetermined time for each stop sending Baketsuto, then by the data holding unit Starts to transmit the packets to the second link is because,
Roh once devices. In 2. Claim 1, wherein,
Wherein the data holding portion includes the user identification information of the transmission source user of the packet, among the multiple links, the identification information of the first link identification information and the second link assigned to the user of the user identification information holding the assignment data that associates obtains the identification information of the first and second link corresponding to the user identification information, the data transmission unit includes a transmission buffer for each of said plurality of links, the communication adjacent to the network management device or the lower stream side to manage nETWORK - for Baketsuto received before receiving the link switching command from de device, the receiving the first link that has been determined by the data holding unit and transmitting the packet, when receiving the switching command, each of the transmission to monitor whether empty, empty The packet Bok to be distributed to the first link that correspond to the transmission buffer became transmits the Baketsuto switched to the second link,
Node device. 3. Communication network provided, is connected via a Roh one de device and a plurality of links adjacent to the upstream side, a downstream side of the Roh one de apparatus is al the Baketsuto received from the node adjacent to the upstream shall apply in the Roh one de device for transmitting to,
And receive buffer multiple for temporarily storing Baketsuto received from each of the plurality of links,
Monitoring the plurality of receive buffers, said Roh one de device adjacent to the upstream side is transmitted to switch the link to send packets, at least one of the braking reception buffer control packet plurality of indicating the link switching when it is received in the One, the until all the control packet of the plurality of receive buffers is received, then stops reading of Baketsuto received in the 該制 receiving buffer control path Kek Bok is received, the When the control packet to all of the plurality of receive buffers is received, a read control unit that sends to resume reading the packet from the previous SL plurality of receive buffers packets,
Node device comprising a. 4. Runs a communications network in which a plurality of links provided between the adjacent node device in the network management device to manage, a user bandwidth allocation method of allocating the bandwidth of the user to the plurality links,
Among the plurality link, selecting a link having a free bandwidth of more than the required bandwidth of the user,
If one link is selected by said selecting step allocates the requested bandwidth of the user to the one link, when two or more links is selected, one of the two or more links, free the most significant link bandwidth, most small link free band, the highest link utilization, or select the lowest link utilization, the method comprising the steps of: allocating a required bandwidth of the user to the selected link. In 2 5. The second item 4 claims,
In the case where the band of the plurality link to one or more users have already been allocated, when allocating the requested bandwidth of the user to be newly added, the allocation of bandwidth of the user assigned to the already without changing , wherein the required bandwidth of the newly added Ru user assigns the step Oyobi said assigning step for the selection,
Method.
2 6. Runs a communications network in which a plurality of links between adjacent Roh one de device is provided with a network management system to manage, shall apply in user bandwidth allocation method of allocating the bandwidth of the user to the plurality links,
In the case where the bandwidth of one or more users to said plurality link has already been assigned, when allocating the requested bandwidth of the user to be newly added, and releasing the allocation of bandwidth for users assigned to 該既,
Of request - band of the user to be added the release to a user of the requested bandwidth and the newly, selecting a maximum requested bandwidth from the required bandwidth allocation is not determined user,
Among the plurality link, selecting a link that having a maximum required bandwidth over available bandwidth, wherein the selected
If one link is selected by said selecting step assigns the maximum requested bandwidth to the one link, wherein when two or more links have been selected by the selecting step, the two or more among links, largest kina link free band, the smallest link free band, the highest link utilization, or the lowest record of usage, selecting a link, the requested bandwidth outermost size to the selected link method comprising: a split shed step, a '.
PCT/JP2003/003572 2003-03-25 2003-03-25 Node device having links and method for allocating user band to links WO2004086697A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2003/003572 WO2004086697A1 (en) 2003-03-25 2003-03-25 Node device having links and method for allocating user band to links

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2004569920A JPWO2004086697A1 (en) 2003-03-25 2003-03-25 User band allocation method for the node devices and the plurality links having a plurality link
PCT/JP2003/003572 WO2004086697A1 (en) 2003-03-25 2003-03-25 Node device having links and method for allocating user band to links

Publications (1)

Publication Number Publication Date
WO2004086697A1 true true WO2004086697A1 (en) 2004-10-07

Family

ID=33045123

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2003/003572 WO2004086697A1 (en) 2003-03-25 2003-03-25 Node device having links and method for allocating user band to links

Country Status (2)

Country Link
JP (1) JPWO2004086697A1 (en)
WO (1) WO2004086697A1 (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006203735A (en) * 2005-01-24 2006-08-03 Hitachi Ltd Communication device
JP2006262291A (en) * 2005-03-18 2006-09-28 Fujitsu Ltd Communication system, communication card, and communication method
JP2006261903A (en) * 2005-03-16 2006-09-28 Fujitsu Ltd Communication system, communication card, and communication method
JP2006295934A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of redistributing conversation among links in link aggregation group, network element, and logical apparatus
JP2006295935A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of moving communication in link aggregation group, network element, and logical apparatus
JP2006295936A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of distributing frame in links in link aggregation group, network element, and logical apparatus
JP2007104513A (en) * 2005-10-07 2007-04-19 Alaxala Networks Corp Packet transfer apparatus provided with traffic alternative function
JP2008078906A (en) * 2006-09-20 2008-04-03 Fujitsu Ltd Communication device and communication method
JP2010171562A (en) * 2009-01-21 2010-08-05 Fujitsu Ltd Communication apparatus and communication control method
JP2011171977A (en) * 2010-02-18 2011-09-01 Nippon Telegr & Teleph Corp <Ntt> Device and method for designing line accommodation, and program
JP2011249979A (en) * 2010-05-25 2011-12-08 Nec Corp Communication system
JP2012010110A (en) * 2010-06-24 2012-01-12 Nippon Telegr & Teleph Corp <Ntt> Traffic accommodation method, line design device and communication system
US8233483B2 (en) 2007-08-28 2012-07-31 Nec Corporation Communication apparatus, communication system, absent packet detecting method and absent packet detecting program
JP2012205048A (en) * 2011-03-25 2012-10-22 Nec Corp Packet transmission device, packet transmission method, and computer program
US8462623B2 (en) 2005-08-29 2013-06-11 Fujitsu Limited Bandwidth control method and transmission equipment
WO2014064976A1 (en) * 2012-10-24 2014-05-01 日本電気株式会社 Network device, control method, and program
JP2015100024A (en) * 2013-11-19 2015-05-28 三菱電機株式会社 Communication device and communication path redundancy method
JP2015139111A (en) * 2014-01-22 2015-07-30 日立金属株式会社 Relay system and switch device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59144245A (en) * 1983-02-07 1984-08-18 Nippon Telegr & Teleph Corp <Ntt> Packet exchange subscriber circuit control system
JPH0993644A (en) * 1995-09-22 1997-04-04 Nippon Telegr & Teleph Corp <Ntt> Radio channel allocation method and radio base station equipment
JPH10322363A (en) * 1997-03-07 1998-12-04 Sun Microsyst Inc Interface parallel repeating method/device for increasing transfer band
JP2000013439A (en) * 1998-06-22 2000-01-14 Fujitsu Ltd Multilink type routing method and multilink type router
JP2002009866A (en) * 2000-06-16 2002-01-11 Hitachi Ltd Method for distributing frame and information processor having its function
JP2002505065A (en) * 1997-06-23 2002-02-12 テレフォンアクチボラゲット エルエム エリクソン Channel assignment for mixing multi-slot service
JP2002252634A (en) * 2001-02-26 2002-09-06 Nippon Telegr & Teleph Corp <Ntt> Route control method
JP2003124980A (en) * 2001-10-17 2003-04-25 Fujitsu Ltd Packet sorter

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59144245A (en) * 1983-02-07 1984-08-18 Nippon Telegr & Teleph Corp <Ntt> Packet exchange subscriber circuit control system
JPH0993644A (en) * 1995-09-22 1997-04-04 Nippon Telegr & Teleph Corp <Ntt> Radio channel allocation method and radio base station equipment
JPH10322363A (en) * 1997-03-07 1998-12-04 Sun Microsyst Inc Interface parallel repeating method/device for increasing transfer band
JP2002505065A (en) * 1997-06-23 2002-02-12 テレフォンアクチボラゲット エルエム エリクソン Channel assignment for mixing multi-slot service
JP2000013439A (en) * 1998-06-22 2000-01-14 Fujitsu Ltd Multilink type routing method and multilink type router
JP2002009866A (en) * 2000-06-16 2002-01-11 Hitachi Ltd Method for distributing frame and information processor having its function
JP2002252634A (en) * 2001-02-26 2002-09-06 Nippon Telegr & Teleph Corp <Ntt> Route control method
JP2003124980A (en) * 2001-10-17 2003-04-25 Fujitsu Ltd Packet sorter

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006203735A (en) * 2005-01-24 2006-08-03 Hitachi Ltd Communication device
JP2006261903A (en) * 2005-03-16 2006-09-28 Fujitsu Ltd Communication system, communication card, and communication method
JP4588501B2 (en) * 2005-03-16 2010-12-01 富士通株式会社 Communication cards and communication method
JP2006262291A (en) * 2005-03-18 2006-09-28 Fujitsu Ltd Communication system, communication card, and communication method
JP4588503B2 (en) * 2005-03-18 2010-12-01 富士通株式会社 COMMUNICATION SYSTEM AND COMMUNICATION METHOD
JP4510776B2 (en) * 2005-04-12 2010-07-28 富士通株式会社 The method for redistributing conversations in the link of the link aggregation group, network elements and logic unit
JP2006295935A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of moving communication in link aggregation group, network element, and logical apparatus
JP2006295936A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of distributing frame in links in link aggregation group, network element, and logical apparatus
JP2006295934A (en) * 2005-04-12 2006-10-26 Fujitsu Ltd Method of redistributing conversation among links in link aggregation group, network element, and logical apparatus
JP4510777B2 (en) * 2005-04-12 2010-07-28 富士通株式会社 The method for distributing frame in the link of the link aggregation group, network elements and logic unit
US8451713B2 (en) 2005-04-12 2013-05-28 Fujitsu Limited Special marker message for link aggregation marker protocol
US8462623B2 (en) 2005-08-29 2013-06-11 Fujitsu Limited Bandwidth control method and transmission equipment
JP4491397B2 (en) * 2005-10-07 2010-06-30 アラクサラネットワークス株式会社 Packet forwarding apparatus provided with a traffic bypass function.
JP2007104513A (en) * 2005-10-07 2007-04-19 Alaxala Networks Corp Packet transfer apparatus provided with traffic alternative function
JP2008078906A (en) * 2006-09-20 2008-04-03 Fujitsu Ltd Communication device and communication method
US8233483B2 (en) 2007-08-28 2012-07-31 Nec Corporation Communication apparatus, communication system, absent packet detecting method and absent packet detecting program
US9178665B2 (en) 2007-08-28 2015-11-03 Nec Corporation Communication apparatus, communication system, absent packet detecting method and absent packet detecting program
JP2010171562A (en) * 2009-01-21 2010-08-05 Fujitsu Ltd Communication apparatus and communication control method
JP2011171977A (en) * 2010-02-18 2011-09-01 Nippon Telegr & Teleph Corp <Ntt> Device and method for designing line accommodation, and program
JP2011249979A (en) * 2010-05-25 2011-12-08 Nec Corp Communication system
JP2012010110A (en) * 2010-06-24 2012-01-12 Nippon Telegr & Teleph Corp <Ntt> Traffic accommodation method, line design device and communication system
JP2012205048A (en) * 2011-03-25 2012-10-22 Nec Corp Packet transmission device, packet transmission method, and computer program
WO2014064976A1 (en) * 2012-10-24 2014-05-01 日本電気株式会社 Network device, control method, and program
JP2014086884A (en) * 2012-10-24 2014-05-12 Nec Corp Network equipment, method and program
JP2015100024A (en) * 2013-11-19 2015-05-28 三菱電機株式会社 Communication device and communication path redundancy method
JP2015139111A (en) * 2014-01-22 2015-07-30 日立金属株式会社 Relay system and switch device

Also Published As

Publication number Publication date Type
JPWO2004086697A1 (en) 2006-06-29 application

Similar Documents

Publication Publication Date Title
Qiao et al. Optical burst switching (OBS)–a new paradigm for an Optical Internet^{1}
Yoo et al. New optical burst-switching protocol for supporting quality of service
US7149795B2 (en) Distributed quality-of-service system
US6714517B1 (en) Method and apparatus for interconnection of packet switches with guaranteed bandwidth
US5557611A (en) ATM cross-connect node utilizing two passes through the connection network with shaping between passes for optimal resource allocation in a bursty environment
US6345040B1 (en) Scalable scheduled cell switch and method for switching
US6850486B2 (en) Method of reducing traffic during path restoration
US6950391B1 (en) Configurable network router
US5490252A (en) System having central processor for transmitting generic packets to another processor to be altered and transmitting altered packets back to central processor for routing
US6963575B1 (en) Enhanced data switching/routing for multi-regional IP over fiber network
Bush et al. Some Internet architectural guidelines and philosophy
US6385204B1 (en) Network architecture and call processing system
US5345445A (en) Establishing telecommunications calls in a broadband network
US7391771B2 (en) Method of sending information through a tree and ring topology of a network system
US6381647B1 (en) Method and system for scheduling network communication
US5459723A (en) Packet management device for fast-packet network
US5504743A (en) Message routing
US6266702B1 (en) Method and apparatus to insert and extract data from a plurality of slots of data frames by using access table to identify network nodes and their slots for insertion and extraction data
US7061861B1 (en) Method and system for weighted fair flow control in an asynchronous metro packet transport ring network
US20030058880A1 (en) Multi-service queuing method and apparatus that provides exhaustive arbitration, load balancing, and support for rapid port failover
US7113481B2 (en) Informed dynamic path protection for optical networks
US5345446A (en) Establishing telecommunications call paths in broadband communication networks
US7272137B2 (en) Data stream filtering apparatus and method
US20020085548A1 (en) Quality of service technique for a data communication network
US20030133406A1 (en) Method and apparatus to minimize congestion in a packet switched network

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CN JP US

WWE Wipo information: entry into national phase

Ref document number: 2004569920

Country of ref document: JP