CN110336756A - Crossbar flow back-pressure control method with trunking function - Google Patents
Crossbar flow back-pressure control method with trunking function Download PDFInfo
- Publication number
- CN110336756A CN110336756A CN201910604263.6A CN201910604263A CN110336756A CN 110336756 A CN110336756 A CN 110336756A CN 201910604263 A CN201910604263 A CN 201910604263A CN 110336756 A CN110336756 A CN 110336756A
- Authority
- CN
- China
- Prior art keywords
- token
- crossbar
- flow control
- bucket
- injection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/10—Packet switching elements characterised by the switching fabric construction
- H04L49/101—Packet switching elements characterised by the switching fabric construction using crossbar or matrix
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
Abstract
The Crossbar flow back-pressure control method with trunking function that the invention discloses a kind of.Mainly solve the problems, such as that the file leader generated when the prior art will carry out the flow control of output port to the Crossbar architecture for exchanging with trunking function blocks.Its implementation is: 1) realizing flow control based on token bucket algorithm, introduce token injection period and injection token number, the mode that highest number of tokens combines realizes the customized flow control speed grade of user；2) judge token number in token bucket, generate flow control feedback signal；3) input and output processing is carried out to the crossbar contact array Crossbar with trunking function according to flow control feedback signal.The present invention realizes the adaptation of distinct device rate, avoids file leader's obstruction of output port, the flow control that can be used for having in the Crossbar interchanger of trunking function and the back-pressure for preventing file leader from blocking control.
Description
Technical field
The invention belongs to fields of communication technology, further relate to a kind of implementation method of flow back-pressure control, can be used for
Flow control in Crossbar interchanger with trunking function and the back-pressure for preventing file leader from blocking control.
Background technique
In recent years, being gradually increasing with the increasingly developed and number of network users of the communication technology, interchanger is as network
Access and conversion equipment become ever more important, and gradually riseing with number of users, the port number of interchanger and transmission are fast
Rate is also improved constantly, and switching fabric also develops from shared buffer memory structure to crossbar fabric therewith.Therefore, large capacity is handed over
It changes planes and is given birth to because of fortune.However large capacity exchanger also faced while meeting user demand one it is closely related with network performance
Flow control problems.Family can be used to provide reasonable rate transmissioning data in flow control, is prevention exchange network congestion,
Effectively improve a kind of efficient method of network performance.
Patent " a kind of switch traffic control method and interchanger " Shen of Huasan Communication Technology Co., Ltd.'s application
When please disclose one kind in the patent application of number 200910170191.5 publication number CN102014045A and detecting congestion, interchanger
Receiving direction sender sends a kind of PAUSE frame as defined in IEEE 802.3, thus the method for reducing sender's transmission rate.It should
Although method effectively realizes flow control, there is also defects: user not can control the speed grade of flow control, limitation
It is very big.
Existing technical data transmission is generally used for the data transmission of single port, in the data transmission for being related to multiple ports
When bus number will increase, in order to make full use of resource, promote the flexibility of switching equipment, to multiple ports carry out convergence be must
It wants, however, when the Crossbar architecture for exchanging based on port trunking will carry out the flow control of output port, it can the row of generation
Head obstructing problem.
Summary of the invention
It is a kind of with trunking function it is an object of the invention in view of the above shortcomings of the prior art, propose
Crossbar flow back-pressure control method avoids output port from generating file leader's obstruction and asks to realize the adaptation of distinct device rate
Topic.
The technical scheme is that using the rate-shaping method based on token bucket algorithm come speed control grade, in fact
The adaptation of existing distinct device rate, the congestion of output port is avoided using the feedback signal that flow-control module generates, and is realized
Step includes the following:
(1) token is injected for token bucket:
(1a) initializes token bucket, that is, the bucket that gives token injects highest number of tokens C, and setting token injects period n, and
A cycle counter is safeguarded for each token bucket；
(1b) judges whether cycle rate counter reaches the token injection period of setting:
If reached, cycle rate counter is reset, is executed (1c)；
If not up to, executing (1d)；
(1c) judge token bucket Central Plains token number fill into the sum of token number whether be greater than highest number of tokens:
It writes enabled if so, drawing high token, and the token number of injection is updated to highest number of tokens, executed (2)；
If it is not, the token number of injection to be then updated to the sum of the token number of former token number and injection, execute (2)；
(1d) cycle rate counter continues to add 1, returns (1b)；
(2) token number in token bucket is updated:
(2a), which is set, reads enable signal as the initial signal of data frame, judges the write enable signal of token bucket and reads enable signal
Whether draw high simultaneously:
If drawn high simultaneously, update token bucket in token number be (1c) in injection token number and deletion token number it
Difference executes (3), wherein the token number deleted is the data frame length sent；
Otherwise, judge whether the write enable signal of token bucket is drawn high:
If write enable signal is drawn high, updating the token number in token bucket is the injection token number in (1c), is executed (3)；
If write enable signal is not drawn high, execute (2b)；
(2b) judges whether the reading enable signal of token bucket is drawn high:
If reading enable signal to draw high, the difference for the token number that the token number in token bucket is former token number and deletion is updated,
It executes (3)；
If reading enable signal not draw high, maintain the token number in token bucket constant, executes (3)；
(3) early warning value is set according to flow control grade set by user, whether the token number generated in judgement (2) is less than
Early warning value:
If being less than, flow control feedback signal is drawn high, otherwise, feedback signal drags down；
(4) input scheduling is carried out to the Crossbar with trunking function according to flow control feedback signal:
(4a) obtains team's scheduling information out of data to be dispatched based on fair polling algorithm；
(4b) detects the flow control feedback signal generated in (3):
If flow control feedback signal is low, execution (4c)；
If flow control feedback signal is height, return (4a)；
Whether (4c) detects the corresponding crossover node of non-empty queue in (4a) idle:
If idle, team's head data frame of the non-empty queue is written out in team frame information FIFO, team dispatches successfully out, holds
Row (4d)；
Otherwise, wait always until the crossover node is idle；
(4d) reading parses group frame information FIFO, obtains the data frame information that team；
(5) input processing is carried out to the Crossbar crossbar contact with trunking function:
(5a) judges whether corresponding purpose crossbar contact is idle according to the dequeue data frame information parsed in (4d):
If idle, execute (5b)；
Otherwise, wait always until the crossover node is idle；
(5b) obtains out team address according to the dequeue data frame information parsed in (4d), is removed data frame according to team address out
Move to purpose crossover node caching；
(6) output processing is carried out to the Crossbar crossbar contact with trunking function:
(6a) using 4 crossover nodes in the bus of fair polling algorithm poll longitudinal direction caching, when being polled to crossbar contact
When being cached with data, the data frame information for reading crossbar contact caching obtains the destination slogan of output；
Whether the output port obtained in (6b) detection (6a) can receive data:
If so, by crossbar contact cache in data distribution to these output ports；
Otherwise, it waits always until the output port can receive data；
The invention has the following advantages over the prior art:
First, since the present invention realizes flow control function using token bucket algorithm, introduce token injection period and note
Enter token number, the mode that highest number of tokens combines, realizing user can be with customized flow control speed grade.
Second, since the present invention introduces flow control feedback signal at Crossbar exchange network input scheduling, make
The judgement of flow control has been isolated in the forwarding of output port, avoids in the Crossbar switching fabric with trunking function
The file leader's obstructing problem generated when flow control function is added due to the traffic shaping limitation of token bucket.
Detailed description of the invention
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the sub-process figure of token injection in the present invention；
Fig. 3 is the sub-process figure that token updates in the present invention；
Fig. 4 is the crossbar contact array crossbar fabric figure with trunking function in the present invention.
Specific embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings.
Referring to Fig.1, the present invention is based on the realization of token bucket algorithm progress flow control, steps are as follows:
Step 1, token is injected for token bucket
Referring to Fig. 2, this step is implemented as follows:
1a) token bucket is initialized, that is, the bucket that gives token injects highest number of tokens C, meet formula:
C+ ρ × S=Rmax×S
Wherein, ρ is flow control rate；S is time burst；RmaxFor system maximum rate；
A cycle counter 1b) is safeguarded to each token bucket, token is set according to flow control speed grade and injects the period: n
=A/k, wherein A is injection token number；K is the token number for the unit period needing to inject,T is each clock cycle
The time of maintenance；
1c) judge whether cycle rate counter reaches the token injection period n of setting:
If reached, step 1d is executed),
If not up to, executing 1e)；
1d) cycle rate counter is reset, judges whether the sum of token number of former token number and injection is greater than highest number of tokens
C:
If so, draw high token write it is enabled, i.e., by token write it is enabled be set to 1, and the token number of injection is updated to maximum
Token number；
If it is not, the token number of injection to be then updated to the sum of the token number of former token number and injection；
1e) cycle rate counter continues to add 1, returns to 1c).
Step 2, the token number in token bucket is updated
Referring to Fig. 3, this step is implemented as follows:
It 2a) sets and reads enable signal as the initial signal of data frame, as long as carrying out a frame data frame, reading enable signal will be drawn
A high clock cycle, judge token bucket write enable signal and read enable signal whether and meanwhile draw high:
If drawn high simultaneously, the token number in token bucket is updated for the token number of injection token number and deletion in 1d)
Difference, execute step 3, wherein the token number deleted be transmission data frame length；
Otherwise, judge whether the write enable signal of token bucket is drawn high:
If write enable signal is drawn high, the token number in token bucket is updated for the injection token number in 1d), executes step 3；
If write enable signal is not drawn high, 2b is executed)；
2b) judge whether the reading enable signal of token bucket is drawn high:
If reading enable signal to draw high, the difference for the token number that the token number in token bucket is former token number and deletion is updated,
Execute step 3；
If reading enable signal not draw high, maintain the token number in token bucket constant, executes step 3.
Step 3, judge the token number in token bucket, generate flow control feedback signal.
Whether the token number generated in judgment step 2 is less than early warning value set by user, if being less than, feedback signal is drawn
Feedback signal is set 1 by height, otherwise, feedback signal is set 0.
Step 4, input scheduling is carried out to the Crossbar with trunking function according to flow control feedback signal.
This step is that the structure of crossbar contact array Crossbar based on shown in Fig. 4 is realized:
4a) with 16 output ends on every traversal trunk of fair polling algorithm poll crossbar contact array Crossbar
Mouth fifo queue sets the port fifo queue number currently exported as i, then next poll is opened from i+1 port fifo queue
Beginning poll: after being polled to the 16th output port fifo queue, output port fifo queue number is set 1, continues poll, directly
Until being polled to and having non-empty queue in output port FIFO；
4b) to the non-empty queue being polled to, the flow control feedback signal that is generated in detecting step 3:
If flow control feedback signal is 1,4a is continued to execute), which will not be written out team as scheduling result
In frame information FIFO；
If the flow control feedback signal detected is 0,4c is thened follow the steps)；
4c) detect 4a) in the corresponding crossover node of non-empty queue it is whether idle:
If idle, team's head data frame of the non-empty queue is written out in team frame information FIFO, team dispatches successfully out, holds
Row step 5；
Otherwise, it waits always until the crossover node is idle；
Wherein, the corresponding crossover node difference of the non-empty queue is as follows:
Non-empty queue 1~4 corresponds to crossbar contact 1,
Non-empty queue 5~8 corresponds to crossbar contact 2,
Non-empty queue 9~12 corresponds to crossbar contact 3,
Non-empty queue 13~16 corresponds to crossbar contact 4.
Step 5: input processing is carried out to the crossover node of crossbar contact array Crossbar.
It 5a) reads and parses group frame information FIFO, obtain the data frame information that team；
5b) according to 5a) in the dequeue data frame information that parses, judge whether corresponding purpose crossbar contact idle:
If idle, 5c is executed)；
Otherwise, it waits always until the crossover node is idle；
5c) according to 5a) in parse dequeue data frame information obtain out team address, data frame is moved according to team address out
It is cached to purpose crossover node.
Step 6: output processing is carried out to crossbar contact array Crossbar crossbar contact.
6a) with 4 friendships in a longitudinal bus of fair polling dispatching algorithm poll crossbar contact array Crossbar
The caching of knuckle point, that is, set current crossbar contact as i, then next poll poll since i+1 crossbar contact, when being polled to
After 4th crossbar contact, crossbar contact is set 1, continues poll, until being polled to has data in crossbar contact caching, and
The data frame information for reading crossbar contact caching obtains the destination slogan of output；
6b) detect 6a) in obtain output port whether can receive data:
If output port is in idle condition, sentencing it can receive data, and by crossbar contact cache in data point
It is dealt into these output ports；
Otherwise, it waits always until the output port is in idle condition.
Above description is only example of the present invention, does not constitute any limitation of the invention, it is clear that for
It, all may be without departing substantially from the principle of the invention, structure after having understood the content of present invention and principle for one of skill in the art
In the case where, carry out various modifications and change in form and details, but these modifications and variations based on inventive concept
Still within the scope of the claims of the present invention.
Claims (5)
1. the Crossbar flow back-pressure control method with trunking function, which is characterized in that include the following:
(1) token is injected for token bucket:
(1a) initializes token bucket, that is, the bucket that gives token injects highest number of tokens C, and setting token injects period n, and is every
A token bucket safeguards a cycle counter；
(1b) judges whether cycle rate counter reaches the token injection period of setting:
If reached, cycle rate counter is reset, is executed (1c)；
If not up to, executing (1d)；
(1c) judge token bucket Central Plains token number fill into the sum of token number whether be greater than highest number of tokens:
It writes enabled if so, drawing high token, and the token number of injection is updated to highest number of tokens, executed (2)；
If it is not, the token number of injection to be then updated to the sum of the token number of former token number and injection, execute (2)；
(1d) cycle rate counter continues to add 1, returns (1b)；
(2) token number in token bucket is updated:
(2a), which is set, reads enable signal as the initial signal of data frame, judges the write enable signal of token bucket and whether reads enable signal
It draws high simultaneously:
If drawn high simultaneously, the difference for the token number that the token number in token bucket is the injection token number in (1c) and deletion is updated,
It executes (3), wherein the token number deleted is the data frame length sent；
Otherwise, judge whether the write enable signal of token bucket is drawn high:
If write enable signal is drawn high, updating the token number in token bucket is the injection token number in (1c), is executed (3)；
If write enable signal is not drawn high, execute (2b)；
(2b) judges whether the reading enable signal of token bucket is drawn high:
If reading enable signal to draw high, the difference for the token number that the token number in token bucket is former token number and deletion is updated, is executed
(3)；
If reading enable signal not draw high, maintain the token number in token bucket constant, executes (3)；
(3) early warning value is set according to flow control grade set by user, whether the token number generated in judgement (2) is less than early warning
Value: if being less than, flow control feedback signal being drawn high, and otherwise, feedback signal drags down；
(4) input scheduling is carried out to the Crossbar with trunking function according to flow control feedback signal:
(4a) obtains team's scheduling information out of data to be dispatched based on fair polling algorithm；
(4b) detects the flow control feedback signal generated in (3):
If flow control feedback signal is low, execution (4c)；
If flow control feedback signal is height, return (4a)；
Whether (4c) detects the corresponding crossover node of non-empty queue in (4a) idle:
If idle, team's head data frame of the non-empty queue is written out in team frame information FIFO, team dispatches successfully out, executes
(4d)；
Otherwise, wait always until the crossover node is idle；
(4d) reading parses group frame information FIFO, obtains the data frame information that team；
(5) input processing is carried out to the Crossbar crossbar contact with trunking function:
(5a) judges whether corresponding purpose crossbar contact is idle according to the dequeue data frame information parsed in (4d):
If idle, execute (5b)；
Otherwise, wait always until the crossover node is idle；
(5b) obtains out team address according to the dequeue data frame information parsed in (4d), according to team address out by data frame move to
Purpose crossover node caching；
(6) output processing is carried out to the Crossbar crossbar contact with trunking function:
(6a) is cached using the caching of 4 crossover nodes in the bus of fair polling algorithm poll longitudinal direction when being polled to crossbar contact
When having data, the data frame information for reading crossbar contact caching obtains the destination slogan of output；
Whether the output port obtained in (6b) detection (6a) can receive data:
If so, by crossbar contact cache in data distribution to these output ports；
Otherwise, it waits always until the output port can receive data.
2. the method according to claim 1, wherein the bucket injection highest number of tokens C that gives token in (1a), meets
Following relational expression:
C+ ρ × S=Rmax×S
Wherein, ρ is flow control rate, and S is time burst, RmaxFor system maximum rate.
3. the method according to claim 1, wherein in the token injection period set in (1a), be according to flow control
Speed grade sets token and injects the period: n=A/k, wherein A is injection token number；K is the token for the unit period needing to inject
Number,T is the time maintained each clock cycle.
4. the method according to claim 1, wherein (4a) obtains data to be dispatched based on fair polling algorithm
Team's scheduling information out is 16 output ports on every traversal trunk by fair polling dispatching algorithm poll Crossbar
Fifo queue sets the port fifo queue number currently exported as i, then next poll is since the fifo queue of i+1 port
Output port fifo queue number is set 1, continues poll, until wheel by poll after being polled to the 16th output port fifo queue
It askes until having non-empty queue into output port FIFO.
5. the method according to claim 1, wherein in (6a) in the longitudinal bus of poll Crossbar mono- 4
The caching of a crossover node is 4 intersections in a longitudinal bus by fair polling dispatching algorithm poll Crossbar
Node caching, that is, set current crossbar contact as i, then poll poll since i+1 crossbar contact next time, when being polled to the 4th
After a crossbar contact, crossbar contact is set 1, continues poll, until being polled to there are data in crossbar contact caching.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910604263.6A CN110336756B (en) | 2019-07-05 | 2019-07-05 | Crossbar flow back pressure control method with port convergence function |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910604263.6A CN110336756B (en) | 2019-07-05 | 2019-07-05 | Crossbar flow back pressure control method with port convergence function |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110336756A true CN110336756A (en) | 2019-10-15 |
| CN110336756B CN110336756B (en) | 2022-04-05 |
Family
ID=68144311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910604263.6A Active CN110336756B (en) | 2019-07-05 | 2019-07-05 | Crossbar flow back pressure control method with port convergence function |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110336756B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112039720A (en) * | 2020-07-31 | 2020-12-04 | 中国人民解放军战略支援部队信息工程大学 | 1-100% flow accurate controllable flow generating device and flow generating method |
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7020131B1 (en) * | 2001-12-24 | 2006-03-28 | Applied Micro Circuits Corp. | System and method for hierarchical switching |
| CN101924687A (en) * | 2009-06-12 | 2010-12-22 | 中兴通讯股份有限公司 | Method and device for controlling switching communicated network flow |
| CN107634913A (en) * | 2017-08-22 | 2018-01-26 | 中国电子科技集团公司第五十四研究所 | A kind of service traffics control and the satellite borne equipment system of Differentiated Services |
| CN107770093A (en) * | 2017-09-29 | 2018-03-06 | 内蒙古农业大学 | A kind of method of work of preposition continuous feedback type two-stage switching fabric |
| CN108111930A (en) * | 2017-12-15 | 2018-06-01 | 中国人民解放军国防科技大学 | Multi-bare-chip high-order optical switching structure based on high-density memory |
| CN109716717A (en) * | 2016-09-07 | 2019-05-03 | 思科技术公司 | From software-defined network controller management virtual port channel switching equipment peer-to-peer |
-
2019
- 2019-07-05 CN CN201910604263.6A patent/CN110336756B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7020131B1 (en) * | 2001-12-24 | 2006-03-28 | Applied Micro Circuits Corp. | System and method for hierarchical switching |
| CN101924687A (en) * | 2009-06-12 | 2010-12-22 | 中兴通讯股份有限公司 | Method and device for controlling switching communicated network flow |
| CN109716717A (en) * | 2016-09-07 | 2019-05-03 | 思科技术公司 | From software-defined network controller management virtual port channel switching equipment peer-to-peer |
| CN107634913A (en) * | 2017-08-22 | 2018-01-26 | 中国电子科技集团公司第五十四研究所 | A kind of service traffics control and the satellite borne equipment system of Differentiated Services |
| CN107770093A (en) * | 2017-09-29 | 2018-03-06 | 内蒙古农业大学 | A kind of method of work of preposition continuous feedback type two-stage switching fabric |
| CN108111930A (en) * | 2017-12-15 | 2018-06-01 | 中国人民解放军国防科技大学 | Multi-bare-chip high-order optical switching structure based on high-density memory |
Non-Patent Citations (2)
| Title |
|---|
| TEJPAL SINGH,ETC: "A GALS Solution Based on Highly Scalable, Low Latency, Crossbar Using Token Ring Arbitration", 《IEEE》 * |
| 卢秀娟等: "带VOQ和交叉点缓冲的交叉矩阵", 《光通信研究》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112039720A (en) * | 2020-07-31 | 2020-12-04 | 中国人民解放军战略支援部队信息工程大学 | 1-100% flow accurate controllable flow generating device and flow generating method |
| CN112039720B (en) * | 2020-07-31 | 2022-03-25 | 中国人民解放军战略支援部队信息工程大学 | 1-100% flow accurate controllable flow generating device and flow generating method |
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110336756B (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103731368B (en) | A kind of method and apparatus for handling message | |
| Boden et al. | Myrinet: A gigabit-per-second local area network | |
| CN101252536B (en) | Router multi-queue data pack buffer management and output queue scheduling system | |
| CN101873253B (en) | Buffered crossbar switch system | |
| US6804731B1 (en) | System, method and article of manufacture for storing an incoming datagram in switch matrix in a switch fabric chipset system | |
| CN108111930B (en) | Multi-bare-chip high-order optical switching structure based on high-density memory | |
| US6731631B1 (en) | System, method and article of manufacture for updating a switching table in a switch fabric chipset system | |
| Dittia et al. | Design of the APIC: A high performance ATM host-network interface chip | |
| CN106302163B (en) | A kind of network-on-chip router and method for routing with multiple-working mode | |
| CN109218231A (en) | A kind of RapidIO exchange network | |
| JPH1051471A (en) | Digital network with mechanism putting together virtual message transfer paths having close transfer service rates to improve efficiency of transfer scheduling onto virtual message transfer path | |
| CN101420720A (en) | Schedule and data caching for wireless tranmission | |
| CN110336756A (en) | Crossbar flow back-pressure control method with trunking function | |
| CN103955436B (en) | A kind of data processing equipment and terminal | |
| CN109446132A (en) | A kind of interface bus device and data communication protocol | |
| CN109861931A (en) | A kind of storage redundant system of high speed Ethernet exchange chip | |
| CN1984030A (en) | Method and device for controlling ATM network flow based on FPGA | |
| CN101848162B (en) | Device and method for transmitting Ethernet data | |
| CN104333516A (en) | Rotation rotation scheduling method for combined virtual output queue and crosspoint queue exchange structure | |
| CN106850440A (en) | A kind of router, method for routing and its chip wrapped towards multiaddress shared data route | |
| CN101964751B (en) | Transmission method and device of data packets | |
| CN103384225B (en) | Based on the flow control methods of input intersection cache fast packet switching network | |
| CN100499563C (en) | Increasing memory access efficiency for packet applications | |
| CN111274173A (en) | ZYNQ-based multi-node SRIO communication design method and device | |
| CN100471175C (en) | Message storage forwarding method and message storage forwarding circuit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |