• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    An object of the present invention is to provide a node apparatus that can prevent the occupation of a queue by a long message without preparing a large amount of queues. The apparatus is equipped with input interfaces, a switch, output interfaces, and queues. The node is also equipped, in the input interfaces, with input transmission-message monitoring points, and is equipped, in the output interfaces, with output transmission-message monitoring points. The node is also equipped, in a switch controller, with a control table for associating a flow corresponding to internal information of the transmission message with this internal information thereof and a per-flow counter for counting the transmission message that corresponds to each flow. Threshold values are provided within the control table, and these threshold values are compared with a counted value of the per-flow counter, thereby managing the transmission messages.
    公开号:US20010008527A1
    申请号:US09/759,168
    申请日:2001-01-16
    公开日:2001-07-19
    发明作者:Shizuka Hatano
    申请人:NEC Corp；
    IPC主号:H04L47-32
    专利说明:
    [0001] 1. Technical Field of the Invention [0001]
    [0002] The present invention relates to a node apparatus and a transmission-message adequacy guaranteeing method for use therein. In particular, the invention relates to a node apparatus for switching an indefinitely long transmission message in the node such as a router or bridge. [0002]
    [0003] 2. Description of the Prior Art [0003]
    [0004] In recent years, it is important to guarantee the QoS (Quality of Service) which depends upon the transmission message per transmission origin or transfer rate and delay per transmission origin or destination of the transmission message. [0004]
    [0005] However, most of the node apparatus for switching the messages have not had the above-described function taken into consideration. An example of the construction of such an apparatus will hereafter be explained with reference to FIG. 5. FIG. 5 shows an example of the construction of a conventional apparatus, in which the whole traffic is kept queued or accumulated in a single memory resource. [0005]
    [0006] In FIG. 5, the node apparatus [0006] 3 is constructed of input interface parts (A, B) 31 and 32 that are connected to other communication node apparatus (not shown) via communication paths (not shown), output interface parts (C, D) 34 and 35, and a switch part 33 for switching the received transmission message to a transmission destination's interface.
    [0007] The interiors of the interface parts [0007] 31, 32, 34, and 35 and the interiors of the switch parts 33 are equipped with queues 31 a, 32 a, 33 a, 34 a, and 35 a that are memories for storing the transmission messages therein. Thereby, the transmission messages are prevented from being destroyed due to the fluctuation in terms of the reception time length of the transmission message received from the transmission path.
    [0008] In the above-described conventional node apparatus, there is made up a construction wherein a transmission message is queued or stored with respect to the only queue used therein regardless of the transmission origin or transmission destination of the transmission message. Therefore, under the circumstances that a specified kind of transmission message is received in a large amount, because the specified transmission message occupies the queue, there is the problem that the apparatus is brought to a state of being unable to have other transmission origins/addressees accumulated in its queue. At such a time, that transmission message is wasted away. [0008]
    [0009] In order to avoid the disadvantage that the queue is occupied by a specified transmission message, an example of the construction wherein queue is disposed per packet flow shown in FIG. 6 has hitherto been proposed. In FIG. 6, a node apparatus [0009] 4, as in the case of the construction of the existing node apparatus 3 shown in FIG. 5, has a construction of having the input interface parts (A, B) 41 and 42 and output interface parts (C, D) 44 and 45, the switch part 43, and the queues 41 b, 42 b, 43 a, 44 a, and 45 a. However, other than the above-described construction, the node apparatus 4 is equipped with queues 41 c and 42 c, and 43 b as well as transmission-message sorting functions 41 a and 42 a that respectively cause the input interface parts 41 and 42 to queue the transmission messages of specified addressees into the queues 41 c and 42 c.
    [0010] Also, in that this node apparatus [0010] 4 is equipped with a sorting table 46 for associating the queues, which each queue a relevant transmission message therein, with respect to within-transmission-message addressee information, the node apparatus 4 is different from the existing node apparatus 3.
    [0011] By the node apparatus being equipped with the above-described function, in the node apparatus [0011] 4, even in case a specified transmission message is received in large amount with a high speed, only the queue 41 b alone in which the specified transmission message is queued overflows with it, whereby only the specified transmission message is abandoned. The transmission messages having other transmission origins and destinations are each queued in any one of the other separate queues 41 c and 42 c. Therefore, each of these transmission messages is transferred through the interior of the node apparatus 4 and is then transmitted from the output interface part 45.
    [0012] In this example, although the above-described problems are solved, it is necessary to prepare a queue in units of a transmission origin/transmission destination of the transmission message. Resultantly, in the recent-year node apparatus that manages the transmission origin/transmission destination information in large amount, it is a disadvantage that the amount of memories actually equipped becomes very large correspondingly to the amount of queues used. [0012] SUMMARY OF THE INVENTION
    [0013] Thereupon, the object of the present invention is to solve the above-described points in problem and to provide a node apparatus that can prevent a specified transmission message from occupying the queues without preparing a large amount of queues and a transmission-message adequacy guaranteeing method. [0013]
    [0014] A node apparatus according to the present invention is one for switching a non-specified length of transmission message, and is equipped with an input monitoring point for monitoring the input of the transmission message, an output monitoring point for monitoring the output of the transmission message, counter for counting the amount of the transmission message accumulated correspondingly to the monitored results of the input monitoring point and the output monitoring point, and means for performing control so that when the counted value of the counter has exceeded a preset threshold value the corresponding transmission message may be abandoned. [0014]
    [0015] A method of guaranteeing the adequacy of a transmission message according to the present invention is one for a node apparatus for switching a non-specified length of transmission message, and includes the steps of counting the amount of the transmission message accumulated correspondingly to the monitored results of the input of the transmission message and the output of the transmission message and performing control so as to disuse the transmission message when the counted value has exceeded a present threshold value. [0015]
    [0016] The node apparatus of the present invention uses the system of managing per flow “each, or an aggregation, of individual transmission messages recognized by a combination of the within-transmission-message information (interface, transmission origin/transmission destination, and the like)” by merely adding a simple counter function to the existing node apparatus. Therefore, it is possible to prevent a specified kind of transmission message from occupying the queues as a whole. [0016]
    [0017] Also, by using the counter function, it becomes unnecessary to prepare a large amount of queues and in hence it becomes possible to reduce the amount of memory used. Further, it becomes possible to specify a management queue by changing the disposition and combination of the input and output transmission-message monitoring points as desired. Furthermore, only by performing setting of the control table as desired, it becomes possible to easily change the managing setting on a scale as measured in units of a flow. [0017]
    [0018] As has been described above, according to the present invention, in the node apparatus in which to switch a non-specified length of transmission message, the node apparatus is arranged as follows. Namely, correspondingly to the monitored results of the input monitoring point for monitoring the input of the transmission message and the output monitoring point for monitoring the output of the transmission message, counting of the amount of transmission message accumulated is performed. Thereby, the operation of the node apparatus is controlled so that when this counted value has exceeded a preset threshold value the relevant transmission message may be abandoned. As a result of this, the node apparatus of the invention has the effect of enabling preventing the occupation of the queue by a specified kind of transmission message without preparing a large amount of queues. [0018] BRIEF EXPLANATION OF THE DRAWINGS
    [0019] FIG. 1 is a block diagram showing the construction of a node apparatus according to an embodiment of the present invention. [0019]
    [0020] FIG. 2 is a flowchart showing the operation of the node apparatus [0020] 1 according to the embodiment of the present invention.
    [0021] FIGS. 3A to [0021] 3D each are diagrams each showing an example of the definition made in the control table of FIG. 1.
    [0022] FIG. 4 is a block diagram showing the construction of a node apparatus according to another embodiment of the present invention. [0022]
    [0023] FIG. 5 is a block diagram showing an example of the construction of a node apparatus according to the prior art. [0023]
    [0024] FIG. 6 is a block diagram showing another example of the construction of the node apparatus according to the prior art. [0024] PREFERRED EMBODIMENT OF THE INVENTION
    [0025] One of the embodiments of the present invention will be explained with reference to FIG. 1. [0025]
    [0026] FIG. 1 is a block diagram showing the construction of a node apparatus according to an embodiment of the present invention. In FIG. 1, a node apparatus [0026] 1 is equipped, as in the case of the existing node apparatus 3 shown in FIG. 5, with input interface parts (A, B) 11 and 12, a switch part 13, output interface parts (C, D) 14 and 15, and queues 11 b, 12 b, 13 a, 14 a, and 15 a. The node apparatus thereby serves to switch a non-specified length of transmission message (packet) such as a router/bridge, and the like.
    [0027] However, unlike the existing node apparatus [0027] 3 shown in FIG. 5, the node apparatus 1 according to the embodiment of the present invention is interiorly equipped with input transmission-message monitoring points 11 a and 12 a and output transmission-message monitoring points 14 b and 15 b. The node apparatus 1 is also equipped, within a switch controller 16, with a control table 16 a with reference to that the flow is associated with inside-transmission-message information and a per-flow counter 16 b for counting the transmission message in units of a flow. By this equipping, the transmission message is managed in such a way as to provide threshold values (the upper limit values as set) within the control table 16 a and to compare these threshold values with the counted values of the per-flow counter 16 b.
    [0028] By the above-described function being equipped to it, in the node apparatus [0028] 1, in case a specified type of transmission message is received in large amount with a high speed, even if the value of this transmission message is equal to or greater than the corresponding threshold value, this message is abandoned without being queued. This is because the transmission message is sorted by being monitored in units of a flow by the input transmission-message monitoring points 11 a and 12 a and output transmission-message monitoring points 14 b and 15 b. Therefore, other flow transmission-messages are transferred through the node apparatus 1 without being abandoned and are transmitted from the output interface parts 14 and 15.
    [0029] FIG. 2 is a flowchart showing the operation of the node apparatus [0029] 1 according to the embodiment of the present invention. The operation of the node apparatus 1 according to the embodiment of the present invention will be explained with reference to these FIGS. 1 and 2.
    [0030] In the node apparatus [0030] 1, before the queues 11 b and 12 b within the respective interface parts 11 and 12 there are disposed the input transmission-message monitoring points 11 a and 12 a. After, or at the back of, the queues 14 a and 15 a within the respective output interface parts 14 and 15 there are disposed the output transmission message monitoring points 14 b and 15 b.
    [0031] The transmission messages received by the input interface parts [0031] 11 and 12 are input to the input transmission-message monitoring points 11 a and 12 a, in which according to the inside-transmission-message information (input interface/transmission origin/transmission destination or addressee) the flow is discriminated with reference to the control table 16 a. Correspondingly to the discriminated flow-type, the output interface parts 14 and 15 are determined (steps S1 and S3 in FIG. 2).
    [0032] At this time, in the switch controller [0032] 16, by a value corresponding to the length of the transmission message regarding that the output interface parts 14 and 15 are determined, addition-counting of the per-flow counter 16 b is performed (step S4 in FIG. 2).
    [0033] The counted value of the addition-counted per-flow counter [0033] 16 b is compared with the threshold value within the control table 16 a (step S5 in FIG. 2). If determined as being equal to or smaller than the threshold value (step S6 in FIG. 2), the relevant transmission message is input to the queues 11 b and 12 b (step S8 in FIG. 2). Then, this relevant transmission message is transferred through the interior of the node apparatus 1 by way of the switch 13 and is sent to the output transmission-message monitoring points 14 b and 15 b of the determined output interface parts 14 and 15 (step S9 in FIG. 2).
    [0034] At this time, in the switch controller [0034] 16, by a value corresponding to the length of the transmission message sent to the output transmission-message monitoring points 14 b and 15 b, subtraction-counting of the per-flow counter 16 b is performed (step S2 in FIG. 2).
    [0035] The transmission message that has arrived in a large amount which is greater than the threshold value (step S[0035] 6 in FIG. 2) is abandoned without being input to the queues 11 b and 12 b even if the length is equal to or greater than that threshold value. Accordingly, a transmission message that comes in next becomes able to be input to the queues 11 b and 12 b.
    [0036] By the node apparatus being equipped with the above-described function, managing of the queues within the entire apparatus becomes possible, whereby it becomes impossible that all queues within the apparatus including the queue [0036] 13 a within the switch 13 will be occupied by a specified kind of transmission message. In this embodiment, by merely adding a simple counter function (per-flow counter 16 b) to the existing node apparatus 3, the transmission message is managed in units of a flow every transmission origin/addressee. Therefore, it is possible to prevent a specified kind of transmission message from occupying the queues as a whole.
    [0037] Also, by using the counter function (per-flow counter [0037] 16 b), it becomes unnecessary to prepare a large amount of queues and in hence it becomes possible to reduce the amount of memory used. Further, it becomes possible to specify a management queue by changing the disposition and combination of the input transmission-message monitoring points 11 a and 12 a and output transmission-message monitoring points 14 b and 15 b as desired. Furthermore, only by performing setting of the control table 16 a as desired, it becomes possible to easily change the setting on a scale as measured in units of a flow.
    [0038] FIGS. 3A to [0038] 3D are tables showing an example of the definition made in the control table 16 a of FIG. 1. In the definition shown in FIG. 3A, the transmission messages, for example, the transmission origins of that each are “192. 1. 1. 1.”, the input interfaces of that each are “A”, and the transmission destinations or addresses of that each are “192, 3. 1. 1” or “192. 3. 1. 2” or the like, and that therefore each are destined for a local network “192. 3. 1. *”, are each discriminated as being the same flow. Therefore, those transmission messages are equally counted in the same way. As a result of this, controlling the transmission messages in units of a local network becomes possible. With regard to the transmission origin as well, the same applies thereto.
    [0039] Also, in the definition shown in FIG. 3B, if the transmission origins of transmission messages are each “192. 1. 1. 1” and the input interfaces thereof are each “A”, whatever the addresses thereof may be, these transmission messages are each discriminated as being the same flow and are equally counted in the same way. Thereby, controlling in units of the transmission origin becomes possible. In the case of transmission messages the transmission origins of that each are “* “IP (Internet Protocol) address” as well, the same applies thereto. [0039]
    [0040] Further, in the definition shown in FIG. 3C, if the transmission origins of transmission messages are each “192. 1. 1. 1”and the transmission destinations thereof are each “192. 3. 1. 1”, whatever the input interfaces thereof may be, these transmission messages are each discriminated as being the same flow and equally counted in the same way. Thereby, controlling in units of the transmission destination becomes possible. [0040]
    [0041] Furthermore, in the definition shown in FIG. 3D, all of the transmission messages that have come over into the node apparatus are each discriminated as being the same flow and are equally counted in the same way. Thereby, controlling the apparatus as a whole becomes possible. As described above, since using a plurality of “*‘s” simultaneously is possible, various kinds of setting become able to be made. [0041]
    [0042] FIG. 4 is a block diagram showing the construction of the node apparatus according to another embodiment of the present invention. In FIG. 4, in the node apparatus [0042] 2 according to another embodiment, it is constructed that before and after the queue 23 b within the switch 23 transmission-message monitoring points 23 a and 23 c that operate in units of a flow. This construction is different from the node apparatus 1 according to the preceding embodiment of the invention shown in FIG. 1, in which by allotting a threshold value with respect to each of all the queues within the apparatus each of these queues is managed at the entrance (input interface parts 11 and 12) of the apparatus.
    [0043] It is arranged that the transmission messages received by the input interface parts [0043] 21 and 22 are transferred to the switch 23. At the input transmission-message monitoring point 23 a, according to the information contained in the transmission message flow discrimination is performed referring to the control table 26 a. And a determination is made of the output interface parts 24 and 25 correspondingly to the result of the flow discrimination.
    [0044] At this time, in the switch controller [0044] 26, addition counting of the per-flow counter 26 b is performed to an extent that corresponds to the length of the relevant transmission message. After passing through the queue 23 b, in the output transmission-message monitoring point 23 c, subtraction counting of the per-flow counter 26 b is performed to an extent that corresponds to the length of the transmission message. The transmission message that has come over in at a rate higher than that corresponding to the threshold value is abandoned at the inlet of the queue 23 b within the switch 23. Accordingly, the transmission message becomes able to enter into the queue 23 b.
    [0045] By the node apparatus being equipped with the above-described functions, it becomes possible to manage the queue [0045] 23 b within the switch 23, with the result that the queue 23 b within the switch ceases to be occupied by the transmission message. As described above, by changing the disposition position of the transmission-message monitoring points 23 a, 23 c, it becomes also possible to designate the range of queues that are to be managed.
    权利要求:
    Claims (10)
    [1" id="US-20010008527-A1-CLM-00001] 1. A node apparatus for switching a message which comprises:
    one or more input monitoring points for monitoring the input of said message;
    a switch for switching said message;
    one or more output monitoring points for monitoring the output of said message;
    a counter for counting the length of said message accumulated in said input monitoring points and output monitoring points; and
    a control unit for abandoning said message when the counted length has exceeded a prescribed threshold value.
    [2" id="US-20010008527-A1-CLM-00002] 2. The node apparatus according to
    claim 1 , wherein said counter executes addition or subtraction of the length of said message, on the basis of the monitored results of said input monitoring points and said output monitoring points.
    [3" id="US-20010008527-A1-CLM-00003] 3. The node apparatus according to
    claim 1 , wherein:
    said input monitoring points are disposed in said input interfaces; and
    said output monitoring points are disposed in said output interfaces.
    [4" id="US-20010008527-A1-CLM-00004] 4. The node apparatus according to
    claim 1 , wherein:
    said input monitoring point is disposed on an input side of said switch; and
    said output monitoring point is disposed on an output side of said switch.
    [5" id="US-20010008527-A1-CLM-00005] 5. The node apparatus according to
    claim 1 , wherein said counter counts the length of the flow containing one or more messages.
    [6" id="US-20010008527-A1-CLM-00006] 6. The node apparatus according to
    claim 5 , wherein said flow is identified by the input interface, the output interface, a transmitter, and a receiver of said messages.
    [7" id="US-20010008527-A1-CLM-00007] 7. A queuing method for message inputted and outputted from a node apparatus which comprises the steps of:
    monitoring said message inputted into said node;
    monitoring said message outputted from said node;
    counting the length of said message on the basis of said monitoring; and
    abandoning said message when the counted value has exceeded a present threshold value.
    [8" id="US-20010008527-A1-CLM-00008] 8. The queuing method according to
    claim 7 , wherein, the counting step includes the steps of adding and subtracting said length of said message on the basis the result of said monitoring.
    [9" id="US-20010008527-A1-CLM-00009] 9. The queuing method according to
    claim 7 , the length of the flow containing one or more messages are counted in the counting step.
    [10" id="US-20010008527-A1-CLM-00010] 10. The queuing method according to
    claim 9 , wherein said flow is identified by the input interface, the output interface, a transmitter, and a receiver of said messages.
    类似技术:
    公开号 | 公开日 | 专利标题
    US6188698B1|2001-02-13|Multiple-criteria queueing and transmission scheduling system for multimedia networks
    US8379658B2|2013-02-19|Deferred queuing in a buffered switch
    US6934250B1|2005-08-23|Method and apparatus for an output packet organizer
    US8018851B1|2011-09-13|Flow control for multiport PHY
    US7653069B2|2010-01-26|Two stage queue arbitration
    US6108307A|2000-08-22|Frame relay priority queses to offer multiple service classes
    CA2099170C|1999-12-14|Congestion control in high speed networks
    US7916718B2|2011-03-29|Flow and congestion control in switch architectures for multi-hop, memory efficient fabrics
    US6370116B1|2002-04-09|Tolerant CIR monitoring and policing
    US8411574B2|2013-04-02|Starvation free flow control in a shared memory switching device
    US6882642B1|2005-04-19|Method and apparatus for input rate regulation associated with a packet processing pipeline
    US7058070B2|2006-06-06|Back pressure control system for network switch port
    EP0706297A1|1996-04-10|Method for operating traffic congestion control in a data communication network and system for implementing said method
    US20130194929A1|2013-08-01|System and methods for distributed quality of service enforcement
    JP2006506845A|2006-02-23|How to select a logical link for a packet in a router
    US7787469B2|2010-08-31|System and method for provisioning a quality of service within a switch fabric
    US6661803B1|2003-12-09|Network switch including bandwidth controller
    US20040105384A1|2004-06-03|Event-driven flow control for a very high-speed switching node
    US20050068798A1|2005-03-31|Committed access rate | system architecture
    JP2000196628A|2000-07-14|Method and system for managing congestion
    KR100258157B1|2000-06-01|Priority control method of virtual clrcuit and device thereof
    US20140241160A1|2014-08-28|Scalable, Low Latency, Deep Buffered Switch Architecture
    US6418118B1|2002-07-09|Network device including selective discard of packets
    Shreedhar et al.1996|E cient fair queuing using de cit round robin
    CN104539553A|2015-04-22|Flow control method and device achieved in ethernet chip
    同族专利:
    公开号 | 公开日
    EP1119142A2|2001-07-25|
    JP2001203751A|2001-07-27|
    CA2331252A1|2001-07-19|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    EP1887741B1|2006-08-09|2010-03-17|Hitachi Ltd.|Apparatus for controlling data packet flow|
    法律状态:
    2001-01-16| AS| Assignment|Owner name: NEC CORPORATION, JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HATANO, SHIZUKA;REEL/FRAME:011458/0375 Effective date: 20010105 |
    2002-09-16| STCB| Information on status: application discontinuation|Free format text: EXPRESSLY ABANDONED -- DURING EXAMINATION |
    优先权:
    申请号 | 申请日 | 专利标题
    JP2000009606A|JP2001203751A|2000-01-19|2000-01-19|Node device and message impartiality guaranteeing method used for the same|
    JP2000-009606||2000-01-19||
    [返回顶部]