WO1997005724A1 - Unite de commande de vitesse dynamique - Google Patents

Unite de commande de vitesse dynamique Download PDF

Info

Publication number
WO1997005724A1
WO1997005724A1 PCT/JP1996/002131 JP9602131W WO9705724A1 WO 1997005724 A1 WO1997005724 A1 WO 1997005724A1 JP 9602131 W JP9602131 W JP 9602131W WO 9705724 A1 WO9705724 A1 WO 9705724A1
Authority
WO
WIPO (PCT)
Prior art keywords
cell
connection
rate
control device
transmission
Prior art date
Application number
PCT/JP1996/002131
Other languages
English (en)
Japanese (ja)
Inventor
Haruhisa Hasegawa
Naoaki Yamanaka
Kouhei Shiomoto
Original Assignee
Nippon Telegraph And Telephone Corporation
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
Priority claimed from JP19772895A external-priority patent/JP3287529B2/ja
Priority claimed from JP22674695A external-priority patent/JP3087941B2/ja
Priority claimed from JP23869195A external-priority patent/JP3087942B2/ja
Priority claimed from JP26442295A external-priority patent/JP3085516B2/ja
Priority claimed from JP28528995A external-priority patent/JP3039849B2/ja
Application filed by Nippon Telegraph And Telephone Corporation filed Critical Nippon Telegraph And Telephone Corporation
Priority to DE69637027T priority Critical patent/DE69637027T2/de
Priority to EP96925120A priority patent/EP0812083B1/fr
Publication of WO1997005724A1 publication Critical patent/WO1997005724A1/fr
Priority to US08/825,936 priority patent/US6046983A/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5032—Generating service level reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H04L43/0894—Packet rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H04L2012/5635—Backpressure, e.g. for ABR
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/02—Capturing of monitoring data
    • H04L43/026—Capturing of monitoring data using flow identification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring

Definitions

  • the present invention is used for asynchronous transfer mode (hereinafter referred to as ATM Asynchronous Transfer Mode) communication.
  • ATM Asynchronous Transfer Mode asynchronous transfer mode
  • the transmission rate between the communication terminals is controlled so as to approach a state satisfying fairness at a high speed. It relates to the configuration and control method of the communication network.
  • the present invention relates to rate control and traffic control in a bucket switching network or an ATM network.
  • the present invention is provided in an ATM communication network and is used as buffer means for temporarily storing cells or buckets.
  • the present invention relates to a technique for controlling a transmission interval of a predetermined cell or bucket for each connection.
  • the present invention relates to congestion control. In particular, it relates to the regulation of cell transmission speed and its release criteria.
  • the present invention relates to a technique for setting a virtual path and a virtual channel.
  • a cell for information collection (RM cell: RM cell :) between the originating and terminating communication terminals in order to collect information on congestion and the amount of acceptable bandwidth in the route.
  • the network writes information into the RM cell, and the originating communication terminal refers to it to control the cell transmission rate.
  • ABR Advanced Bit Rate
  • ATM Forum atmf95-0013R2
  • ABR Advanced Bit Rate
  • FIG. 52 is an overall configuration diagram of a conventional ATM communication network.
  • FIG. 53 is a diagram showing the configuration of the RM cell.
  • Fig. 5 4 Is a flowchart showing the operation of the communication terminal on the calling side.
  • FIG. 55 and FIG. 56 are flowcharts showing the operation of the destination local exchange and transit exchange.
  • FIG. 57 is a flowchart showing the operation of the destination communication terminal.
  • the ATM communication network shown in FIG. 52 is configured based on the ABR protocol. In FIG.
  • the RM cell is composed of an ATM header, protocol identifier (ID), direction identifier (DIR), backward congestion notification cell identifier (BN), congestion notification (CI), and transmission prohibition rate increase notification (NI ), Request Z Acceptance Notification (RA), Explicit Transmission Allowed Rate (ER), Current Allowed Transmission Rate (CCR), Minimum Cell Rate (MCR), Queue Length (QL), Sequence Number (SN).
  • ID protocol identifier
  • DIR direction identifier
  • BN backward congestion notification cell identifier
  • CI congestion notification
  • NI transmission prohibition rate increase notification
  • RA Request Z Acceptance Notification
  • ER Explicit Transmission Allowed Rate
  • CCR Current Allowed Transmission Rate
  • MCR Minimum Cell Rate
  • QL Queue Length
  • Sequence Number SN
  • an RM cell is periodically transmitted from the calling communication terminal 501 for each sending and receiving pair, and the exchange 30 performing the relaying writes the congestion information and the amount of receivable bandwidth in the corresponding route.
  • the communication terminal 60-1 on the receiving side loops it back and notifies the communication terminal 50-1 on the calling side of the presence or absence of congestion in the route.
  • the originating communication terminal 50-1 must transmit at a cell transmission rate lower than the allowable cell transmission rate called ACR (Allowed Cell Rate) according to the rules of the ABR protocol.
  • ACR Allowed Cell Rate
  • the originating communication terminal 50-1 When receiving the notification of the congestion by the RM cell, the originating communication terminal 50-1 reduces the ACR based on the ABR protocol. Conversely, when it is notified that there is no congestion, the ACR is raised based on the ABR protocol.
  • the originating communication terminal 50-1 if there is a minimum value of the acceptable bandwidth of the network notified by the RM cell, the smaller of the value and the newly calculated ACR value Change to the transmission rate of the following cell. If there is no minimum value of the acceptable bandwidth of the network, change to the transmission rate of cells below ACR.
  • the I CRGnitial Cell Rate When a new VC (Virtual Channel) starts transmitting data, it is called the I CRGnitial Cell Rate after transmitting the first RM cell. Transmission at a transmission rate of the specified cell at the start of transmission or lower is permitted.
  • the cell transmission rate is controlled by the procedure described above.
  • the operation of the originating communication terminal 50-1 based on the ABR protocol is shown in FIGS. 54 and 55
  • the operation of the exchanges 20, 30 and 40 is shown in FIG.
  • FIG. 57 shows the operation of the communication terminal 60-1.
  • the originating communication terminal 50-1 generates an RM cell (S1), initializes it (S2), and transmits it (S3).
  • the RM cell is looped back through the exchange 20—exchange 30 ⁇ exchange 40 ⁇ destination communication terminal 60-1 and received by the originating communication terminal 50-1 as shown in FIG. 55 (S11) ). If there is a congestion notification in the RM cell (S12), the ACR is reduced (S14); otherwise, the ACR is increased (S13). This changes the cell transmission rate (S15).
  • each notified communication terminal lowers the transmission rate and consequently reduces the available capacity.
  • Each communication terminal raises the transmission rate again when it is notified that it has left the congestion state. By repeating this, the mechanism gradually approaches a fair transmission rate.
  • FIG. 58 is a diagram illustrating control of a cell transmission rate in a conventional ATM communication network.
  • the communication terminals 50-1 to 50-3 are the originating terminals, and are the respective destination terminals.
  • Connections 70-1, 70-2, and 70-3 via exchanges 20 to 40 are set between communication terminals 60-1 to 60-3. These connections 70-1 and 70-2.7-0-3 share the transmission line 5 between the exchanges 20 and 40.
  • Transmission rate control is performed as follows. That is, the communication terminal 50-1-3-50-13, which is the originating terminal, generates and inserts a control cell at regular cell intervals, and the communication terminals 60-1, -6, which are the destination terminals.
  • the control cell is reciprocated between the exchanges, and the exchanges 20 to 40 write information to the cell, and the communication terminals 50-1 to 50-13, which are the originating terminals, refer to the information to control the transmission rate.
  • the originating terminal transmits a control cell at regular cell intervals, and each exchange through which it passes determines the allowable transmission rate of the communication terminal from the control cell. It reads the congestion information for the switch itself and calculates the acceptable transmission rate.
  • the maximum allowable transmission rate (PCR) for each connection is described as the initial value of the acceptable transmission rate when the calling terminal transmits.
  • Each exchange writes the calculated rate into the control cell only when the acceptable transmission rate calculated by the exchange is smaller than the acceptable transmission rate written in the returned control cell. Notify the calling terminal.
  • the calling terminal sets its own ACR to a value lower than the notified acceptable transmission rate, and transmits at a rate lower than the ACR.
  • FIGS. 59 to 61 are diagrams showing the flow of control in the exchange, FIG. 59 shows control when congestion is determined, and FIG. 60 shows a case where a control cell arrives from the calling terminal side.
  • Fig. 61 shows the control when the control cell is looped back from the called terminal.
  • Each exchange observes the queue length in the cell buffer waiting for transmission, and if the queue exceeds the threshold value, determines that its own switch is congested; otherwise, determines that it is not congested. . Then, when it is determined that the state is congested, as shown in FIG. Then, the current permissible transmission rate reduced by a certain percentage is calculated as the acceptable transmission rate in the exchange.
  • FIG. 62 shows the flow of control of the exchange when it is determined that there is no congestion.
  • the exchange increases the acceptable transmission rate in the exchange from the allowable transmission rate. That is,
  • the larger ERQi is set as a new ERQi (S61).
  • the control when the control cell arrives from the calling terminal side and the control when the control cell is looped back from the called terminal side are the same, thereby increasing the ACR of the calling terminal.
  • UPC / NPC User / Network Parameter Control
  • a traffic accommodation design is performed based on the cell interval.
  • the cell interval is specified for each connection. It is common to install usage monitoring devices, such as UPCZNPC, to monitor compliance.
  • UPCZNPC usage monitoring devices
  • CDV Cell Delay Variation
  • the ABR service which has been actively discussed in ATM forums in recent years, uses RM cells to notify end-to-end, end-to-end, and end-to-end flow control of bandwidth on a route, and performs flow control. It is.
  • the control loop of the RM cell since the control loop of the RM cell is closed at the end, two, and end, even if the RM cell is discarded due to congestion, the negative feedback mechanism works and the flow is suppressed.
  • the cell transfer delay is large, as in the case of a public network, the information on the availability of the bandwidth on the route obtained by the RM cell is no longer old. Is a problem.
  • VD / VS virtual destination / virtual source
  • a cell buffer is prepared for VDZVS, and cells are stored for each connection. Reading of cells from the cell buffer is performed by traffic shaving control.
  • the RM cell transmitted by itself returns to the network and returns, the transmission interval of the cell of the connection is determined based on the content, and the cell of the connection is read from the cell buffer at the interval.
  • the protocol of the upper layer of the cell transmission layer has a retransmission function
  • the retransmission function is activated and the degree of congestion is promoted. In order to prevent catastrophic congestion from occurring, it is necessary to regulate the amount of traffic added to the network when the network is congested.
  • the peak speed and average speed of each connection are distributed over a wide range. Therefore, different peak speeds and average speeds are referred to as call types, and call admission control (CAC) is performed to satisfy the required communication quality for each call type.
  • CAC call admission control
  • ri and a represent the peak speed and average speed of call type i, respectively, and a all and C represent the sum of the average speeds of all VCs and the VP band, respectively.
  • CLR AVE is the average cell loss rate for all call types. If f (x) is the cell rate probability density function of call type i and F i (x) is the cell rate probability density function of other call types except call type i, the cell loss CLR, of call type i is Strictly speaking,
  • Fig. 63 is a diagram showing the call type cell loss rate and the number of connected VCs in a multiple environment. The number of connections for call type 1 is plotted on the horizontal axis, the number of connections for call type 2 is plotted on the left vertical axis, and the cell loss ratio (CLR) is plotted on the right vertical axis. From Figure 63,
  • Call type 1 has a higher cell loss rate than call type 2, and the difference may be more than one digit.
  • the transmission rate for each connection is distributed over a wide range, and when the distance between communication terminals is large, information on the availability of the route to be notified is provided. It is difficult to obtain a good control effect because of the aging. For example, it takes time to transmit an RM cell, and a communication terminal that newly transmits takes time to control the ACR of a communication terminal that has already transmitted. Therefore, it takes time to converge to a fair amount of bandwidth distribution. It is also difficult to keep up with the ever-changing transmission rate and network conditions. To shorten the time required for raising the ACR, it can be avoided by setting the ICR of each communication terminal to a high value. However, when the distance between the communication terminals is large, it takes time to notify the congestion. It is necessary to take measures such as increasing the buffer length in the network and reducing the network usage rate.
  • the acceptable transmission rate is increased or decreased for the connections on the same exchange based on the same state of radiation. For this reason, control is performed to perform a uniform operation of increasing or decreasing as a whole, and does not necessarily fully satisfy fairness.
  • the number of connections increases, the number of cell buffer queues increases, and the hard disk size increases in addition to the increase in memory capacity.
  • traffic shaping only one cell can be transferred in one slot, but if multiple cells are scheduled in the same slot, one of them is not transferred.
  • the probability that multiple cells are scheduled in the same slot increases, and this problem becomes apparent.
  • the C A C determines whether or not to accept a connection when setting up a connection, so high performance and responsiveness are required to provide real-time switching services.
  • the present invention has been made in such a background, and the best F-auto service
  • An object of the present invention is to provide a dynamic rate control device capable of controlling the transmission rates among a plurality of communication terminals in a network fairly.
  • An object of the present invention is to provide a dynamic rate control device capable of quickly converging transmission rates between a plurality of communication terminals to a fair state.
  • the present invention provides a dynamic rate control device capable of fairly controlling the cell transmission rate of each communication terminal without making transmission delay a problem even when the distance between a plurality of communication terminals is large. The purpose is to do.
  • the present invention provides a dynamic rate control device that can change the direction in which the available bandwidth of each connection is maximized while satisfying the fairness of the acceptable transmission rate notified between the connections.
  • An object of the present invention is to provide a dynamic rate control device capable of realizing traffic shaping on a relatively reasonable hardware scale even if the number of connections increases.
  • An object of the present invention is to provide a dynamic rate control device that can transfer a plurality of cells scheduled in the same slot (time).
  • An object of the present invention is to provide a dynamic rate control device capable of improving the throughput of an ATM communication network.
  • SUMMARY OF THE INVENTION It is an object of the present invention to provide a dynamic rate control device that can quickly reduce the congestion state.
  • An object of the present invention is to provide a dynamic rate control device capable of improving the responsiveness of CAC by calculating the cell loss rate of a call type by a simple calculation even when the number of call types increases. I do.
  • An object of the present invention is to provide a dynamic rate control device capable of performing smooth call admission control.
  • the present invention is directed to a switch for accommodating a plurality of communication terminals receiving a best-effort service, which is used for controlling the transmission rate of the communication terminals to quickly converge to a transmission rate satisfying fairness among the communication terminals. It has a control method.
  • the information collection cell is reciprocated between the originating and terminating communication terminals, and the ATM communication network writes the congestion information and the information on the amount of acceptable bandwidth into the ATM communication network.
  • transmission rate control was performed. It differs from the conventional technology in the configuration of the communication network, the setting of the transmission rate control timing, the logic of the transmission rate control, and the speed of convergence of the transmission rate.
  • the present invention is a dynamic rate control device, which includes a large number of communication terminals, and includes means for setting a virtual path to one of the communication terminals based on a request from one of the communication terminals.
  • Dynamic rate control device A feature of the present invention is that: means for collecting route information including virtual path vacant band information set once by designating a transmission rate for one communication terminal; and transmitting a request from the one communication terminal. Means for holding the rate, and dynamically increasing the transmission rate of the virtual path set once based on the route information to the required transmission rate of the communication terminal as much as possible and for a plurality of communication terminals having connection requests. It has a control means for fair control. It is preferable that the control means includes means for calculating and setting a cell transmission rate allowed for the communication terminal.
  • the exchange in which the communication terminal is accommodated collects VP information or route information regardless of whether or not this communication terminal performs transmission. For this reason, it is possible to quickly calculate the transmission rate of the cell together with the transmission start request from the communication terminal and return whether or not transmission can be started to the communication terminal.
  • the vacant band information is numerical information, and the means for calculating and setting includes means for multiplying the vacant band information by a constant C (0 ⁇ C ⁇ 1) to calculate the allowable cell transmission rate. it can.
  • the value of the constant C can be set appropriately in consideration of the characteristics of the ATM communication network, the type of information, and other factors.
  • the initial transmission rate of the cell of the communication terminal is changed to the allowable transmission rate of the cell. It is desirable to have means for setting In the present invention, transmission and reception of RM cells are not performed between exchanges accommodating communication terminals, and transmission / reception requests are sent from the communication terminals to determine whether or not the transmission start request is possible, and until the cell transmission rate is set. Is characterized by the fact that When the minimum transmission rate of the cell included in the communication start request is smaller than the allowable transmission rate of the cell, the transmission rate of the cell is promptly increased to correspond to the transmission of the communication terminal.
  • the permissible increase and decrease of the cell transmission rate can be performed stepwise for each unit increase.
  • the amount of increase in the transmission rate of the communication terminal that can be increased at one time is determined in advance, and this is defined as a unit increase. If the permissible cell transmission rate is less than this unit increase, the transmission rate is increased by the unit increase. After the increase, the same procedure is performed. If the allowable cell transmission rate is still higher than this unit increase, the transmission rate is increased again by the unit increase. By repeating this procedure, the transmission rate of the communication terminal can be increased at a high speed. Rather than gradually increasing the transmission rate while observing the status of the entire route, the unit increment is set in advance, and the unit increment is increased at once by the judgment of only the exchange accommodating the communication terminal. The transmission rate of the communication terminal can be increased step by step at a high speed.
  • the route information is a quantity indicating the amount of available bandwidth of the virtual path included in the route in a stepwise manner.
  • the calculation and setting means is a means for uniquely setting the allowed cell transmission rate according to this quantity.
  • the route information is a quantity indicating the queue length of a cell buffer provided at a node included in the route in a stepwise manner, and the means for calculating and setting the number of cells allowed according to this quantity.
  • Means for uniquely setting the transmission rate may be included. For example, a plurality of thresholds are set for the queue length of the cell buffer, and the transmission rate is calculated by comparing the thresholds with the thresholds. Furthermore, it is also possible to set a threshold value for the transmission rate of the communication terminal, and to select a communication terminal to be notified of congestion in consideration of the result derived from the queue length of the cell buffer.
  • the operation setting means may include means for discarding the received RM cell. desirable.
  • the local exchange calculates the cell transmission rate and writes the calculation result to the RM cell to notify the communication terminal, if there is another RM cell from another, the local exchange identifies it. Should be discarded. This can prevent the communication terminal from malfunctioning due to a plurality of different pieces of information.
  • the control means may include means for notifying the communication terminal on the originating side of the connection accommodated by itself of information on an acceptable transmission rate; and Means for collecting and retaining information on the allowable transmission rate and the actual transmission rate permitted for the connection, the total bandwidth and the total input bandwidth of the shared transmission path, and the number of connections sharing the transmission path; Means for calculating, for each connection, an acceptable transmission rate at which the notifying means notifies the originating communication terminal based on the information held in the collecting and holding means. You can also.
  • the acceptable transmission rate to be notified between the connections can be individually rewritten and notified in a direction to increase fairness, instead of being directed in the same direction, such as increasing or decreasing as a whole.
  • the transmission rate that can be accepted for each connection can be rewritten and notified in the direction of increasing the available bandwidth of each connection within a range that does not cause congestion.
  • the control unit notifies the communication terminal of information on an acceptable transmission rate, and the communication terminal accommodated by the communication terminal includes the calling terminal.
  • the allowed transmission rate and actual transmission rate allowed for each connection the bandwidth of the shared route and the total input bandwidth, and the sharing of the route Means for collecting and holding the information on the number of connections; and means for notifying based on the information held in the means for collecting and holding the notification.
  • Means for calculating an acceptable transmission rate for each connection can notify the originating terminal of the acceptable transmission rate.
  • the time required for the communication is short, the notification to the calling terminal can be performed at high speed, and the calculation can be performed only by the exchange that accommodates the communication terminal without calculating the transmission rate that all exchanges can accept. Even when a connection starts transmitting, the transmission rate can be controlled immediately.
  • the information notified by the notifying means to the communication terminal may be data of the transmission rate itself, or information instructing an increase or decrease of the allowable transmission rate. When the latter information is used, the communication terminal increases or decreases its allowable transmission rate according to a predetermined calculation formula.
  • the means for calculating is the dispersion of the ratio of the allowable transmission rate to the request rate of each connection.
  • ERQ j ccn-i ⁇ sign ⁇ n ⁇ cc / r; — w ⁇ ⁇ iCc / ⁇
  • n is the number of connections transmitting data.
  • “” and w are weight functions, and s i gn ⁇ is a function representing the sign of the value in ⁇ .
  • Hi j may be a positive constant
  • ⁇ n ⁇ ccri / rj -w ⁇ ⁇ iCcri / rs ⁇ May be a value equal to the absolute value of.
  • the larger the value of j the more instantaneously the ERC changes, but the greater the error.
  • the value of "hi" is small, it takes more time to change the ERQ, although it is accurate. Keep in mind that it can be set arbitrarily.
  • w is a decreasing function of the total input bandwidth of the transmission line or route shared by the connection. Specifically, the transmission path or route function of the total bandwidth B al l and the total input bandwidth B use connection is shared
  • p 2 is a constant for preventing the denominator from becoming zero
  • Pi is a correction constant for p 2
  • P 3 is a constant for setting the amplitude.
  • the transmission path shared by the connection is a function of the total input bandwidth Buse of the route.
  • p 4 is a positive constant for setting the amplitude
  • p 5 is a constant Me another correction.
  • the request rate of each connection is not clear, if the terminal is transmitting at a certain percentage or more of the current allowable transmission rate, the maximum possible allowable transmission rate for that connection is calculated as the request rate. In other cases, the minimum possible transmission rate should be considered as the requested rate.
  • connection table consisting of records such as tokens, cell intervals, pointers to cell buffers, etc. using the connection identifier as an address, and a pointer and a cell itself indicating the order relation between each entry are stored.
  • a cell buffer consisting of records such as fields to be held, a pointer indicating the order between each entry, a simultaneous arrival connection list consisting of records such as connection identifiers, and a pointer to the simultaneous arrival connection list and time.
  • Scheduling table and schedule to be kept as a pair It has a timer that indicates the processing target of the Euling table and a timer that indicates the current time.
  • a list is formed for each connection in the cell buffer, and the head and tail addresses of the list are registered in the connection table, and cell arrival Each time, the cell is added to the corresponding connection list.If there is a token, transfer scheduling is performed at that time.
  • the simultaneous arrival connection list contains a list of connection identifiers of cells to be read at the same time. The cells of the connection are read out sequentially from the address indicated by the message that indicates the processing target of the scheduling table, and the cells of the connection are read out in the order as scheduled, and after reading, the connection cells are read out.
  • Control for guaranteeing a predetermined cell interval for each application can also be performed.
  • the memory capacity can be used efficiently by using the common buffer as the cell buffer, an increase in the amount of hardware due to an increase in the number of connections can be suppressed.
  • the number of cells to be discarded can be reduced. Therefore, an ATM communication network with high throughput can be realized.
  • the control means includes an input terminal from which a cell stream arrives, a cell buffer for temporarily storing the arriving cells, and a traffic shaving unit for reading cells from the cell buffer in accordance with a designated cell transmission interval. And a connection table that holds connection information including the cell transmission interval information (Int) using a connection identifier (VPI ZVCI) as an address, and the cell buffer includes a plurality of cells each containing a cell.
  • the configuration may include a memory area and a pointer area indicating a pointer value (P tr) for associating the memory area with the connection table.
  • connection information may include a pointer value of the memory area in which a head and an end of a cell having the same connection identifier corresponding to a connection identifier are stored.
  • a plurality of cells stored in the cell buffer are chained by the pointer value. It is better to configure. Cells are read from the cell buffer in the order linked by this chain according to the designated cell transmission interval.
  • the connection information may include a token (T k) indicating whether or not to execute transmission scheduling after the arrival of the last cell of the connection.
  • T k a token
  • the apparatus further comprises means for holding a heading value and a tailing value of an empty memory area of the cell buffer.
  • a configuration may also be provided that includes a timer for measuring the current time and means for scheduling the cell transmission schedule according to the timer.
  • the scheduling means includes: when a plurality of cells arrive almost at the same time and the plurality of scheduled cell transmission times overlap, the scheduling is performed such that the overlapping scheduled cell transmission times are sequentially shifted and transmitted. Can also be provided. As a result, multiple cells arriving at almost the same time and having the same scheduled cell transmission time can be adjusted for all cells without discarding any of the cells. Since the cells can be transmitted, the cell discard rate can be reduced.
  • the scheduling means may include a virtual timer separately for the plurality of cells having the same scheduled cell transmission time, the timer being configured to stop timing until transmission of all cells is completed. You can also.
  • a memory area for accommodating the connection identifier information for a plurality of connections having the same scheduled cell transmission time, a boyne area provided for the memory area and indicating a pointer value assigned to the memory area; And a means for holding a leading pointer value and a trailing void value of an empty memory area of the simultaneous arrival connection list.
  • the means for scheduling may include a means for displaying a plurality of scheduled cell transmission times in advance.
  • the number of stored cells for each connection May be provided.
  • the connection information may include priority information on the cell transmission order.
  • control unit includes a unit that measures a cell flow rate, a unit that compares the measured cell flow rate with a threshold, and a restriction information including a cell flow restriction rate according to the comparison result.
  • a table for holding cell transmission speeds of a plurality of cell sources, and a multiplier for multiplying the regulation rate and the cell transmission speed, wherein the means for notifying the communication terminal serving as the originating terminal includes:
  • the configuration may be such that the value of the regulated cell transmission rate is notified.
  • the calling terminal can receive the cell transmission speed as the restriction information, so that the communication terminal does not need to calculate the cell transmission speed from the restriction rate.
  • a cell buffer for temporarily storing cells may be provided, and the measuring unit may be configured to measure the cell flow rate from the number of cells stored in the cell buffer.
  • the means for comparing may include a means for observing a change in the comparison result over a certain period of time.
  • a plurality of the regulation rates are set (R, R ', R ⁇ ), and the plurality of regulation rates are set in a stepwise manner according to the observation result of the means for observing the change. It can also be applied to
  • the plurality of regulation rates R, R ', R "at this time are respectively
  • R ' R / 1 (A 1> ⁇ 0> 1)
  • the average cell loss rate is calculated from the peak speed and the average speed of all the set connections, and the sum of the average speeds of all the connections divided by the link capacity is used as the first safety factor. Divided by the average speed as the second safety factor, the first safety factor and the second safety factor multiplied by the average cell loss as the cell loss rate for each connection, It may be controlled so that the connection request of the connection is accepted only when the largest cell loss of the cell satisfies a certain reference value.
  • the cell loss rate CLRi for call type i is strictly given by Equation 1.
  • the term x / y indicates the ratio of call type i to the overflow when the cell rate from all connections exceeds the VP bandwidth.
  • the denominator is C at the minimum
  • the numerator is ri because the numerator is at the maximum when the connection in question is at the maximum.
  • XZy ⁇ r! Therefore, (z—c) + dx dz
  • Equation 2 Equation 2
  • Equation 2 is derived as a safe approximation of the cell loss rate of call type i.
  • Equation 1 requires a convolution operation for each call type, and as the number of call types increases, enormous calculations are required when calculating the cell loss rate for each call type by CAC.
  • the convolution operation needs to be performed only once to find the average cell loss rate CL RAVE , but the cell loss rate for each call type is safe to the average cell loss rate. Since it is only necessary to multiply by a coefficient, the calculation can be greatly reduced compared to the conventional method. In particular, the greater the number of call types in a multimedia environment, the more significant the effect obtained by this control means.
  • control means includes means for judging whether or not to accept the connection according to the cell loss rate for the connection request from the communication terminal.
  • This judgment means is means for calculating the cell loss rate CLRi of the i-th group. And means for permitting connection acceptance of a group satisfying the cell loss rate CLRi.
  • the means for calculating the cell loss rate CLRi classifies the plurality of connection requests into i groups according to the peak speed and the average speed for the plurality of connection requests, and calculates an average for all of the plurality of connection requests.
  • the cell loss rate is CLR AVE
  • the sum of the average rates is a all
  • the VP bandwidth is c
  • the peak rate of group i is ri
  • the average rate is a
  • the cell loss rate CLRi of the i-th group is
  • Multiple cells scheduled in the same slot (time) can be transferred.
  • the throughput of the ATM communication network can be improved.
  • the congestion state can be quickly reduced.
  • the responsiveness of CAC can be improved by calculating the cell loss ratio for each call type with a simple calculation. There is an effect that smooth call admission control can be performed.
  • FIG. 1 is an overall configuration diagram of the first embodiment of the present invention.
  • FIG. 2 is a block diagram of a main part of an exchange accommodating a communication terminal on the calling side.
  • Fig. 3 is a block diagram of the exchange that relays and the exchange that accommodates the destination communication terminals.
  • FIG. 4 is a flowchart showing the operation of the exchange accommodating the communication terminal on the calling side.
  • FIG. 5 is a configuration diagram of a main part of an ATM communication network according to a second embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a band use state before the control of the second embodiment of the present invention is performed in the ATM communication network configuration.
  • FIG. 7 is a diagram showing the operation of the second embodiment of the present invention and a change in the used bandwidth amount due to the operation.
  • FIG. 8 is a flowchart showing the operation of the exchange in the second embodiment of the present invention.
  • FIG. 9 is a configuration diagram of a main part of an ATM communication network according to a third embodiment of the present invention.
  • FIG. 10 is a diagram showing the used bandwidth amount of each communication terminal at a certain time.
  • FIG. 11 is a diagram showing the relationship between the maximum cell transmission rate and the minimum cell transmission rate of the transmission rate from the originating communication terminal and the threshold value in the third embodiment of the present invention.
  • FIG. 12 is a diagram showing the relationship between the available bandwidth and the threshold in the third embodiment of the present invention.
  • FIG. 13 is a flowchart of an algorithm for notifying congestion to each communication terminal by the exchange.
  • FIG. 14 is a diagram showing the relationship between the amount of available bandwidth, the transmission rate of the communication terminal, and the content of notification of congestion at that time.
  • FIG. 15 is an overall configuration diagram of an ATM communication network according to a fourth embodiment of the present invention.
  • FIG. 16 is a diagram showing the relationship between the available bandwidth and the threshold in the fourth embodiment of the present invention.
  • FIG. 17 is a flowchart of an algorithm for controlling the transmission rate of each communication terminal on the calling side by the exchange.
  • FIG. 18 is a diagram showing the relationship between the maximum value of the buffer usage, the transmission rate of the communication terminal on the calling side, and the content of notification of congestion at that time.
  • FIG. 19 is an overall configuration diagram of the sixth embodiment of the present invention.
  • FIG. 20 is a diagram showing the flow of control by the exchange.
  • FIG. 21 is an overall configuration diagram of the seventh embodiment of the present invention.
  • FIG. 22 is an overall configuration diagram of an ATM communication network according to an eighth embodiment of the present invention.
  • FIG. 23 is a block diagram of a dynamic rate control device according to an eighth embodiment of the present invention.
  • FIG. 24 is a configuration diagram of a main part of the eighth embodiment of the present invention.
  • FIG. 25 is a diagram showing a cell write operation to a cell buffer.
  • FIG. 26 is a diagram showing the connection list rearrangement processing.
  • FIG. 27 is a diagram showing the connection list rearrangement processing.
  • FIG. 28 is a diagram illustrating an operation of extracting a cell from the cell buffer.
  • FIG. 29 is a configuration diagram of a main part of the ninth embodiment of the present invention.
  • FIG. 30 is a configuration diagram of a main part of a tenth embodiment of the present invention.
  • FIG. 31 is a configuration diagram of a main part of the eleventh embodiment of the present invention.
  • Figure 32 shows the operation of writing the connection identifier to the simultaneous arrival connection list.
  • FIG. 33 shows the operation of writing the connection identifier into the simultaneous arrival connection list.
  • FIG. 34 is a diagram showing an operation of extracting the connection identifier from the simultaneous arrival connection list.
  • FIG. 35 is a flowchart showing the operation of the eleventh embodiment of the present invention.
  • FIG. 36 is a configuration diagram of a main part of a twelfth embodiment of the present invention.
  • FIG. 37 is a block diagram of a thirteenth embodiment of the present invention.
  • FIG. 38 is a configuration diagram of a main part of the fourteenth embodiment of the present invention.
  • FIG. 39 is a block diagram of a dynamic rate control device according to a fifteenth embodiment of the present invention.
  • FIG. 40 is a flowchart showing the operation of the dynamic rate control device according to the fifteenth embodiment of the present invention.
  • FIG. 41 is a diagram showing the operation of the fifteenth embodiment of the present invention in relation to the cell flow rate; I and time.
  • FIG. 42 is a diagram showing the operation of the fifteenth embodiment of the present invention in relation to the cell flow rate ⁇ and time.
  • FIG. 43 is a block diagram of a dynamic rate control device according to a sixteenth embodiment of the present invention.
  • FIG. 44 is another block diagram of the dynamic rate control device of the sixteenth embodiment of the present invention.
  • ⁇ FIG. 45 is a block diagram of the dynamic rate control device of the seventeenth embodiment of the present invention.
  • FIG. 46 is a block diagram of a dynamic rate control device according to an eighteenth embodiment of the present invention.
  • FIG. 47 is a flowchart showing the operation of the dynamic rate control device according to the eighteenth embodiment of the present invention.
  • FIG. 48 is a diagram for explaining the dynamic rate control device according to the nineteenth embodiment of the present invention.
  • FIG. 49 is a flowchart showing the operation of the congestion detection unit and the congestion control unit in the eighteenth embodiment of the present invention.
  • FIG. 50 is a flowchart showing the operation of the dynamic rate control device according to the twentieth embodiment of the present invention.
  • FIG. 51 is a diagram showing a call type management table.
  • FIG. 52 is an overall configuration diagram of a conventional ATM communication network.
  • FIG. 53 is a configuration diagram of the RM cell.
  • FIG. 54 is a flowchart showing the operation of the communication terminal on the calling side.
  • Figure 55 is a flowchart showing the operation of the destination local exchange and transit exchange.
  • Figure 56 is a flowchart showing the operation of the destination local exchange and transit exchange.
  • FIG. 57 is a flowchart showing the operation of the destination communication terminal.
  • FIG. 58 is a diagram for explaining control of a cell transmission rate in a conventional ATM communication network.
  • FIG. 59 is a diagram showing a control flow in the exchange.
  • FIG. 60 is a diagram showing a control flow in the exchange.
  • FIG. 61 is a diagram showing a control flow in the exchange.
  • Fig. 62 is a diagram showing the flow of control of the exchange when it is determined that there is no congestion.
  • C Fig. 63 is a diagram showing the call type cell loss rate and the number of connected VCs in a multiple environment.
  • FIG. 1 is an overall configuration diagram of the first embodiment of the present invention.
  • Fig. 2 is a block diagram of the main part of the exchange accommodating the communication terminal on the calling side.
  • Fig. 3 is a block diagram of the exchange that carries out the relay and the exchange that accommodates the destination communication terminal.
  • 50-1 and 50-2 are originating communication terminals
  • 20 is an exchange accommodating originating communication terminals 50-1 and 50-2
  • 3 is an exchange for relaying
  • 4 0 is an exchange accommodating the destination communication terminal
  • 5 is a transmission line
  • 60-1 and 60-2 are destination communication terminals.
  • 10 is a route information collecting unit
  • 12 is a transmission rate calculation control unit.
  • FIG. 1 is an overall configuration diagram of the first embodiment of the present invention.
  • Fig. 2 is a block diagram of the main part of the exchange accommodating the communication terminal on the calling side.
  • Fig. 3 is a block diagram of the exchange that carries out the relay and the exchange that accommodates the destination communication terminal.
  • 50-1 and 50-2
  • reference numeral 14 denotes a route information transmitting unit.
  • the present invention relates to a dynamic rate control device, in which communication terminals 50-11 and 50-2 are stored, and based on a request from one-third of the communication terminals 50-11 or 50-12.
  • a dynamic rate control device provided with means for setting a VP for one of the communication terminals 50-1 or 50-2 in the exchanges 20, 30, 40.
  • the means for setting this VP are provided in each of the exchanges 20, 30, 40, and the communication terminals 50-1, 50-22, 60-1, and 60-2. However, it is not shown because it is not a main part of the present invention.
  • the feature of the present invention is that a route including the VP free band information that is set once by designating the transmission rate for one communication terminal 50-1 or 50-2.
  • a route information collecting unit 10 as a means for collecting information; a means for holding a requested transmission rate of one communication terminal 500-1 or 50-12; and a virtual path set once based on the route information.
  • a transmission rate calculation control unit 12 as a control means for dynamically controlling the transmission rate as dynamically as possible to the requested transmission rate of the terminal and fairly controlling a plurality of communication terminals having connection requests. There.
  • the transmission rate calculation control unit 12 includes means for calculating and setting the cell transmission rates allowed for the communication terminals 50-1 and 50-12.
  • the originating communication terminals 50-1 and 50-2 communicate based on the ABR protocol.
  • the exchange 20 is capable of connecting to the originating communication terminals 50-1 and 50-2 by emulating the ABR protocol.
  • the exchanges 30 and 40 and the destination communication terminal 60-60-2 do not necessarily need to operate based on the ABR protocol. However, exchanges 30 and 40 must notify exchange 20 of the use status of the route as route information when there is a periodic or state change. Calculate the current available bandwidth based on the usage status notified to the exchange 20 and / or the transmission status of each communication terminal 50-1, 50-2, or both.
  • the operation of the exchange 20 when there is a request from the communication terminal 50-1 or 50-2, which starts transmission via, will be described with reference to the flowchart of FIG. FIG.
  • FIG. 4 is a flowchart showing the operation of the exchange 20 accommodating the communication terminals 50-1 and 50-2 on the calling side.
  • New transmission from communication terminal 5 0-1 or 5 0-2 When a transmission start request is received (S70), a value obtained by multiplying the available bandwidth by a constant C (0 ⁇ C ⁇ 1) is set as the initial transmission rate ICR (S71).
  • the constant C is a parameter set to prevent the information at the time of acceptance from being out of the current state and setting an incorrect transmission rate.
  • the ICR is smaller than the minimum transmission rate MCR (Minimimi Cell Rate) required from the originating communication terminal 50-50 (S 72), it is dangerous to accept it as it is, so the originating terminal It is necessary to perform negotiation (negotiation) again with the communication terminals 501-1 and 50-2, and it is not accepted in this state (S73). If the ICR is equal to or larger than the MCR (S72), transmission by the ICR is permitted (S74). According to the first embodiment of the present invention, it is instantaneously determined whether or not a transmission start request from a new calling communication terminal 50-1 or 50-2 is permitted, and the accepted calling communication terminal 50-1 is accepted. , 50-2 powers, etc. can be allowed to send on ICR.
  • MCR Minimum Transmission Rate
  • FIG. 5 is a configuration diagram of a main part of the ATM communication network according to the second embodiment of the present invention, where 50-1, 50-2.50-3 are originating communication terminals that perform communication according to the ABR protocol, and 2 is each of the communication terminals.
  • FIG. 6 is a diagram showing a band use state before the control of the second embodiment of the present invention is applied in the ATM communication network configuration of FIG. In FIG.
  • Wt 0 ta 1 is the total bandwidth of the route
  • Wa is the free bandwidth of the route
  • W 1 is the used communication terminal 50-1-1
  • W 2 is the calling communication terminal 50.
  • -2 indicates the used bandwidth
  • W3 indicates the used bandwidth of the calling communication terminal 50-3.
  • the originating communication terminal 50-3 after transmitting the first RM cell at time t0, the originating communication terminal 50-3 immediately starts transmitting data overnight at the initial transmission rate ICR indicated by W3.
  • FIG. 7 is a diagram showing the operation of the second embodiment of the present invention and a change in the used bandwidth amount due to the operation.
  • the value obtained by multiplying the available bandwidth Wa by a constant C (0 ⁇ C ⁇ 1)
  • an RM cell notifying that no congestion has occurred in the exchange 20 is sent.
  • the originating communication terminal 50-3 receives the RM cell at time t1, and increases the transmission rate.
  • the exchange 20 further generates and transmits an RM cell.
  • FIG. 8 is a flowchart showing the operation of the exchange 20 in the second embodiment of the present invention.
  • the exchange 20 does not congest the communication terminal 50-1-53 of the caller. (S83), and the communication terminals 50-1 to 50-3 on the calling side increase the transmission rate by the unit increment.
  • the unit increment is set in advance, and the unit increment is determined only by the exchange 20.
  • the transmission rate of the originating communication terminal 50-1 to 50-3 can be increased step by step at a high speed in order to increase the number at once.
  • FIG. 9 is a configuration diagram of a main part of an ATM communication network according to a third embodiment of the present invention.
  • originating communication terminals 50-1 to 50-4 are originating communication terminals that communicate according to the ABR protocol
  • 2 is an exchange that emulates the ABR protocol for each communication terminal
  • 3 Is part of the route shared by each communication terminal.
  • Figure 10 is a diagram showing the bandwidth used by each communication terminal at a certain point in time, where Wa is the free bandwidth on the route and Wl, W2, W3, and W4 are the calling side Indicates the amount of bandwidth used by the communication terminals 50-1 to 50-4.
  • Wa is the free bandwidth on the route
  • Wl, W2, W3, and W4 are the calling side Indicates the amount of bandwidth used by the communication terminals 50-1 to 50-4.
  • FIG. 10 is a diagram showing the relationship between the amount of free space and the threshold value Wth k Wth 2. Wth 3 in the third embodiment of the present invention.
  • FIG. 13 is a flowchart of an algorithm for performing notification of radiation to each communication terminal by the exchange 20.
  • FIG. 14 is a diagram showing the relationship between the amount of available bandwidth, the transmission rate of the communication terminal, and the content of notification of congestion at that time.
  • the exchange 20 monitors the amount of available bandwidth and compares the value with the threshold values Wth1, Wth2, and Wth3. When the vacant band amount Wa is smaller than the threshold value Wth1 (S91), the congestion is notified to all the communication terminals 50-1-50-4 on the calling side (S92).
  • the communication terminal having the transmission rate equal to or greater than the threshold value Rth1 is notified of congestion (S94).
  • the available bandwidth Wa is equal to or larger than the threshold Wth2 and smaller than the threshold Wth3 (S95)
  • the communication terminal having the transmission rate equal to or lower than Rth2 is notified of no congestion (S96).
  • the available bandwidth W a is equal to or greater than the threshold value Wth 3 (S97)
  • all the communication terminals 50-1-50-4 on the calling side are notified of no congestion (S98). Then, as shown in FIG.
  • the congestion information is transmitted to the communication terminals 50-1 to 50-4 on each calling side by generating and transmitting RM cells.
  • Each of the communication terminals 50-1 to 50-4 on the calling side has an opportunity to increase the transmission rate when receiving notification of no congestion according to the ABR protocol. Conversely, if it is notified that there is congestion, it lowers the transmission rate.
  • the timing of notifying congestion to the communication terminals 50-1 to 50-4 on the calling side differs according to the transmission rate and the available bandwidth before the change.
  • the transmission rate is increased at a high speed.
  • the bandwidth starts to run short, the transmission rate is reduced, although the rate is high. This has the effect of lowering the overall transmission rate. In either case, this function can be realized without the RM cell going back and forth between the originating and terminating communication terminals.
  • FIG. 15 is an overall configuration diagram of an ATM communication network according to a fourth embodiment of the present invention.
  • 5 0—1 to 5 0—4 is the originating communication terminal
  • 2 is the exchange that accommodates the originating communication terminals 50-1 through 50-4
  • 30 is the exchange that relays
  • 40 is the destination exchange.
  • 5 is a transmission line
  • 60-1 to 60-4 are destination communication terminals.
  • the configuration of the fourth embodiment of the present invention will be described with reference to FIG.
  • the communication terminals 50-1 to 50-4 on the calling side perform communication based on the ABR protocol.
  • the exchange 20 enables connection by emulating the ABR protocol to the communication terminal 50-1-50-50-4 on the calling side.
  • the exchanges 30, 40 and the destination communication terminal 60-1-6-0-4 do not necessarily need to operate based on the ABR protocol.
  • the exchanges 30 and 40 notify the number of cells stored in the respective queue buffers when the originating exchange 20 changes periodically or when the situation changes.
  • the switch 20 determines the current use status based on the notified queue buffer length and the number of cells stored in the queue buffer of the switch 20.
  • FIG. 11 shows the maximum cell transmission rate (PCR) and the minimum cell transmission rate (MCR) in the fourth embodiment of the present invention, and the thresholds R thl and R ⁇ h 2 and each communication.
  • PCR maximum cell transmission rate
  • MCR minimum cell transmission rate
  • FIG. 11 shows the maximum cell transmission rate (PCR) and the minimum cell transmission rate (MCR) in the fourth embodiment of the present invention, and the thresholds R thl and R ⁇ h 2 and each communication.
  • PCR maximum cell transmission rate
  • MCR minimum cell transmission rate
  • FIG. 17 is a flowchart of an algorithm for controlling the transmission rate of each communication terminal 50-1-50-4 on each calling side by the exchange 20.
  • Ou This is the largest value among the buffer usages notified to the exchange 20.
  • the exchange 20 compares Q u with threshold values Q thl, Q th2, and Q th3. When the maximum value Qu of the buffer usage is equal to or larger than the threshold value Qth3 (S101), congestion is notified to all the communication terminals 50-1 to 50-4 on the calling side (S102).
  • the congestion information is transmitted to each calling communication terminal 50-1-50-4 by generating and transmitting an RM cell.
  • Each of the communication terminals 50-1 to 50-4 on the calling side has an opportunity to increase the transmission rate when notified of no congestion according to the ABR protocol. Conversely, when receiving notification that there is congestion, lower the transmission rate.
  • the timing at which congestion is notified to the communication terminals 50-1 to 50-4 on the calling side differs according to the transmission rate before the change and the buffer length used in common.
  • the effect is to shift the overall transmission rate to a higher transmission rate, and the variation in the transmission rate is reduced, resulting in fairness among the originating communication terminals 50-1-50-4.
  • This has the effect of increasing the transmission rate at a high speed, especially for low transmission rates.
  • the bandwidth or buffer length starts to run short, the transmission rate is reduced while the transmission rate is high, and if the bandwidth or buffer length runs short, the overall transmission rate is lowered. In any case, this function can be realized without the RM cell going back and forth between the communication terminals that send and receive.
  • the exchanges 30 and 40 and the destination communication terminal 60-1-6-0-4 voluntarily use the RM cell. May be sent.
  • the RM cell describes that there is no congestion
  • the exchange 20 performs the operation of lowering the transmission rate of the communication terminal 50-1-50-4 on the calling side, it returns.
  • the opposite operation is required by the incoming RM cell. Therefore, in the fifth embodiment of the present invention, even if RM cells for the communication terminals 50-1 to 50-4 on the originating side arrive from other sources, they are discarded in the exchange 20. By doing so, it is possible to prevent erroneous transmission rate control by an RM cell having erroneous congestion information.
  • FIG. 19 is an overall configuration diagram of the sixth embodiment of the present invention.
  • the description focuses on the connection 70-0-1 to 70-3 between the communication terminals 50-1 to 50-13 sharing the transmission path 5 and the communication terminals 60-1 to 60-3.
  • the communication terminals 50-1 and 60-1; 50-2 and 60-2; 50-3 and 40 are exchanges 20 to 40 connected to each other via the transmission line 5.
  • the exchanges 20 to 40 controls a switching unit 301 that performs circuit switching, controls this switching unit 301, and controls the switching units 310 to 1 to 70 to 3 on the originating side.
  • the control unit 302 that collects information on the entire bandwidth and the entire input bandwidth of the line 5 and the number of connections that share the transmission line 5, and a memory that holds the information collected by the control unit 302 Based on the information held in the storage unit 303 and the storage unit 303, an acceptable transmission rate to be notified to the originating communication terminal 50-1-500-13 is calculated for each connection. And an operation unit 304.
  • the originating communication terminals 50-1 to 50-3 generate control cells at intervals of a fixed number of cells, and transmit the cells to the destination communication terminals 60-1-60-3.
  • the control cell is provided with a CCR field for notifying the allowable transmission rate of each connection 70-1-70-3 and an ER field for notifying the acceptable transmission rate.
  • FIG. 20 is a diagram showing the flow of control by the exchange, showing the calculation of an acceptable transmission rate.
  • the exchange 30 will be described as an example.
  • the maximum and minimum allowable transmission rates are determined by negotiation with the communication network at the time of call connection.
  • the maximum value is represented by PCRj (Peak Cell Rate), and the minimum value is represented by MCR ”(Minimum Cell Rate).
  • switch 30 actual transmission rate and the allowable transmission rate to each connection 70 _ 1 70 - 3, i.e. ccr, a rate,, the ccr 2 and rate 2, ccr 3 and rate 3
  • the actual transmission rate ratej is more than a certain percentage of the allowable transmission rate, that is, rat ej ⁇ cc rj 'G (G is a constant of 0 or more and 1 or less) (S 1 1 1)
  • the allowable transmission rate is less than a certain ratio
  • the requested cell rate of the connection is regarded as MCRj (S112).
  • the formula for updating ERQj is the variance of the ratio of the allowed transmission rate to the requested rate of each connection 70-1 to 70-3.
  • ccrj and r are the allowable transmission rate and request rate of connection j, respectively
  • n is the data transmission connection 70 1 1 to 70
  • the number 3 hi and j are weight functions
  • sign ⁇ is a function representing the sign of the value in ⁇ .
  • a positive constant value that differs for each connection 70-1 to 70-3. w is reduced less a function of the total input bandwidth of the transmission path connection 70- 1 ⁇ 70- 3 to share, for example, the connection 70 to 1 to 70 - 3 full and total bandwidth B al l of the transmission line 5 to be shared Function with input bandwidth B use
  • p 2 is a constant for preventing the denominator from becoming zero
  • p is a correction constant for p 2
  • p 3 is a constant for setting the swing width
  • w is a function of the total input bandwidth B use of the transmission line 5 shared by the connection.
  • the exchange 30 further receives the newly calculated acceptable transmission rate from the acceptable transmission rate written in the ER field of the control cell returned by the destination communication terminal 60-1 to 60-3.
  • the transmission rate is low, the ER field is rewritten to the newly calculated value; otherwise, the control cell is relayed next without rewriting, and the caller's communication terminal 50-1-50-3 is notified. I do.
  • the communication terminal on the originating side of the connection j generates a control cell, it is assumed that "CR of connection j" is written in the ER field.
  • FIG. 21 is an overall configuration diagram of the seventh embodiment of the present invention. Only the exchange 20 calculates the acceptable transmission rate.
  • the exchanges 20 to 30 connected to each other via the transmission line 5 and the connections 70-1 to 70-3 via these exchanges 20 to 30 are connected to each other and are variable. Equipped with communication terminals 50-1 to 50-3 and 60-1 to 60-3 for transmitting and receiving information at the transmission rate, and directly accommodates communication terminals 50-1 to 50-3 When the communication terminal 50 0-1 to 50-3 accommodated on the exchange 20 becomes the originating side, the exchange rate regarding the transmission rate acceptable for the communication terminal 50-1 to 50-3 is determined.
  • a control unit 302 for notifying information is provided.
  • the exchange 20 has a plurality of connections that share a route with the communication terminals 70-1 through 70-3 that have the communication terminals 50-1 through 50-3 accommodated therein.
  • a storage unit that collects and retains information on the allowable transmission rate and actual transmission rate allowed for the network, the allowable route bandwidth and total input bandwidth, and the number of connections sharing the route.
  • 3 and an arithmetic unit 304 that calculates an acceptable transmission rate to be notified to the terminal for each connection based on the information held in the storage unit 303.
  • the exchange 20 rewrites the control cell arriving from the communication terminal 50-1-50-13 with an acceptable transmission rate newly calculated by the exchange 20 and returns the original Return to communication terminal 5 0—1 to 5 0—3. As a result, an acceptable transmission rate is notified to the communication terminal 50-1-50-3 on the calling side.
  • an acceptable transmission rate is notified to the communication terminals 50-1 to 50-3, but the communication terminals 50-1 to 50-13 raise or lower the allowable transmission rate.
  • the communication terminal 50-1-50-13 can also increase or decrease its own allowable transmission rate according to a predetermined calculation formula. For example, if the acceptable transmission rate newly calculated by the exchange becomes smaller than the current allowable transmission rate used in the calculation, congestion may occur in the control cell returned by the destination communication terminal. It writes the fact and notifies the calling communication terminal of it. The originating communication terminal may reduce the allowable transmission rate automatically when congestion is notified.
  • FIG. 22 is an overall configuration diagram of the ATM communication network according to the eighth embodiment of the present invention.
  • FIG. 23 is a block diagram of a dynamic rate control device according to an eighth embodiment of the present invention.
  • FIG. 24 is a configuration diagram of a main part of the eighth embodiment of the present invention.
  • the eighth embodiment of the present invention is provided in an ATM communication network as shown in FIG. 22, and as shown in FIG. 23, as shown in FIG. 23, an input terminal IN from which a cell stream arrives, and a cell for temporarily storing the arrived cell.
  • This is a dynamic rate control device including a buffer CB and a traffic shaving unit TS that reads cells from the cell buffer CB in accordance with a designated cell transmission interval.
  • a feature of the present invention is that, as shown in FIG. 24, a connection table CT holding connection information including a connection identifier (VPI / VCI) as an address and the cell transmission interval Int is used.
  • the cell buffer CB includes a plurality of memory areas C e11 in which cells are accommodated one by one, a pointer area P tr indicating a pointer value corresponding to the memory area C e11 and the connection table CT, and Is included.
  • the eighth embodiment of the present invention provides a common cell buffer CB and a cell buffer CB for storing cells of all connections, a cell transmission interval Int for each connection stored in the cell buffer CB, and a cell buffer CB of a chain in the order of arrival of cells. It consists of a connection table CT having the first and last addresses in the table, and reads the cells of each connection from the cell buffer CB according to a predetermined scheduling rule.
  • the connection table CT is a table holding information for each connection, and has a token Tk for each c connection, a cell transmission interval Int, a pointer head head, and a pointer tile tai1.
  • the token Tk indicates that the cell arriving after the connection has the right to be transferred at the time of arrival.
  • the cell transmission interval Int is the c pointer indicating the minimum cell transmission interval Int that must be held by the connection.
  • the head and the pointer tilt tai 1 are the link relation to the cell buffer CB (Fig. 24 (1) ), (2) arrow, and holds the address where the cell at the head (arrow (1)) and the end (arrow (2)) of the connection is held.
  • FIG. 25 is a diagram showing a cell write operation to the cell buffer CB.
  • Fig. 25 shows the chain of empty cells in the cell buffer. The start address of the empty cell chain is assigned to the arrival cell by replacing the CB free pointer.
  • FIGS. 26 and 27 show the process of rearranging the connection list at this time.
  • FIG. 26 and FIG. 27 show the connection list rearrangement processing.
  • the address of the cell arriving at the end of the cell chain of the connection in the cell buffer CB is added. As shown in Fig. 27, if there is no chain in cell buffer CB, a new chain is created.
  • FIG. 2 8 shows a case of taking a cell a certain connection from the cell buffer CB 2 8 is a diagram showing an operation of taking out the cell from the cell buffer CB.
  • Figure 28 Extracts the first cell in the cell chain of the corresponding connection in the cell buffer CB and replaces the pointer head.
  • the cell buffer CB is a common buffer for cells of all connections, and logically configures a FIFO queue for each connection.
  • the CB free pointer holds the addresses of the head (arrow (3)) and the end (arrow (4)) of the empty area of the cell buffer CB.
  • Cell buffer CB and CB free pointer are used in combination.
  • the cell buffer CB is composed of a memory area Ce11 holding the contents of the cell and a pointer area Ptr for instructing the order of reading the cells for each connection as one entry.
  • a list of cells for each connection is logically configured according to the reading order indicated by the pointer.
  • the cell buffer CB is addressed at the address (arrow (1)) indicated by the head head of the connection in the connection table CT, and the address of the cell buffer CB at that address is determined.
  • the connection table CT holds the last address of the list of the connection in the cell buffer CB as link information in the pointer tile t ai1 (arrow (2)).
  • the free area is also logically configured as a list, as in the case of each connection.
  • the start and end addresses of the free area of the cell buffer CB are stored in the pointer head head (arrow (3)) of the CB free pointer and the pointer tile tai1 (arrow (4)). That is, the pointer head head indicates the address to be used next as an empty area (arrow (3)), and the pointer of the address in the cell buffer CB indicates the address to be used as the next empty area.
  • the CB free pointer holds the address at the end of the list of free areas held in the cell buffer CB as link information in the pointer tile t ai1 (arrow (4)).
  • FIG. 29 shows a ninth embodiment of the present invention.
  • FIG. The ninth embodiment of the present invention includes, in addition to the configuration of the eighth embodiment of the present invention, a scheduling table ST having a correspondence between time and connection and a timer Tim.
  • the timer Tim is a timer indicating the current time.
  • the cell of the connection described in the scheduling table ST is read.
  • the read time of the cell next to the connection is scheduled. That is, the connection is described in the entry of the scheduling table ST after the current time indicated by the timer Tim by the cell interval of the connection (described in the cell transmission interval Int field of the connection table CT).
  • FIG. 30 is a configuration diagram of a main part of a tenth embodiment of the present invention.
  • the tenth embodiment of the present invention has a plurality of fields for allocating a plurality of connections at the same time to the scheduling table ST of the ninth embodiment of the present invention.
  • a virtual timer HT Im indicating a virtual time is provided.
  • the value of the virtual timer HT im is used to indicate a predetermined address of the scheduling table ST. Evening time T im always indicates the current time accurately, while virtual reading time HT im is read while reading a plurality of scheduled cells from cell buffer CB so that scheduling uling table ST reads out at the same time. Keeps showing the same time.
  • FIG. 31 is a configuration diagram of a main part of the eleventh embodiment of the present invention.
  • the head and the end of the list of free addresses of the connection table CT, the cell buffer CB, and the cell buffer CB are used.
  • CB free pointer that holds the address, the scheduling table ST, the timer Tim that indicates the current time, the virtual timer HT im that indicates the virtual time, the simultaneous arrival connection list SL, and the beginning and end of the list of free addresses in the simultaneous arrival connection list SL It consists of an SL free pointer that holds the address of the SL.
  • the scheduling table ST is a table for scheduling cell reading.
  • the scheduling table ST stores a pointer to the simultaneous arrival connection list SL, which is a list that holds connection identifiers scheduled to be read from the cell buffer CB at the same time, and a head, a boyne till tai 1 and a time. It is managed as a pair.
  • the pointer head head and pointer 1 show the link relationship to the simultaneous arrival connection list SL (arrows (20) and (21) in Fig. 31), and read from the cell buffer CB at that time. Hold the identifiers of the leading and trailing cells.
  • a virtual timer HT Im indicating a virtual time is provided in addition to a timer Tim indicating the current time.
  • the value of the virtual timer HT im is used to indicate a predetermined address of the scheduling table ST.
  • the virtual timer HT im is the same while reading from the cell buffer CB a plurality of cells scheduled so that the simultaneous arrival connection list SL reads at the same time.
  • the simultaneous arrival list SL forms a chain of scheduled connections that will be read from the cell buffer CB at the same time. This makes it possible to flexibly increase the number of connections scheduled at the same time.
  • the configuration of the chain is the same as that of configuring the FIF queue for each connection with a common cell buffer CB. That is, the SL free pointer holds the start and end addresses of the free area of the simultaneous arrival connection list SL.
  • C simultaneous arrival connectionist Chillon list SL used in combination simultaneous arrival connectionist Chillon list SL and SL free pointer is a list which holds the connection identifier of the cell, the connector to be read from the cell buffer CB the connection identifier and the same time
  • a participant (indicated by (22) and (23) in Fig. 31) for indicating the order relation of the application identifiers is configured as one entry.
  • the simultaneous arrival connection list SL a list of connection identifiers of cells scheduled so as to be logically read out at the same time in the read order specified by the pointer is configured.
  • the simultaneous arrival connection list SL is addressed at the address indicated by the pointer head “head” of the virtual evening image HT im (arrow (20) in FIG. 31), and the simultaneous arrival connection is obtained.
  • the list SL is sequentially read at the address indicated by the busty evening at that address (arrows (22) and (23) in Fig. 31), and the cells scheduled to be read at that time are read. Connection identifiers can be accessed in the order in which they are read.
  • the virtual evening image HT im stores the last address ((21) in FIG. 31) of the corresponding time list on the simultaneous arrival connection list SL as pointer information in the pointer tile tai1.
  • the free area is also logically composed of a list, as in the case of each time.
  • the start and end addresses of the free area of the simultaneous arrival connection list SL are stored in the SL free pointer pointer head ((20) in Fig. 31) and the pointer tail ((21) in Fig. 31). You. That is, the pointer head indicates the address to be used next as an empty area, and the pointer of the address in the simultaneous arrival connection list SL indicates the address to be used as the next empty area.
  • the SL free pointer holds the address at the end of the free area list held in the simultaneous arrival connection list SL in pointer pointer tai 1 ((21) in FIG. 31) as link information.
  • Figures 32 and 33 show the case where the connection identifier of the cell scheduled at a certain time is written in the simultaneous arrival connection list SL.
  • FIGS. 32 and 33 show the operation of writing the connection identifier into the simultaneous arrival connection list SL.
  • Figure 32 shows the case where a newly scheduled connection is added to the beginning and the end of the chain.
  • Figure 34 shows a case where connection identifiers scheduled at a certain time are retrieved from the simultaneous arrival connection list SL.
  • FIG. 34 is a diagram showing an operation of extracting the connection identifier from the simultaneous arrival connection list SL.
  • Fig. 34 shows how the connection identifier is extracted from the beginning of the chain.
  • connection identifiers scheduled at the same time are read out on a first-come, first-served basis.
  • connection identifiers scheduled at the same time are included in the list later as the cell interval is shorter, so that the shorter the cell interval, or conversely, the faster the cell rate, the later the scheduling.
  • connection identifier scheduled at the same time is read out in the LIFO order. In this way, faster connections will be read faster. If the position where the connection identifier is to be incorporated for each connection is determined at the same time, either pointer pointer tai 1 or pointer head in the list of connection identifiers scheduled at the same time, the connection can be classified into two classes. Can be classified as In other words, two classes of connections scheduled at the same time can be created: those scheduled first and those scheduled later.
  • FIG. 35 is a flowchart showing the operation of the eleventh embodiment of the present invention. Determination of the connection from which to read the cell (S122), reading of the cell of the connection (S122), scheduling of reading the cell next to the connection (S122), Processing is performed in the order of writing of the arriving cell to the FIFO queue in the cell buffer CB (S124).
  • Necessary processing upon arrival of a cell is writing of the cell into the cell buffer CB and determining whether or not there is transfer scheduling of the cell.
  • the process of writing a cell into the cell buffer CB differs depending on whether or not the connection list of the cell is already in the cell buffer CB. If the connection list does not exist, a new connection list is first created in the cell buffer CB. Further, the cell is written into the empty area of the cell buffer CB. This procedure has been described in detail with reference to FIG. Next, a new logical relationship of the connection list is created on the cell buffer CB. This procedure is also described in detail with reference to FIGS. 26 and 27.
  • the presence / absence of cell transfer scheduling is determined by whether or not the connection of the cell has the token T k.
  • the connection table CT is searched based on the connection identifier included in the header.
  • the transfer scheduling of the cell is not performed at that time, and the scheduling is performed at the time when the last cell of the connection at that time is transferred. This will be described in detail in the section on cell read processing.
  • addressing is performed using the timer Tim indicating the current time, and the scheduling table is searched. Subsequent processing differs depending on whether or not there are already scheduled connections at that time. If there is no scheduled connection, the following processing is executed, and a list of cells that are to be transferred at the current time indicated by the timer Tim is newly created on the simultaneous arrival connection list SL. . First, the connection identifier is written to an empty area of the simultaneous arrival connection list SL. Next, a new logical relationship is created between the simultaneous arrival connection list SL and the list of cells to be transferred at the current time indicated by the timer Tim. This procedure is as described in detail with reference to FIGS. 32 and 33.
  • the following processing is executed, and the list of cells that are to be transferred at the current time indicated by the timer Im on the simultaneous arrival connection list SL is changed. .
  • the connection identifier is written in an empty area of the simultaneous arrival connection list SL.
  • the logical relationship of the list of cells to be transferred at the current time indicated by the timer Tim on the simultaneous arrival connection list SL is changed. This procedure is also described in detail with reference to FIGS. 32 and 33.
  • the corresponding cell is scheduled to be scheduled at the current time indicated by the timer Tim, and the virtual timer processing the scheduling ring table ST. If the virtual time indicated by HT im is late, the user may want to transfer the cell. In this case, the scheduling table ST is addressed at the time indicated by the virtual timer HTim, and the connection identifier of the cell is added to the head of the list indicated by the pointer head head of the address.
  • the necessary processing for reading a cell is determining the connection to read the cell, reading the cell, and scheduling the next cell.
  • the determination of the connection differs depending on whether or not there is a cell to be transferred at the virtual time indicated by the virtual timer HT im. If there is no cell to be transferred, the virtual timer HT im is advanced by one unit time, and each time, it is checked whether there is a cell to be transferred at that time. The virtual timer HT im advances faster than normal until a cell to be transferred is found. Only for a predetermined time If it cannot be found further, give up reading the cell. To execute this process more efficiently, the concept of a list may be introduced into the scheduling table ST. This will be described in the section on processing performed within one unit time.
  • the subsequent processing is the same as when there is a cell to be transferred. If there is a cell to be transferred, determine the connection to be read at this time. In other words, the connection identifier scheduled at this time is extracted from the simultaneous arrival connection list SL. This procedure has been described in detail with reference to FIG.
  • the cell of the connection is read from the cell buffer CB.
  • the process of reading a cell from the cell buffer CB differs depending on whether or not the cell of the connection is in the cell buffer CB. Access the connection table CT based on the previously determined connection identifier.
  • the cell of the connection becomes the sink buffer CB.
  • only the token Tk of the connection table CT is set, and the cell reading from the cell buffer CB is not executed.
  • the cell of the connection is in the cell buffer CB, the cell is taken out. This processing is as described in detail in the section of the cell buffer CB earlier.
  • the scheduling process of the next cell differs depending on whether or not the token Tk of the connection is set. Access the connection table CT based on the previously determined connection identifier.
  • the scheduling of the connection is performed the next time the cell of the connection arrives. This is as described in detail in the section on the cell arrival processing.
  • the minimum cell interval Int of the connection in the connection table CT is added to the current time counted by the timer Im to transfer the next cell.
  • Schedule the connection as time. In other words, schedule so that Int + T im Addressing the scheduling table ST and adding the connection identifier to the list of connection identifiers of the cells scheduled at the time Int + Tim on the simultaneous arrival connection list SL indicated by the pointer head. This additional processing has been described in detail in the description of the simultaneous arrival connection list SL, and will not be described.
  • the cell transfer scheduling uses a timer Tim indicating the current time instead of the virtual timer HT im, so that the cell transmission interval Int of the connection concerned is more strictly than the predetermined cell transmission interval Int. Note that it does not get smaller. If the fluctuation between cells scheduled at the same time is allowed, the connection can be transferred earlier if scheduling is performed at the time of Int + HT im. Registration in the scheduling table ST is almost the same as when the token Tk is not set in the section on cell arrival processing.
  • FIG. 36 is a configuration diagram of a main part of a twelfth embodiment of the present invention.
  • One unit time is the time required to transfer a cell on the output line. Cell arrival processing and cell read processing are performed in this order within one unit time.
  • the twelfth embodiment of the present invention is to make the virtual timer HT Im indicating the address to be processed in the scheduling table ST efficiently catch up with the timer Tim indicating the current time. As described above, while the timer Im always indicates the current time accurately, while the simultaneous arrival connection list SL reads from the cell buffer CB a plurality of cells scheduled so as to be read at the same time, it is virtual. Evening time HT im keeps showing the same time.
  • the time difference between the virtual timer HT Im and the timer Tim increases. It takes time to catch up with the virtual HT im after the readout process of the cell scheduled at the time indicated by the virtual HT im is completed.
  • a pointer field is introduced into each time entry of the scheduling table ST, and a list of times at which cells should be transmitted is formed to efficiently catch up with the virtual image HT im. I have to.
  • a list of times at which cells should be transmitted is configured on the scheduling table ST, the head of the list is the address indicated by the virtual timer HT im, and the end is indicated by the tracking timer TT im Address.
  • a list of times at which cells are to be transmitted is logically constructed in a relation indicated by a pointer.
  • the scheduling table ST is addressed at the address indicated by the virtual timer HT im, and the time at which the cell is to be read out is sequentially determined by sequentially manipulating the address list indicated by the pointer at the address of the virtual timer HT im. You can access it.
  • the virtual timer HT im, the tracking timer TT im, and the timer Tim both indicate the same time, but if there are a plurality of cells scheduled at the same time at a certain time, the virtual timer HT im The timer Tim precedes the delay. Even if the virtual timer HT im and the timer Tim deviate from each other, if there is no new cell arrival and the timer T im does not indicate the time when the cell was scheduled, the following timer TT im is virtual Indicates the same time as timer HT im.
  • the address indicated by the evening timer Tim is written into the pointer of the address of the scheduling table ST indicated by the following timer TTim, and the address is also indicated by the following timer TTim.
  • the same processing is performed when the timer Tim indicates the time at which the cell is scheduled, and the current time is added to the list of times at which the cell is to be read.
  • FIG. 37 is a configuration diagram of a main part of the thirteenth embodiment of the present invention.
  • the thirteenth embodiment of the present invention is to limit the number of cells in the cell buffer CB for each connection and reduce the influence of quality between connections.
  • the cell buffer CB is a common buffer, if cells of a specific connection arrive excessively, the cell buffer CB is occupied, and there is a risk that the quality of other connections may be adversely affected.
  • the thirteenth embodiment of the present invention provides a connection so that a specific connection does not occupy the cell buffer CB in such a case. This limits the number of cells that can enter the cell buffer CB for each application.
  • the Q 1 en field of the connection table CT Before writing the cell to the cell buffer CB, compare the Q 1 en field of the connection table CT with the B len field. If the Q len field is small, write the cell buffer CB and set Q 1 en to “10”. If the Q1en field is not small, prohibit writing the cell to the cell buffer CB, and read the cell from the cell buffer CB, set the value of the Q1en field to "-1".
  • the Qlen field indicates the number of cells in the cell buffer CB of the connection
  • the B1 en field indicates the number of cells in the cell buffer CB of the connection.
  • FIG. 38 is a configuration diagram of a main part of the fourteenth embodiment of the present invention.
  • the concept of priority is introduced into the scheduling of a connection.
  • connection identifiers scheduled at the same time are read out on a first-come, first-served basis.
  • connection identifiers scheduled at the same time are included in the list later as the cell transmission interval Int is shorter, so that the shorter the cell transmission interval Int, or conversely, the faster the cell speed, the later the connection identifier. Scheduled.
  • connection identifiers scheduled at the same time are read out in the order of LIF . In this way, faster connections will be read faster.
  • the connection can be made two times. They can be classified into classes. In other words, two classes of connections scheduled at the same time can be created: those scheduled first and those scheduled later.
  • the connection table CT is provided with a field Pri indicating the priority of each connection.
  • Simultaneous arrival connection list When an element is added to the list of connection identifiers scheduled at the same time on SL, if the field Pri of the connection table CT corresponding to the connection identifier of the element has high priority, the scheduling table A new element is added to the position pointed to by the pointer pointer ST of the ST, and if the priority is low, a new element is added to the position indicated by the pointer T1 of the scheduling table ST.
  • connection identifier is described in the simultaneous arrival connection list S in all the embodiments.
  • address of the connection table C T can be described instead.
  • FIG. 39 is a block diagram of the dynamic rate control device of the fifteenth embodiment of the present invention.
  • FIG. 40 is a flowchart showing the operation of the dynamic rate control device according to the fifteenth embodiment of the present invention.
  • the dynamic rate control device includes a cell flow rate measuring unit 1 as a means for measuring a cell flow rate, and a congestion detecting unit as a means for comparing the measured cell flow rate with a threshold value. 2 and a congestion notification unit 4 as means for notifying the cell generation source of the regulation information including the regulation rate of the cell flow rate according to the comparison result.
  • the feature of the dynamic rate control device of the fifteenth embodiment of the present invention is that when a cell source is in a regulated state, the measured value of the cell flow rate from that cell source is the threshold value.
  • the congestion control unit 3 is provided as means for continuing the regulation state until the flow rate falls below the set value.
  • the dynamic rate control device of the fifteenth embodiment of the present invention comprises a cell buffer 5, a cell flow measurement unit 1, a congestion notification unit 4 including a congestion detection unit 2 and a congestion control unit 3,
  • the congestion detection unit 2 detects congestion according to the cell flow rate obtained by the flow rate measurement unit 1, the congestion control unit 3 determines the start and release of regulation, and the congestion notification unit 4 determines the direction of congestion.
  • the congestion notification unit 4 determines the direction of congestion.
  • Using the RM cell that flows in the opposite direction it notifies the restriction rate R to the communication terminal of the cell source.
  • FIG. 40 shows a flowchart of the operation of the congestion detection unit 2 and the congestion control unit 3.
  • the cell flow rate measured by the cell flow rate measuring unit 1 is compared with I and the congestion detection threshold ((S 13 2). To normalize the transmission path capacity to 1.
  • the regulation rate R of the cell transmission speed from the cell source is set to 1 / s (S133). That is, by limiting the current cell transmission rate of the cell source to 1 / s or less, the bucket flow rate from the cell source is suppressed to "1" or less, and congestion is reduced.
  • FIGS. 41 and 42 are diagrams showing the operation of the fifteenth embodiment of the present invention in relation to the cell flow rate; I and time.
  • the horizontal axis represents time
  • the vertical axis represents cell flow rate ⁇ .
  • the cell transmission rate of the cell source is restricted to 1, and if the restriction is removed immediately, R times more traffic will be added and congestion will occur. Regulation is released only when the cell transmission speed from the cell source falls below 1 / R, as shown in the diagram on the left side of Fig. 42. As a result, as shown in the right side of FIG. 42, even if the traffic becomes R times after the release, the traffic does not enter the congestion state.
  • FIGS. 43 and 44 are block diagrams of a dynamic rate control device according to a sixteenth embodiment of the present invention.
  • the dynamic rate control device shown in FIG. 43 includes a cell buffer 5, a cell flow measurement unit 1, a congestion notification unit 4 including a congestion detection unit 2 and a congestion control unit 3, a speed table 6, and a multiplier 7. It is composed of
  • the speed table 6 describes the cell transmission speed transmitted by the cell source for each power connection.
  • the operations of the cell flow rate measurement unit 1, the congestion detection unit 2, and the congestion control unit 3 are the same as those in the fifteenth embodiment of the present invention, but in the sixteenth embodiment of the present invention,
  • the flowing RM cell carries the product of the regulation rate R multiplied by the multiplier 7 and the speed instead of the regulation rate R, and notifies the communication terminal of the cell source.
  • the communication terminal regulates the transmission speed based on the transmission speed mounted on the RM cell.
  • Fig. 44 shows an example in which the speed table 6 and the multiplier 7 are provided in the exchange 20.c
  • the speed table 6 does not need to be provided in the congestion control exchange 30, which is a congestion detection point, and accommodates communication terminals. What is necessary is just to install it in the exchange 20 which has been done.
  • the regulation rate R is installed while the RM cell for congestion notification is transferred in the communication network, and is converted to the bucket sending rate when transferred from the exchange 20 to the subscriber. .
  • the sixteenth embodiment of the present invention there is an advantage that it is not necessary to provide a procedure for converting the regulation rate R into a regulated cell transmission rate in the communication terminal of the cell generation source.
  • FIG. 5 is a block diagram of a dynamic rate control device according to a seventeenth embodiment of the present invention.
  • the dynamic rate control device shown in FIG. 45 includes a cell buffer 5, a cell flow measurement unit 1, a congestion detection unit 2, and a congestion notification unit 4 including a congestion control unit 3.
  • the congestion detection unit 2 detects congestion based on the state of accumulation of cells in the cell buffer 5, that is, the queue length. If the queue length exceeds the convergence detection queue length threshold, it is determined to be congested and regulation is started. The determination of the restriction release is the same as in the fifteenth and sixteenth embodiments of the present invention.
  • FIG. 46 is a block diagram of a dynamic rate control device according to an eighteenth embodiment of the present invention.
  • FIG. 47 is a flowchart showing the operation of the dynamic rate control device according to the eighteenth embodiment of the present invention.
  • the dynamic rate control device shown in FIG. 46 includes a cell buffer 5, a cell flow rate measurement unit 1, a congestion notification unit 4 including a congestion detection unit 2 and a congestion control unit 3, and a timer 8.
  • the congestion detection threshold value is continuously exceeded for a certain period of time or more, it is determined that congestion has occurred.
  • regulations will be strengthened if congestion does not stop for a certain period of time after the judgment of congestion.
  • FIG. 47 is a flowchart showing the operation of the congestion detection unit 2 and the congestion control unit 3 in the eighteenth embodiment of the present invention. If there is no congestion (S144), the bucket flow rate ⁇ measured by the cell flow rate measuring unit 1 is compared with the congestion detection threshold value ((S144). If the cell flow rate I exceeds the reference value ⁇ , it is determined that the cell is congested, and the regulation rate R of the cell sending speed from the cell source is set to ⁇ ⁇ (S143).
  • the cell transmission rate regulation rate R is defined as min (l / ⁇ ) Yes (S145).
  • the range of min is the period of RTT. That is, the maximum cell flow rate during the RTT period; the reciprocal of ax (that is, the minimum value min) is defined as the regulation rate R.
  • the bucket flow rate ⁇ is compared with the reciprocal 1 / R of the current regulation rate R (S146), and if the bucket flow rate; I is smaller, it is determined that the congestion has subsided and the regulation is released. (S147). Otherwise, the congestion state continues for more than RTT for a certain period of time Then (S148), it is determined that the congestion is large, and the regulation rate R of the cell transmission rate is strengthened to min (R / ⁇ ) (S148).
  • the range of min is the period of RTT.
  • FIG. 48 is a diagram for explaining the dynamic rate control device according to the nineteenth embodiment of the present invention.
  • FIG. 49 is a flowchart showing the operation of the dynamic rate control device according to the nineteenth embodiment of the present invention.
  • the restriction rate R is large, the efficiency of use of the network from the time when the congestion stops to the time when the network is released is reduced, so the restriction is released in stages. As shown in FIGS.
  • the number of cells is measured for each RTT (S 15 1), and if congestion occurs at the time (a) of the observation of ⁇ 0 (S 1 52), the cell generation
  • the cell delivery speed of the source is regulated (S153).
  • cell 1 is the cell flow from the cell source, and its value is 1 or more.
  • the regulation rate is gradually relaxed.
  • ⁇ 2 is the cell flow rate from the cell source, and its value is 1 or less. If the cell flow rate is smaller than the reciprocal of the regulation rate R (1ZR) at the observation point (d) of ⁇ 3 (S158), the regulation is released (S159). In this way, the efficiency of network use can be improved even during regulation.
  • FIG. 50 is a flowchart showing the operation of the dynamic rate control device according to the twentieth embodiment of the present invention.
  • FIG. 51 is a diagram showing a call type management table.
  • the dynamic rate control device of the twentieth embodiment of the present invention is provided in the exchange 20 as shown in FIG. 2 of the first embodiment of the present invention, and includes a transmission rate calculation control unit 12.
  • the transmission rate calculation control unit 12 of the twentieth embodiment of the present invention the plurality of connection requests are classified into i groups according to the peak speed and the average speed for the plurality of connection requests, and as shown in FIG.
  • the average cell loss rate is CLR AVE for all of the plurality of connection requests
  • the sum of the average rates is ael l
  • the VP bandwidth is c
  • the peak rate of group i is ri
  • the average rate is ai
  • the call type management table has fields for recording the number of connections, the peak speed, and the average speed in the call type as shown in Fig. 51. If there is an entry of the call type having the corresponding value in the type management table, the corresponding connection number is set to "+1". If there is no entry, register the values in the peak speed and average speed fields, set the number of connections field to 1, and add a new call type entry to the table.
  • the average cell loss rate is calculated.
  • the cell rate probability density function i i (X) of the call type i is calculated using the call type management table.
  • Equation 3 Ni represents the number of VCs of call type i, and Pi represents the ratio of the average cell speed to the peak speed of call type i.
  • F (x) fi *... ⁇ f n (x)-(Equation 4) where n is the number of call types and * represents a convolution operator.
  • F (X) the average cell loss rate CLR AVE is
  • the cell loss of the call type is calculated. As shown in Equation 2, the cell loss rate CLRi for call type i is
  • the cell loss rate CLRi of the call type i is smaller than the reference value of the cell loss rate. If the cell loss rate CLRi is larger, it is determined that the connection request is rejected, and the determination flow is terminated (S1). 64).
  • a fifth step it is determined whether the cell loss rate has been compared with the reference value for all call types, and it is determined that all the call types satisfy the reference value. If it turns out that it is, proceed to the next step. If the determination has not been completed for all the call types, the processes after the third step are repeated for the next call type (S165, S167). Finally, as the sixth step, if it is found in the fifth step that all the call types satisfy the reference value of the cell loss rate, the connection temporarily registered in the call type management table in the first step The connection request is formally registered, and the determination flow ends (S166).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Dans un service de type au mieux d'un réseau de communications MTA servant à faire circuler une cellule RM, un standard d'abonné détient les informations les plus récentes de voie d'acheminement et la cellule RM est utilisée pour des communications de courte distance entre le terminal de télécommunications et le standard de l'utilisateur. Pour une pluralité de connexions possibles dans le standard et pour l'utilisation en commun d'une ligne de transmission ou d'une voie d'acheminement, des informations sur la vitesse de transmission permise, la vitesse de transmission effective, la largeur de bande entière et la largeur de bande d'entrée entière de la ligne de transmission ou de la voie d'acheminement, ainsi sur que le nombre de connexions utilisant en commun la ligne de transmission sont recueillies et conservées. Une vitesse de transmission acceptable pour le terminal de l'appelant est calculée pour chaque connexion sur la base des informations. Une augmentation de la capacité de mémoire est restreinte par l'existence d'un tampon commun et la gestion dudit tampon par une valeur pointeur. Une liste de cellules qui sont arrivées simultanément est préparée et est gérée par la valeur pointeur. Les cellules sont envoyées à des moments différents de manière à ne pas être rejetées. Même lorsque la congestion est éliminée, la restriction n'est pas supprimée rapidement. Au contraire, la régulation est effectuée sur la base de l'augmentation du débit de cellules immédiatement après la suppression. Des calculs de convolution sont effectués une seule fois pour déterminer le taux de perte de cellules moyen global et la quantité des calculs s'en trouve donc réduite.
PCT/JP1996/002131 1995-08-02 1996-07-29 Unite de commande de vitesse dynamique WO1997005724A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
DE69637027T DE69637027T2 (de) 1995-08-02 1996-07-29 Steuereinrichtung für dynamische übertragungsraten
EP96925120A EP0812083B1 (fr) 1995-08-02 1996-07-29 Unite de commande de vitesse dynamique
US08/825,936 US6046983A (en) 1995-08-02 1997-04-01 Dynamic rate control system

Applications Claiming Priority (10)

Application Number Priority Date Filing Date Title
JP7/197728 1995-08-02
JP19772895A JP3287529B2 (ja) 1995-08-02 1995-08-02 トラヒックシェイピング装置
JP7/226746 1995-09-04
JP22674695A JP3087941B2 (ja) 1995-09-04 1995-09-04 Ａｔｍ通信網
JP23869195A JP3087942B2 (ja) 1995-09-18 1995-09-18 フロー制御装置
JP7/238691 1995-09-18
JP26442295A JP3085516B2 (ja) 1995-10-12 1995-10-12 適応送信レート制御通信装置
JP7/264422 1995-10-12
JP7/285289 1995-11-01
JP28528995A JP3039849B2 (ja) 1995-11-01 1995-11-01 セル損失率演算方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US08/825,936 Continuation US6046983A (en) 1995-08-02 1997-04-01 Dynamic rate control system

Publications (1)

Publication Number Publication Date
WO1997005724A1 true WO1997005724A1 (fr) 1997-02-13

Family

ID=27529173

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP1996/002131 WO1997005724A1 (fr) 1995-08-02 1996-07-29 Unite de commande de vitesse dynamique

Country Status (4)

Country Link
US (1) US6046983A (fr)
EP (1) EP0812083B1 (fr)
DE (1) DE69637027T2 (fr)
WO (1) WO1997005724A1 (fr)

Families Citing this family (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6490251B2 (en) * 1997-04-14 2002-12-03 Nortel Networks Limited Method and apparatus for communicating congestion information among different protocol layers between networks
US6192406B1 (en) * 1997-06-13 2001-02-20 At&T Corp. Startup management system and method for networks
US6385168B1 (en) * 1997-06-19 2002-05-07 Alcatel Canada Inc. Fair share bandwidth allocation algorithm and device
JPH1132055A (ja) * 1997-07-14 1999-02-02 Fujitsu Ltd バッファ制御装置及びバッファ制御方法
JP3607466B2 (ja) * 1997-09-05 2005-01-05 株式会社東芝 ルータ装置及び制御フレーム処理方法
JP3067718B2 (ja) * 1997-10-31 2000-07-24 日本電気株式会社 Ａｂｒ機能を有するａｔｍシステム
FR2779302B1 (fr) * 1998-05-28 2000-06-23 Alsthom Cge Alcatel Controle de congestion dans un noeud atm
EP0982970B1 (fr) * 1998-08-21 2006-10-04 Nippon Telegraph and Telephone Corporation Commutateur ATM
US6614757B1 (en) * 1998-11-23 2003-09-02 3Com Corporation Method of local flow control in an asynchronous transfer mode network utilizing PNNI routing protocol
US6621797B1 (en) * 1999-03-18 2003-09-16 Lucent Technologies Inc. System for determining individual cell/pocket loss in ATM/IP networks among on-off sources
US20030195983A1 (en) * 1999-05-24 2003-10-16 Krause Michael R. Network congestion management using aggressive timers
US6198745B1 (en) * 1999-06-24 2001-03-06 Qwest Communications International Inc. ATM based VDSL communication system for providing video and data alarm services
JP3309834B2 (ja) * 1999-07-16 2002-07-29 日本電気株式会社 Ａｔｍ交換装置及びセルバッファ使用率監視方法
US6760337B1 (en) 1999-08-17 2004-07-06 Conexant Systems, Inc. Integrated circuit that processes communication packets with scheduler circuitry having multiple priority levels
AU764794B2 (en) * 1999-09-09 2003-08-28 Telefonaktiebolaget Lm Ericsson (Publ) Information transmission rate control across a core network
AUPQ274199A0 (en) 1999-09-09 1999-09-30 Ericsson Australia Pty Ltd Information transmission rate control across a core network
US6801501B1 (en) * 1999-09-14 2004-10-05 Nokia Corporation Method and apparatus for performing measurement-based admission control using peak rate envelopes
WO2001028142A1 (fr) * 1999-10-14 2001-04-19 Fujitsu Limited Procede et dispositif de raccordement de circuit
FI20000542A (fi) * 2000-03-09 2001-09-10 Nokia Networks Oy Siirtokapasiteettien sovittaminen pakettivälitteisessä verkossa
JP2002074207A (ja) * 2000-09-04 2002-03-15 Fujitsu Ltd サーバー
US20020124083A1 (en) * 2000-09-06 2002-09-05 Sun Microsystems, Inc. Method and apparatus for increasing the efficiency of transactions and connection sharing in an enterprise environment
GB0031535D0 (en) 2000-12-22 2001-02-07 Nokia Networks Oy Traffic congestion
US7088678B1 (en) * 2001-08-27 2006-08-08 3Com Corporation System and method for traffic shaping based on generalized congestion and flow control
CA2357785A1 (fr) * 2001-09-14 2003-03-14 Alcatel Canada Inc. Dispositif d'acheminement intelligent utilisant efficacement les ressources de signalisation d'un reseau
US8145787B1 (en) * 2001-10-16 2012-03-27 Cisco Technology, Inc. Adaptive bandwidth utilization over fabric links
US7464180B1 (en) 2001-10-16 2008-12-09 Cisco Technology, Inc. Prioritization and preemption of data frames over a switching fabric
US7161907B2 (en) * 2002-03-05 2007-01-09 Sun Microsystems, Inc. System and method for dynamic rate flow control
DE102004001008B3 (de) * 2004-01-02 2005-07-14 Siemens Ag Verfahren zur Bestimmung von Grenzwerten für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle
US9210073B2 (en) * 2004-04-30 2015-12-08 Hewlett-Packard Development Company, L.P. System and method for message routing in a network
JP2006019886A (ja) * 2004-06-30 2006-01-19 Nec Corp 適応伝送レート制御方法／プログラム／記録媒体、無線バースト信号伝送システム、端末局、基地局
US7895329B2 (en) * 2006-01-12 2011-02-22 Hewlett-Packard Development Company, L.P. Protocol flow control
WO2008081146A2 (fr) * 2006-12-29 2008-07-10 France Telecom Procede et dispositif de gestion de connexions dans un reseau de telecommunications
JP5445271B2 (ja) * 2010-03-30 2014-03-19 富士通株式会社 帯域制御装置，帯域制御方法，及びプログラム
JP5601193B2 (ja) * 2010-12-22 2014-10-08 富士通株式会社 ネットワーク中継システム、ネットワーク中継装置、輻輳状態通知方法、及びプログラム
US9537743B2 (en) * 2014-04-25 2017-01-03 International Business Machines Corporation Maximizing storage controller bandwidth utilization in heterogeneous storage area networks
CN103997465B (zh) * 2014-05-27 2018-02-23 华为技术有限公司 一种生成cnm的方法及设备
JP2017059912A (ja) * 2015-09-14 2017-03-23 富士通株式会社 伝送装置
WO2017053977A1 (fr) 2015-09-25 2017-03-30 Fsa Technologies, Inc. Système et procédé de régulation de flux de données à liaisons multiples

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05268242A (ja) * 1992-03-19 1993-10-15 Fujitsu Ltd 管理セルによるネットワーク管理装置及びその方法
JPH0646085A (ja) * 1992-07-27 1994-02-18 Toshiba Corp Ａｔｍ交換機におけるトラヒックパラメータ制御方式
EP0635958A2 (fr) * 1993-07-21 1995-01-25 Fujitsu Limited Procédé de conception et de gestion pour réseau de communications

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2038646C (fr) * 1990-03-20 1995-02-07 Katsumi Oomuro Systeme de communication mta avec controle optimal du traffic en effectuant le changement de la bande allouee
US5381407A (en) * 1992-06-04 1995-01-10 Bell Communications Research, Inc. Method and system for controlling user traffic to a fast packet switching system
WO1994021068A1 (fr) * 1993-03-12 1994-09-15 Fujitsu Limited Appareil et methode de commande en mode de transmission asynchrone
KR100293920B1 (ko) * 1993-06-12 2001-09-17 윤종용 비동기전송모드의사용자망접속인터페이스의트래픽제어장치및방법
WO1995019675A1 (fr) * 1994-01-14 1995-07-20 Codex Corporation Procede et systeme de gestion de trafic atm
JP2928452B2 (ja) * 1994-03-17 1999-08-03 富士通株式会社 Ａｔｍ交換機及びａｔｍ交換機における呼受付け装置及び呼受付け方法
US5583861A (en) * 1994-04-28 1996-12-10 Integrated Telecom Technology ATM switching element and method having independently accessible cell memories
US5734825A (en) * 1994-07-18 1998-03-31 Digital Equipment Corporation Traffic control system having distributed rate calculation and link by link flow control
US5515359A (en) * 1994-08-26 1996-05-07 Mitsubishi Electric Research Laboratories, Inc. Credit enhanced proportional rate control system
US5675576A (en) * 1995-06-05 1997-10-07 Lucent Technologies Inc. Concestion control system and method for packet switched networks providing max-min fairness
CA2181206C (fr) * 1995-07-24 2001-03-13 Anwar Elwalid Methode de controle d'acces et d'acheminement utilisant l'affectation des ressources du reseau aux noeuds de ce reseau

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05268242A (ja) * 1992-03-19 1993-10-15 Fujitsu Ltd 管理セルによるネットワーク管理装置及びその方法
JPH0646085A (ja) * 1992-07-27 1994-02-18 Toshiba Corp Ａｔｍ交換機におけるトラヒックパラメータ制御方式
EP0635958A2 (fr) * 1993-07-21 1995-01-25 Fujitsu Limited Procédé de conception et de gestion pour réseau de communications

Non-Patent Citations (13)

* Cited by examiner, † Cited by third party
Title
HASEGAWA H, ET AL.: "ABR EMULATION BY ATM MULTI-PROTOCOL EMULATION NETWORK (ALPEN)", IEICE COMMUNICATION SOCIETY CONVENTION, XX, XX, 15 August 1995 (1995-08-15), XX, pages 14 + ABSTR. NO. B - 347, XP008054392 *
HASEGAWA H, ET AL.: "ABR ER-MODE ON ATM MULTI-PROTOCOL EMULATION NETWORK:ALPEN", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, vol. SSE95-105, 1 October 1995 (1995-10-01), JP, pages 61 - 66, XP002948063, ISSN: 0913-5685 *
HASEGAWA H, ET AL.: "ATM WAN ARCHITECTURE FOR IMPLEMENTATION OF MULTI PROTOCOL, PART 2 - MULTI PROTOCOL ATM-WAN WITH ALPEN -", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, vol. 95-187, 15 March 1996 (1996-03-15), JP, pages 79 - 84, XP008052998, ISSN: 0913-5685 *
IEICE COMMUNICATIONS SOCIETY CONVENTION, B-345, 15 August 1995, NAOAKI YAMANAKA, KOHEI SHIOMOTO, HARUHISA HASEGAWA, "Proposal of ATM Multi Protocol Emulation Network (ALPEN)", p. 12. *
KITAZUME H, ET AL.: "SUPPORT OF ABR SERVICE IN PUBLIC NETWORKS", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, vol. 95-30, 14 July 1995 (1995-07-14), JP, pages 31 - 36, XP008053001, ISSN: 0913-5685 *
NTT R&D, Vol. 42, No. 3, 1993 (NIPPON TELEGRAPH TELEPHONE CORP.), 10 March 1993, KENICHI SATO, YOICHI SATO, NAOAKI YAMANAKA, KAZUHIRO HAYASHI, "Design Technology for Housing A Virtual Path", pp. 343-356. *
OKI E, YAMANAKA N: "IMPACT OF MULTIMEDIA SERVICE REQUIREMENTS ON ATM-VC NETWORK CONFIGURATIONS", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, vol. 94-241, 15 March 1995 (1995-03-15), JP, pages 31 - 36, XP008053000, ISSN: 0913-5685 *
SATO H, ET AL.: "ATM WAN ARCHITECTURE FOR IMPLEMENTATION OF MULTI PROTOCOL, PART 1 ABR SERVICE USING VS/VD METHOD", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, 1 March 1996 (1996-03-01), JP, pages 73 - 78, XP008052999, ISSN: 0913-5685 *
See also references of EP0812083A4 *
SHIOMOTO K, CHAKI S-I, ITODA J: "CELL LOSS PROBABILITY ESTIMATION USING MEASUREMENT OF CELL ARRIVALS IN ATM NETWORKS", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, 1 March 1994 (1994-03-01), JP, pages 93 - 98, XP008053003, ISSN: 0913-5685 *
SHIOMOTO K, YAMANAKA N, HASEGAWA H: "ADMISSION AND FLOW CONTROL BASED ON MEASUREMENTS OF INSTANTANEOUS UTILIZATION", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, 1 December 1995 (1995-12-01), JP, pages 01, XP008053002, ISSN: 0913-5685 *
YAMANAKA N, SATO Y: "JITTER TOLERANT USAGE PARAMETER CONTROL METHOD FOR ATM-BASED B-ISDN", IEICE TECHNICAL REPORT, DENSHI JOUHOU TSUUSHIN GAKKAI, JP, 30 September 1993 (1993-09-30), JP, pages 07 - 12, XP008052997, ISSN: 0913-5685 *
YAMANAKA N., SHIOMOTO K., HASEGAWA H.: "ALPEN: A SIMPLE AND FLEXIBLE ATM NETWORK BASED ON MULTI PROTOCOL EMULATION AT EDGE NODES.", IEICE TRANSACTIONS ON COMMUNICATIONS., COMMUNICATIONS SOCIETY, TOKYO., JP, vol. E79B., no. 04., 1 April 1996 (1996-04-01), JP, pages 611 - 615., XP000587977, ISSN: 0916-8516 *

Also Published As

Publication number Publication date
DE69637027D1 (de) 2007-05-31
DE69637027T2 (de) 2007-08-23
EP0812083A4 (fr) 2005-07-06
EP0812083B1 (fr) 2007-04-18
US6046983A (en) 2000-04-04
EP0812083A1 (fr) 1997-12-10

Similar Documents

Publication Publication Date Title
WO1997005724A1 (fr) Unite de commande de vitesse dynamique
JP3732981B2 (ja) 連続ビット・レート仮想パス接続の帯域幅を動的に調節するための方法
US6167030A (en) Buffer-based traffic measurement system and method for nominal bit rate (NBR) service
US6442138B1 (en) Method and apparatus for controlling admission of connection requests
US7324521B2 (en) Communication device with multi-stages of traffic shaping functions
US7068660B2 (en) Method for measurement-based connection admission control (MBAC) in a packet data network
US6633585B1 (en) Enhanced flow control in ATM edge switches
WO1997002685A1 (fr) Reseau de communications a bande variable
GB2338372A (en) Packet-switched networks
AU4133700A (en) Routing device
JPH10135975A (ja) セル交換機におけるフィードバック制御装置及びセルスケジューリング装置
US6385168B1 (en) Fair share bandwidth allocation algorithm and device
USRE43645E1 (en) Measurement-based connection admission control (MBAC) device for a packet data network
Nahrstedt et al. Coexistence of QoS and best-effort flows
Lee et al. Improved dynamic weighted cell scheduling algorithm based on Earliest Deadline First scheme for various traffics of ATM switch
US6430157B1 (en) Communication controlling apparatus
Giacomazzi et al. Transport of IP Controlled-load service over ATM networks
KR100319457B1 (ko) 비동기 전송 모드 교환기의 트래픽 제어 방법
Lee et al. Simple measurement-based connection admission control for heterogeneous traffic sources
Oliva Optimizing integrated broadband network bandwidth utilization through connection admission control using weighted round robin queue server measurements
EP1163823B1 (fr) Systeme de mesure de trafic utilisant un tampon et procede permettant d'assurer un service a debit binaire nominal (nbr)
JP3833664B2 (ja) セル交換機におけるフィードバック制御装置及びセルスケジューリング装置
Yu Integrated congestion management at the user-network interface of an ATM/B-ISDN network
Cerdà Alabern Traffic Management of the ABR. Service Category in ATM Networks
De Silva A simple approach to congestion control of ABR traffic with weighted max-min fairness

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): DE FR GB

WWE Wipo information: entry into national phase

Ref document number: 1996925120

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 08825936

Country of ref document: US

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 1996925120

Country of ref document: EP

WWG Wipo information: grant in national office

Ref document number: 1996925120

Country of ref document: EP