WO1984004014A1 - A distributed prioritized concentrator - Google Patents
A distributed prioritized concentrator Download PDFInfo
- Publication number
- WO1984004014A1 WO1984004014A1 PCT/US1984/000347 US8400347W WO8404014A1 WO 1984004014 A1 WO1984004014 A1 WO 1984004014A1 US 8400347 W US8400347 W US 8400347W WO 8404014 A1 WO8404014 A1 WO 8404014A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- concentrator
- network
- input
- output
- sorting
- Prior art date
Links
- 238000004891 communication Methods 0.000 abstract description 11
- 238000013459 approach Methods 0.000 description 9
- 230000000694 effects Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 2
- 230000015654 memory Effects 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
Classifications
-
- 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
- H04L49/3009—Header conversion, routing tables or routing tags
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/15—Interconnection of switching modules
- H04L49/1507—Distribute and route fabrics, e.g. sorting-routing or Batcher-Banyan
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/58—Arrangements providing connection between main exchange and sub-exchange or satellite
- H04Q3/60—Arrangements providing connection between main exchange and sub-exchange or satellite for connecting to satellites or concentrators which connect one or more exchange lines with a group of local lines
- H04Q3/605—Arrangements in the satellite or concentrator
-
- 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/5603—Access techniques
- H04L2012/5609—Topology
- H04L2012/561—Star, e.g. cross-connect, concentrator, subscriber group equipment, remote electronics
-
- 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/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/50—Overload detection or protection within a single switching element
- H04L49/505—Corrective measures
Definitions
- This invention relates to a prioritized concentrator having input and output lines.
- Business users would also use electronic blackboards, teleconference facilities, word processors, and large computer communication networks.
- a number of approaches are employed in the prior art to manage the communication interconnections between central offices.
- One approach uses high capacity lines to interconnect central offices, but this is inefficient because most of the time some capacity is idle. The inefficiency is reduced in a variation on this approach which switches the information onto a small number of lines, taking advantage of the fact that not all of the lines are active simultaneously. This is the classic concentration function. It improves the utilization of the communication paths at the cost of possible blocking of signals.
- a third approach employs a computer to sequentially examine incoming lines, store the applied signal packets in a prioritized queue in the computer's memory and transmit the highest priority packets to its outgoing lines, as they become available.
- the difficulty with this approach is that a statistical multiplexer must scan the input, properly queue the data, and manage the outgoing lines in essentially a simultaneous manner. This becomes more and more difficult as the data rate increases or the number of incoming and outgoing lines increases.
- the sequential nature of the computer approach cannot meet the demands imposed by the parallelism and consequent high "throughput" rates of the switching network we disclosed.
- the concentrator comprises a sorting network having input and output ports for sorting signal packets applied to the input lines in accordance with a priority field accompanying the signal packets, the sorting network causing signals with successively higher priority to be connected to successively higher order output ports, and the sorting network having a number of its input ports connected to the concentrator input lines and another number of its output ports connected to the concentrator output lines, a delay network having input terminals and output terminals, and connecting circuitry for connecting the delay network input terminals to some of the remaining ones of the sorting network output ports and the delay network output terminals to remaining ones of the sorting network input ports.
- a distributed prioritized concentrator To provide interconnection managing means for the high data rates of the switching network that effectively utilizes the available bandwidth of the communications paths among central offices, a distributed prioritized concentrator was invented. This concentrator accumulates incoming packets as necessary, sorts the accumulated packets in parallel based on the relative priority of the packets, and transmits as many of its highest priority packets to the next central office as there are communication channels to that central office.
- the prioritized concentrator comprises a parallel sorting network having some of its inputs connected to output ports of a central office and the remaining ones of its inputs connected to outputs of delay elements.
- a number of sorting network outputs are connected to communication channels leading to another central office and another number of sorting network outputs are connected to inputs of the delay elements.
- FIG. 1 depicts a block diagram of a generalized distributed prioritized concentrator operating in acco rdance wi th the pr inc iples o f thi s invent i on ;
- FIG. 2 depicts a block diagram of a distributed prioritized concentrator which utilizes a sort and a merge network in place of sorting network 30 in the FIG. 1 system.
- the header field contains an activity bit (indicating whether the packet contains a valid signal - "0" -, or no signal - "1") and an address field including a destination address subfield and possibly additional subfields, with the most significant bit residing in first bit position of each subfield.
- a priority subfield is included in the header which specifies the packet's priority. Also for purposes of this disclosure, it is assumed that the priority subfield resides at, or has been moved to, the beginning of the header, immediately following the activity bit. A high binary number in the priority subfield has been selected to represent high priority and, conversely, a low binary number to represent low priority.
- FIG. 1 presents a block diagram of a distributed prioritized concentrator embodying the principles of this invention.
- Sorting network 30 has a number of its inputs connected to a priority designation block 20 and the remaining ones of its inputs connected to outputs of a delay network 40.
- the inputs of priority designation block 20 are derived from the concentrator's input ports via a rate changing block 10.
- Priority designation block 20 assigns priorities to incoming packets when the concentrator interconnects central offices that do not assign packet priorities elsewhere.
- Rate changing block 10 is either a multiplexer or a demultiplexer, depending on the signal rates within and outside the concentrator. In some uses, neither block 10 nor block 20 would be required for the proper operation of the FIG. 1 concentrator.
- Sorting network 30 sorts the packets applied to its input terminals based on the priority of the packets as specified in the priority subfield. That is, sorting network 30 routes the applied signal packets so that a packet at output terminal M has a priority equal to or lower than the priority of a packet at output terminal M-1, and a priority equal to or higher than the priority of a packet at output terminal M+1. Thus, the left-most output terminal of sorting network 30 in FIG. 1 receives the packet having the lowest priority. As shown in FIG. 1, a number of the highest designated output terminals of sorting network 30 are connected to a rate changing block 50 through which they are transmitted to the next star. Rate changing block 50, like block 10, is either a multiplexer or a demultiplexer depending on the relative data rates of the distributed prioritized concentrator and the outgoing lines. It, too, may not be necessary in some applications.
- Each input in delay network 40 has a corresponding output in network 40, to which it is connected via a shift register 41.
- Each shift register 41 contains sufficient storage so that, in combination with the storage inherent in sorting network 30, exactly one packet is stored. This provides the appropriate feedback delay between the input to network 30, through delay network 40, and back to the input of network 30.
- the number of inputs and outputs of the concentrator, the incoming and outgoing packet rate and the iteration rate of sorting network 30 are all interrelated in a manner that may be appreciated from the discussion below. It yields a great deal of flexibility to this prioritized concentrator.
- the iteration rate of sorting network 30 is
- block 10 is a demultiplexer which converts m 1 lines at rate n 1 B to m 1 n 1 lines at rate B.
- block 50 is a multiplexer which converts m 2 n 2 lines at rate B to m 2 lines at rate n 2 B.
- m 2 is smaller than m 1 for, otherwise, there would be no need for a concentrator.
- the m 1 n 1 outputs of block 10 are connected through block 20 to the input terminals of sorting network 30. Therefore, when network 30 has N inputs, N-m 1 n 1 input terminals of network 30 are available to be connected to output terminals of delay network 40.
- the m 2 n 2 highest designation output terminals (carrying highest priority packets) are connected to rate changing block 50, the next N-m 1 n 1 highest designation output terminals are connected to delay network 40, and the remaining N- (m 1 n 1 +m 2 n 2 ) output terminals of network 30 are left unconnected.
- the size of sorting network 30, N is the user's choice, as long as it is larger than m 1 n 1 +m 2 n 2 .
- the prioritized concentrator can easily serve as a buffer between central offices that operate at different rates and, furthermore, that this ability is not dependent on any particular iteration rate within the prioritized concentrator.
- Priority designation block 20 is shown in FIG. 1 following rate changing block 10, but it can precede it.
- block 20 includes a digital clock and a register to connect each input line of block 20 to a corresponding output line of block 20.
- the size of each register equals the length of the priority subfield and, at the proper time, when the priority subfields of the packets traversing block 20 are in the registers, the clock time is inserted into the registers.
- the inverse of the activity bit may be used as part of the priority subfield. Active packet with activity bit "0" would automatically get a higher priority than inactive packets with activity bit "1". Alternatively, block 20 could detect empty packets (whatever their characteristics happen to be) and assign the lowest priority to those packets.
- FIG. 1 may follow conventional design.
- block 10 and 50 may be implemented with data selectors (e.g., TTL logic 74150 ICs) , data distributors (e.g., 74154 ICs) , and shift registers in a straight forward manner.
- Sorting network 30 may be implemented as taught by K. E. Batcher in "Sorting Networks and Their Applications", Spring Joint Computer Conference Proceedings, 1968, pages 307 et seq.
- the structure of sorting network 30 is matrix like, with rows and columns and with a number of elements in each row, N, being equal to the number of input terminals of the network, and a number of rows that is monotonically increasing with N. Hence, the number of switching elements in network 30 is N times the number of rows.
- sorting network 30 of FIG. 1 can be replaced with a much smaller sorting network that is followed by a simpler merge network.
- sorting network 30 is replaced with a sorting network 70 that sorts only the m 1 n 1 lines of block 20 (where m 1 n 1 ⁇ N) and a merge network 60 that merges the output signals of sorting network 70 and of delay network 40.
- Network 60 is of width N but requires many fewer switching elements than a sorting network of the same width because its two input sets are already sorted. Implementation of merge network 60 can follow any one of standard approaches. One approach is described by Batcher in the aforementioned publication.
Abstract
A distributed prioritized concentrator that manages the flow of information through high data rate communications paths. The concentrator accumulates incoming packets as necessary, sorts the accumulated packets in parallel based on the relative priority of the packets, and transmits as many of its highest priority packets as there are available communication channels. In its simplest form the prioritized concentrator comprises a parallel sorting network (30) having some of its inputs connected to accept incoming signal packets and the remaining ones of its inputs connected to outputs of delay elements (41). A number of the highest priority sorting network outputs are connected to outgoing communication channels (50), a number of lower priority sorting network outputs are connected to inputs of the delay elements (41) and the remaining number of lowest priority sorting network outputs are left unconnected. More sophisticated forms which add various capabilities are also disclosed.
Description
A DISTRIBUTED PRIORITIZED CONCENTRATOR
This invention relates to a prioritized concentrator having input and output lines. With the burgeoning of electronic technologies, the demand for a wider variety of communications services has been steadily rising. New technologies have been continually developing to meet these demands including lasers, fiber optics, microprocessors, and very large scale integrated circuits. While many alternative approaches for realizing the new communications services are available, digital data transmission seems to be the one best equipped for future progress and, accordingly, digital transmission is currently receiving the most attention. In terms of the services to be offered, it is expected that, in addition to standard telephone services, a multitude of low, medium and wide bandwidth services would be introduced. This would include electronic mail, facsimile, high-fidelity audio, computerized data base searches (e.g., want ads, encyclopedia, travel arrangements, etc.), remote shopping, electronic banking and home computer networks. Business users would also use electronic blackboards, teleconference facilities, word processors, and large computer communication networks. A number of approaches are employed in the prior art to manage the communication interconnections between central offices. One approach uses high capacity lines to interconnect central offices, but this is inefficient because most of the time some capacity is idle. The inefficiency is reduced in a variation on this approach which switches the information onto a small number of lines, taking advantage of the fact that not all of the lines are active simultaneously. This is the classic concentration function. It improves the utilization of the communication paths at the cost of possible blocking of signals.
To reduce blocking of particularly vital signals, a third approach employs a computer to sequentially examine incoming lines, store the applied signal packets in a prioritized queue in the computer's memory and transmit the highest priority packets to its outgoing lines, as they become available. The difficulty with this approach is that a statistical multiplexer must scan the input, properly queue the data, and manage the outgoing lines in essentially a simultaneous manner. This becomes more and more difficult as the data rate increases or the number of incoming and outgoing lines increases. With present technology, the sequential nature of the computer approach cannot meet the demands imposed by the parallelism and consequent high "throughput" rates of the switching network we disclosed.
The problems are solved in accordance with the invention in a prioritized concentrator in which the concentrator comprises a sorting network having input and output ports for sorting signal packets applied to the input lines in accordance with a priority field accompanying the signal packets, the sorting network causing signals with successively higher priority to be connected to successively higher order output ports, and the sorting network having a number of its input ports connected to the concentrator input lines and another number of its output ports connected to the concentrator output lines, a delay network having input terminals and output terminals, and connecting circuitry for connecting the delay network input terminals to some of the remaining ones of the sorting network output ports and the delay network output terminals to remaining ones of the sorting network input ports. Summary of the Invention
To provide interconnection managing means for the high data rates of the switching network that effectively utilizes the available bandwidth of the communications paths among central offices, a distributed prioritized
concentrator was invented. This concentrator accumulates incoming packets as necessary, sorts the accumulated packets in parallel based on the relative priority of the packets, and transmits as many of its highest priority packets to the next central office as there are communication channels to that central office.
In its simplest form the prioritized concentrator comprises a parallel sorting network having some of its inputs connected to output ports of a central office and the remaining ones of its inputs connected to outputs of delay elements. A number of sorting network outputs are connected to communication channels leading to another central office and another number of sorting network outputs are connected to inputs of the delay elements. More sophisticated forms which add various capabilities are, of course, possible and some of these capabilities are incorporated in this disclosure. Brief Description of the Drawing
FIG. 1 depicts a block diagram of a generalized distributed prioritized concentrator operating in acco rdance wi th the pr inc iples o f thi s invent i on ; and
FIG. 2 depicts a block diagram of a distributed prioritized concentrator which utilizes a sort and a merge network in place of sorting network 30 in the FIG. 1 system.
Detailed Description
The following description of the prioritized concentrator is that the signals described below flow in packets which contain a header field and a data field. The header field contains an activity bit (indicating whether the packet contains a valid signal - "0" -, or no signal - "1") and an address field including a destination address subfield and possibly additional subfields, with the most significant bit residing in first bit position of each subfield. For purposes of the prioritized concentrator disclosed herein a priority subfield is included in the header which specifies the packet's priority. Also for
purposes of this disclosure, it is assumed that the priority subfield resides at, or has been moved to, the beginning of the header, immediately following the activity bit. A high binary number in the priority subfield has been selected to represent high priority and, conversely, a low binary number to represent low priority.
FIG. 1 presents a block diagram of a distributed prioritized concentrator embodying the principles of this invention. Sorting network 30 has a number of its inputs connected to a priority designation block 20 and the remaining ones of its inputs connected to outputs of a delay network 40. The inputs of priority designation block 20 are derived from the concentrator's input ports via a rate changing block 10. Priority designation block 20 assigns priorities to incoming packets when the concentrator interconnects central offices that do not assign packet priorities elsewhere. Rate changing block 10, as discussed below, is either a multiplexer or a demultiplexer, depending on the signal rates within and outside the concentrator. In some uses, neither block 10 nor block 20 would be required for the proper operation of the FIG. 1 concentrator.
Sorting network 30, whose output terminals are uniquely designated 0 through N-1 (starting with the left-most terminal in FIG. 1), sorts the packets applied to its input terminals based on the priority of the packets as specified in the priority subfield. That is, sorting network 30 routes the applied signal packets so that a packet at output terminal M has a priority equal to or lower than the priority of a packet at output terminal M-1, and a priority equal to or higher than the priority of a packet at output terminal M+1. Thus, the left-most output terminal of sorting network 30 in FIG. 1 receives the packet having the lowest priority. As shown in FIG. 1, a number of the highest designated output terminals of sorting network 30 are connected to a rate changing block 50 through which they
are transmitted to the next star. Rate changing block 50, like block 10, is either a multiplexer or a demultiplexer depending on the relative data rates of the distributed prioritized concentrator and the outgoing lines. It, too, may not be necessary in some applications.
Most of the remaining packets at the output terminals of sorting network 30, having lower priorities and appearing at network 30 output terminals having lower designations, are applied to delay network 40 and are fed back to sorting network 30 input terminals. Each input in delay network 40 has a corresponding output in network 40, to which it is connected via a shift register 41. Each shift register 41 contains sufficient storage so that, in combination with the storage inherent in sorting network 30, exactly one packet is stored. This provides the appropriate feedback delay between the input to network 30, through delay network 40, and back to the input of network 30.
When network 30 has an equal number of input and output terminals, a number of sorting network 30 output terminals with the lowest designations are left unconnected and packets appearing at these terminals are lost. These packets are, in effect, overflow packets. Thus, at each iteration of sorting network 30 (at whatever iteration rate that is suitable for network 30) , the current highest priority packets are transmitted to the next star, most of the other packets are fed back to the input, and overflow packets, if any, are discarded.
The number of inputs and outputs of the concentrator, the incoming and outgoing packet rate and the iteration rate of sorting network 30 are all interrelated in a manner that may be appreciated from the discussion below. It yields a great deal of flexibility to this prioritized concentrator. When the iteration rate of sorting network 30 is
B and packets applied to the prioritized concentrator arrive on m1 lines at rate n1B, block 10 is a demultiplexer
which converts m1 lines at rate n1B to m1n1 lines at rate B. Similarly, when outgoing packets leave the prioritized concentrator on m2 lines at rate n2B, block 50 is a multiplexer which converts m2n2 lines at rate B to m2 lines at rate n2B. Of course, m2 is smaller than m1 for, otherwise, there would be no need for a concentrator. The m1n1 outputs of block 10 are connected through block 20 to the input terminals of sorting network 30. Therefore, when network 30 has N inputs, N-m1n1 input terminals of network 30 are available to be connected to output terminals of delay network 40.
On the output side of sorting network 30, the m2n2 highest designation output terminals (carrying highest priority packets) are connected to rate changing block 50, the next N-m1n1 highest designation output terminals are connected to delay network 40, and the remaining N- (m1n1+m2n2) output terminals of network 30 are left unconnected.
From the above it may be observed that the size of sorting network 30, N, is the user's choice, as long as it is larger than m1n1+m2n2. - Larger values of N, with the associated larger memories contained in delay network 40, permit keeping a larger number of low priority packets before they are either transmitted or discarded via the unconnected output terminals of sorting network 30. It may also be observed that the prioritized concentrator can easily serve as a buffer between central offices that operate at different rates and, furthermore, that this ability is not dependent on any particular iteration rate within the prioritized concentrator.
Priority designation block 20 is shown in FIG. 1 following rate changing block 10, but it can precede it.
Its implementation depends, of course, on the particular scheme selected for assigning priorities. One scheme may simply comprise a "time stamp" that is applied to each incoming packet. To implement such a scheme, block 20 includes a digital clock and a register to connect each
input line of block 20 to a corresponding output line of block 20. The size of each register equals the length of the priority subfield and, at the proper time, when the priority subfields of the packets traversing block 20 are in the registers, the clock time is inserted into the registers.
With respect to assigning priority to inactive packets which, of course, carry no information, the inverse of the activity bit may be used as part of the priority subfield. Active packet with activity bit "0" would automatically get a higher priority than inactive packets with activity bit "1". Alternatively, block 20 could detect empty packets (whatever their characteristics happen to be) and assign the lowest priority to those packets. Implementation of the various other blocks of
FIG. 1 may follow conventional design. For example, block 10 and 50 may be implemented with data selectors (e.g., TTL logic 74150 ICs) , data distributors (e.g., 74154 ICs) , and shift registers in a straight forward manner. Sorting network 30 may be implemented as taught by K. E. Batcher in "Sorting Networks and Their Applications", Spring Joint Computer Conference Proceedings, 1968, pages 307 et seq.
The structure of sorting network 30 is matrix like, with rows and columns and with a number of elements in each row, N, being equal to the number of input terminals of the network, and a number of rows that is monotonically increasing with N. Hence, the number of switching elements in network 30 is N times the number of rows.
The required number of switching elements can be reduced substantially when it is realized that the packets entering sorting network 30 from delay network 40 are already sorted. Capitalizing on this reduced entropy, sorting network 30 of FIG. 1 can be replaced with a much smaller sorting network that is followed by a simpler merge network. As shown in FIG. 2, sorting network 30 is
replaced with a sorting network 70 that sorts only the m1n1 lines of block 20 (where m1n1<<N) and a merge network 60 that merges the output signals of sorting network 70 and of delay network 40. Network 60 is of width N but requires many fewer switching elements than a sorting network of the same width because its two input sets are already sorted. Implementation of merge network 60 can follow any one of standard approaches. One approach is described by Batcher in the aforementioned publication.
Claims
1. A prioritized concentrator having input and output lines;
CHARACTERIZED IN THAT the concentrator comprises: a sorting network (30) having input and output ports for sorting signal packets applied to the input lines in accordance with a priority field accompanying the signal packets, the sorting network causing signals with successively higher priority to be connected to successively higher order output ports, and the sorting network having a number of its input ports connected to the concentrator input lines and another number of its output ports connected to the concentrator output lines; a delay network (40) having input terminals and output terminals; and connecting circuitry for connecting the delay network input terminals to some of the remaining ones of the sorting network output ports and the delay network output terminals to remaining ones of the sorting network input ports.
2. A prioritized concentrator in accordance with claim 1 ,
CHARACTERIZED IN THAT the sorting network comprises a merge network having input and output ports, the sorting network output ports being connected to certain of the merge network input ports and the connecting circuitry connecting the delay network output terminals to other of the merge network input ports.
3. A prioritized concentrator in accordance with claim 1 ,
CHARACTERIZED IN THAT the delay network (40) comprises: a plurality of delay circuits (41) each of the delay circuits connecting an input terminal of the delay network, to an output terminal of the delay network.
4. A prioritized concentrator in accordance with claim 1 ,
CHARACTERIZED IN THAT the number of the sorting network output ports is smaller than the number of the sorting network input ports.
5. A prioritized concentrator in accordance with claim 1 ,
CHARACTERIZED IN THAT the concentrator further comprising: first multiplexing circuitry connected to each of the concentrator input lines for changing the rate of time division multiplexed signal packets on the input lines before applying them to the sorting network input ports; and second multiplexing circuitry connected to the another number of the storing network output ports for changing the rate of time division multiplexed signal packets on the another number of the output ports before applying them to the concentrator output lines.
6. A prioritized concentrator in accordance with claim 1 ,
CHARACTERIZED IN THAT the number of the sorting network input ports connected to the concentrator input lines is larger than the another number of the output ports connected to the concentrator output lines.
7. A prioritized concentrator in accordance with claim 1 , CHARACTERIZED IN THAT the concentrator further comprising: a priority controlling circuit interposed between the concentrator input lines and the sorting network input ports connected to the concentrator input lines.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE8484901481T DE3484413D1 (en) | 1983-03-28 | 1984-03-08 | CONCENTRATOR WITH PRIORITY DISTRIBUTION. |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US06/479,858 US4472801A (en) | 1983-03-28 | 1983-03-28 | Distributed prioritized concentrator |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1984004014A1 true WO1984004014A1 (en) | 1984-10-11 |
Family
ID=23905729
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1984/000347 WO1984004014A1 (en) | 1983-03-28 | 1984-03-08 | A distributed prioritized concentrator |
Country Status (9)
Country | Link |
---|---|
US (1) | US4472801A (en) |
EP (1) | EP0138950B1 (en) |
JP (1) | JPS60500935A (en) |
KR (1) | KR920005106B1 (en) |
CA (1) | CA1207876A (en) |
DE (1) | DE3484413D1 (en) |
ES (1) | ES8501592A1 (en) |
IT (1) | IT1173759B (en) |
WO (1) | WO1984004014A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0275678A1 (en) * | 1986-12-31 | 1988-07-27 | AT&T Corp. | Packet switching system arranged for congestion control through bandwidth management |
EP0275679A1 (en) * | 1986-12-31 | 1988-07-27 | AT&T Corp. | Packet switching system arranged for congestion control |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4965825A (en) | 1981-11-03 | 1990-10-23 | The Personalized Mass Media Corporation | Signal processing apparatus and methods |
USRE47642E1 (en) | 1981-11-03 | 2019-10-08 | Personalized Media Communications LLC | Signal processing apparatus and methods |
US7831204B1 (en) | 1981-11-03 | 2010-11-09 | Personalized Media Communications, Llc | Signal processing apparatus and methods |
US4774705A (en) * | 1982-10-21 | 1988-09-27 | Communications Satellite Corporation | Switch matrix with acoustic delay for TDMA signal storage on-board a satellite |
US4644533A (en) * | 1985-05-06 | 1987-02-17 | American Telephone & Telegraph Company | Packet switch trunk circuit queueing arrangement |
US4670871A (en) * | 1985-06-27 | 1987-06-02 | American Telephone And Telegraph Company, At&T Bell Laboratories | Reliable synchronous inter-node communication in a self-routing network |
US4821258A (en) * | 1986-08-06 | 1989-04-11 | American Telephone And Telegraph Company At&T Bell Laboratories | Crosspoint circuitry for data packet space division switches |
ZA883232B (en) * | 1987-05-06 | 1989-07-26 | Dowd Research Pty Ltd O | Packet switches,switching methods,protocols and networks |
US4797880A (en) * | 1987-10-07 | 1989-01-10 | Bell Communications Research, Inc. | Non-blocking, self-routing packet switch |
US4891803A (en) * | 1988-11-07 | 1990-01-02 | American Telephone And Telegraph Company | Packet switching network |
US5148428A (en) * | 1989-05-02 | 1992-09-15 | Bell Communictions Research, Inc. | Modular architecture for very large packet switch |
US5121383A (en) * | 1990-11-16 | 1992-06-09 | Bell Communications Research, Inc. | Duration limited statistical multiplexing in packet networks |
US5256958A (en) * | 1991-11-26 | 1993-10-26 | At&T Bell Laboratories | Concentrator-based growable packet switch |
US5416769A (en) * | 1993-07-13 | 1995-05-16 | At&T Corp. | Controlled-feedback packet switching system |
US6862622B2 (en) | 1998-07-10 | 2005-03-01 | Van Drebbel Mariner Llc | Transmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PTMP) transmission system architecture |
US6640248B1 (en) | 1998-07-10 | 2003-10-28 | Malibu Networks, Inc. | Application-aware, quality of service (QoS) sensitive, media access control (MAC) layer |
US6452915B1 (en) | 1998-07-10 | 2002-09-17 | Malibu Networks, Inc. | IP-flow classification in a wireless point to multi-point (PTMP) transmission system |
US6680922B1 (en) | 1998-07-10 | 2004-01-20 | Malibu Networks, Inc. | Method for the recognition and operation of virtual private networks (VPNs) over a wireless point to multi-point (PtMP) transmission system |
US7911960B1 (en) | 1999-08-13 | 2011-03-22 | International Business Machines Corporation | Delayed-start method for minimizing internal switch congestion |
US6975621B2 (en) * | 2001-03-20 | 2005-12-13 | Motorola, Inc | Method to optimally select bandwidth and priority for voice message packets in a voice over IP network |
EP2228449B1 (en) | 2007-11-30 | 2013-05-08 | Toyota Jidosha Kabushiki Kaisha | Ethanol production process, and yeast for ethanol production |
CN106033465B (en) | 2015-03-19 | 2019-09-17 | 阿里巴巴集团控股有限公司 | A kind of information-pushing method and device |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3428946A (en) * | 1965-08-26 | 1969-02-18 | Goodyear Aerospace Corp | Means for merging data |
FR2497041A1 (en) * | 1980-12-18 | 1982-06-25 | Centre Nat Rech Scient | Synchronous statistical concentrator for data transmission - uses microprocessor for control and to vary interrogation period or number of characters for optimum transmission efficiency |
-
1983
- 1983-03-28 US US06/479,858 patent/US4472801A/en not_active Expired - Lifetime
-
1984
- 1984-03-08 DE DE8484901481T patent/DE3484413D1/en not_active Expired - Fee Related
- 1984-03-08 CA CA000449122A patent/CA1207876A/en not_active Expired
- 1984-03-08 JP JP59501364A patent/JPS60500935A/en active Granted
- 1984-03-08 WO PCT/US1984/000347 patent/WO1984004014A1/en active IP Right Grant
- 1984-03-08 EP EP84901481A patent/EP0138950B1/en not_active Expired - Lifetime
- 1984-03-26 IT IT20237/84A patent/IT1173759B/en active
- 1984-03-27 ES ES531027A patent/ES8501592A1/en not_active Expired
- 1984-03-28 KR KR1019840001610A patent/KR920005106B1/en not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3428946A (en) * | 1965-08-26 | 1969-02-18 | Goodyear Aerospace Corp | Means for merging data |
FR2497041A1 (en) * | 1980-12-18 | 1982-06-25 | Centre Nat Rech Scient | Synchronous statistical concentrator for data transmission - uses microprocessor for control and to vary interrogation period or number of characters for optimum transmission efficiency |
Non-Patent Citations (1)
Title |
---|
Spring Joint Computer Conference Proceedings, issued 1968, K.E. BATCHER, Sorting Networks and Their Applications, see pages 307-314 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0275678A1 (en) * | 1986-12-31 | 1988-07-27 | AT&T Corp. | Packet switching system arranged for congestion control through bandwidth management |
EP0275679A1 (en) * | 1986-12-31 | 1988-07-27 | AT&T Corp. | Packet switching system arranged for congestion control |
Also Published As
Publication number | Publication date |
---|---|
IT8420237A0 (en) | 1984-03-26 |
EP0138950B1 (en) | 1991-04-10 |
CA1207876A (en) | 1986-07-15 |
KR920005106B1 (en) | 1992-06-26 |
EP0138950A4 (en) | 1988-05-26 |
ES531027A0 (en) | 1984-12-16 |
JPH0574977B2 (en) | 1993-10-19 |
DE3484413D1 (en) | 1991-05-16 |
JPS60500935A (en) | 1985-06-20 |
EP0138950A1 (en) | 1985-05-02 |
IT1173759B (en) | 1987-06-24 |
US4472801A (en) | 1984-09-18 |
ES8501592A1 (en) | 1984-12-16 |
KR840008238A (en) | 1984-12-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0138950B1 (en) | A distributed prioritized concentrator | |
Turner | Design of a broadcast packet switching network | |
EP0138949B1 (en) | A wideband digital switching network | |
Hui | Switching and traffic theory for integrated broadband networks | |
Chaney et al. | Design of a gigabit ATM switch | |
US5461615A (en) | Asynchronous switching node distributing cells dynamically to outputs constituting an irregular group | |
KR970000792B1 (en) | Packet switch | |
US5406556A (en) | Output buffered packet switch with a flexible buffer management scheme | |
US6049542A (en) | Scalable multistage interconnection network architecture and method for performing in-service upgrade thereof | |
US5856977A (en) | Distribution network switch for very large gigabit switching architecture | |
CA2224606C (en) | A distributed buffering system for atm switches | |
EP0256701B1 (en) | Crosspoint circuitry for data packet space division switches | |
US20100034208A1 (en) | Buffered Crossbar Switch With a Linear Buffer to Port Relationship that Supports Cells and Packets of Variable Size | |
JPH01109939A (en) | Sorting unit for exchange node | |
US5715251A (en) | Local network including concentric main and relief rings | |
WO1993006675A1 (en) | Nonblocking multicast fast packet/circuit switching networks | |
EP0782299A2 (en) | System and method for capacity management in multi-service networks | |
Rahnema | The fast packet ring switch: A high-performance efficient architecture with multicast capability | |
US6580714B1 (en) | Concentrator type ATM switch for an ATM switching system | |
Wong et al. | Pipeline banyan-a parallel fast packet switch architecture | |
KR100378588B1 (en) | Asynchronous transfer mode switch and cell format | |
EP0442936A1 (en) | Distributed router of connectionless datagrams over connection oriented networks | |
Kwok | Tandem banyan switching fabric: A new high-performance fast packet switch and its performance evaluations | |
JP3079068B2 (en) | ATM switch | |
Lagman et al. | Aggressive transmission in the interconnected parallel banyan network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Designated state(s): JP |
|
AL | Designated countries for regional patents |
Designated state(s): BE CH DE FR GB NL SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1984901481 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1984901481 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 1984901481 Country of ref document: EP |