EP0442936A1 - Routeur reparti servant a l'acheminement de paquets de datagrammes, du type sans connexion, sur des reseaux a connexions - Google Patents

Routeur reparti servant a l'acheminement de paquets de datagrammes, du type sans connexion, sur des reseaux a connexions

Info

Publication number
EP0442936A1
EP0442936A1 EP89912760A EP89912760A EP0442936A1 EP 0442936 A1 EP0442936 A1 EP 0442936A1 EP 89912760 A EP89912760 A EP 89912760A EP 89912760 A EP89912760 A EP 89912760A EP 0442936 A1 EP0442936 A1 EP 0442936A1
Authority
EP
European Patent Office
Prior art keywords
data
datagram
router
connection data
output
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.)
Withdrawn
Application number
EP89912760A
Other languages
German (de)
English (en)
Other versions
EP0442936A4 (en
Inventor
Zigmantas Leonas Budrikis
Antonio Cantoni
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
QPSX Communications Pty Ltd
Original Assignee
QPSX Communications Pty Ltd
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
Application filed by QPSX Communications Pty Ltd filed Critical QPSX Communications Pty Ltd
Publication of EP0442936A1 publication Critical patent/EP0442936A1/fr
Publication of EP0442936A4 publication Critical patent/EP0442936A4/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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/5645—Connectionless

Definitions

  • This invention relates to the field of packet routers, in particular, to routers of datagram packets over a connection-oriented network, with plurality of hierarchical levels and plurality of routers at any hierarchical level distributable over the network.
  • LANs Local Area Networks
  • connectionless datagram communications are typically carried on by datagrams without prior set-up of connection between the communicating equipments. This is advantageous because of simplicity in protocol, requiring no set-up procedure, and because of speed of communication, obviating the time delay that would be incurred by the connection set-up. It is desirable to have the possibility of such connectionless datagram communications also over wide area, without limitations brought about by distance.
  • MANs Metropolitan Area Networks
  • B_ISDN Broadband 1 Integrated Services Digital Network
  • a MAN will provide integrated digital communications, 4 including datagram communication, typically over the area of 5 a city.
  • B_ISDN is intended to be universal and may 6 eventually subsume MANs, provided it will also offer 7 datagram communications.
  • the gamut of services by 8 the B_ISDN as presently conceived contains only connection- 9 oriented communications, with datagram communication only ' as 0 a specialist limited service rendered by a centralized 1 server on a subscription basis.
  • the invention disclosed here is of a router for 6 datagrams that is applicable to MANs and B_ISDN, though not 7 restricted in scope to those particular network 8 developments.
  • the present invention provides a network for 9 routing datagrams which include at least one segment, the 0 network comprising at least one segment switching means, and
  • the invention also provides a method of routing datagrams in a network having at least one segment switching means, and a plurality of routers connected between the switching means and a plurality of terminals, said method comprising processing data in a datagram transmitted from a first terminal so as to pass said datagram from a first router to a second router via said switching means and pass said datagram from said second router to a second terminal.
  • a central datagram server is generally envisaged for the purpose but this cannot perform satisfactorily and, in accordance with the invention a distributed routing scheme is provided.
  • the routing task of a datagram router can be reduced to directing the datagram to the appropriate other router when there is no diversity (i.e. only one possible path from source to destination), or to an appropriate other router when there is diversity. It has also been recognised that the datagram can be sent from the one router to the other over the connection-oriented network without requiring circuit set-up, provided a set-up circuit exists permanently between the two routers.
  • routers can be grouped into domains and that domains can be interconnected hierarchically. It has been further recognized that advantageously the routers should be logically at the edge of a domain and thus be edge devices having two distinct directions.
  • a router directed from domain j into domain i may be designated Rji. It is an edge device of both domains, j and i. It has its input socket from domain j and its output socket into domain i. Similar observations with reversed direction apply to router Rij .
  • a domain may comprise a fast packet switch or Asynchronous Transfer Mode Switch (ATM switch) having a plurality of input and output ports, all ports being interconnected.
  • ATM switch Asynchronous Transfer Mode Switch
  • An example of a fast packet switch is described in the article by "Starlite, A Wideband Digital Switch", A. Huang and S. Knauer, 1984 Proceedings of IEEE Conference on Global Telecommunications pp 5.3.1-5.3.5.
  • routing can be done everywhere on the basis of a global final destination address. Also, the process of routing can be done expeditiously provided that the address itself is subdivided into hierarchical subfields, as for instance, a fifteen digit number divided into three or four subfields approximating the existing practice in telephones numbering. It has been recognized that the task at any router is that of translating the final destination address to a route label that indicates the circuit on which the datagram has to be sent so as to reach the appropriate next router.
  • the translation can be done by look-up of candidate labels and of values of particular logical variables, associated with the candidate labels, minimally one label candidate associated with each subfield of the final destination address.
  • the actually applicable label can be determined by simple deduction based
  • This procedure of determining the applicable label amounts to a novel algorithm.
  • the translation carried out in accordance with this algorithm can be done at great speed so that the routing can be implemented on the fly even when datagrams are transmitted at 100 Mbit/s or even higher.
  • the present invention is applicable both when the datagrams are transmitted as variable length packets where all bits of the packet are transmitted contiguously and when the datagrams are segmented into parts.
  • the IEEE 802.6 and the B_ISDN schemes have segmentation into segments of fixed length and the detailed description of the invention which follows is for that case.
  • the invention also provides a router for a network for routing datagrams having at least one segment, said router comprising: first means for receiving said datagram and accessing said destination address from said datagram; second means responsive to said first means for determining output connection data (VCI_0UT) on the basis of said destination address; and third means for including said output connection data (VCI_0UT) in said datagram; said datagram being routed in said network on the basis of said output connection data (VCI_0UT) after being outputted from said router.
  • FIGURE 1 is a block diagram of a hierarchical network embodying the routing scheme of the invention
  • FIGURE 2 shows the format of an IEEE 802.6 standard segment
  • FIGURE 3 shows the format of an IEEE 802.6 MAC (Media Access Control) level packet header
  • FIGURE 4 shows the format of the CCITT E.164 service number
  • FIGURE 5A is an overview block diagram of a router circuit
  • FIGURE 5B is a block diagram the address-to-VCI translator embodying the principle of label translation of the invention
  • FIGURE 6 shows a block diagram of a reassembly message identifier determining circuit
  • FIGURE 7 shows a block diagram of a tag server which is part of the system of Figure 6
  • FIGURE 8 shows a logic circuit that may be used for the priority encoding called for in the scheme of Figure 5
  • FIGURE 9 shows a block schematic of the multiplexor of the scheme of Figure 5
  • FIGURE 10 is a
  • connection-oriented switched network which may be established especially for that purpose or which could exist to carry other communication traffic.
  • a Level zero domain may comprise a QPSX MAN referred to earlier.
  • the domains at Level one, two and three are shown as square boxes, Level one domains being labelled as 101 and 102, a Level two domain as 103 and a Level three domain as 104.
  • the system includes three Type I routers 111, 113 and 129 which take input from a Level zero domain and output into a Level one domain.
  • Type II routers ' examples of which are 112, 114 and' 130 take input from a Level one domain and output into Level zero domain.
  • Type III routers examples of which are 119, 120, 121, 122, 126 and 128, have inputs and outputs in Level one and higher domains. Inherent in the system of Figure 1 is the assumption that Level zero domains require no routing. Customers or end equipments are attached exclusively to Level zero domains. End equipments are illustrated by small circles, such as 91 and 92 attached to Level zero domain 81. There is no need for routing over these domains either because they have only one piece of end equipment or because it is a connectionless subnetwork, like that standardized as the IEEE 802.6 MAN, which supports connectionless datagram transfers. The latter alternative reduces the number of routers required for the overall scheme and is the more advantageous of the two.
  • the Level one domain, labelled 101 is illustrated with fixed circuits connecting the output socket of Router 113 to the input sockets of all Type II and Type III routers on the domain, except 114-, namely 112, 116, 118, 119 and 121. Similarly the input to Router 114 is shown connected to all outputs of Type I and III. Routers 113 and 114 have, been singled out for brevity;* similar lines go from each router to every other router in the domain, and similarly for the routers on domains 102, 103 and 104 but these are not shown in Figure 1 for clarity of illustration.
  • Router 113 on domain 101 of Figure 1 consider the instance of a datagram that has originated in domain 82 , that is intended to go beyond domain 82. It has to be routed by Router 113 to another router with input socket in domain 101. The routing is made on basis of the final destination address which is carried in the header of the datagram.
  • the rows represent groups of eight binary digits, or octets, with the sequence of transmission left to right and top to bottom.
  • the first seven octets, labelled 01-07, are segment header and of the remaining 46 octets, 44 are payloaded with data for transmission and 2 are a segment trailer.
  • a datagram may have any length up to 8000 octets and by the above is carried in segments 44 octet long.
  • the IEEE 802.6 Standard provides for two other classes of service besides connectionless datagram namely isochronous and connection-oriented non-isochronous.
  • the segments of all three classes share the segment header octets 01 through to 05.
  • Whether a segment is part of a connectionless datagram is indicated by a particular value of the final four bits of the VCI (Virtual Circuit Identifier) field 71, i.e. the first four bits of row 04. When these are all zeros, the segment is connectionless.
  • VCI Virtual Circuit Identifier
  • a datagram begins with octet 08 of an SSM or BOM segment and is started by an ISO (International Standards Organisation) Level 2 header followed by an ISO Level 3 header.
  • routing is on the basis of the final destination address. That address will in all cases be present in the Level 3 header. It is possible by the IEEE 802.6 Standard that the CCITT E.164 final destination address is also present in the Level 2 header, and the routing can then be done on the basis of that header. In the following description it is assumed that the latter applies. Should in a given circumstance the Level 2 header not have a final destination address then what is described here would be done with little change on the basis of the destination given in the Level 3 header.
  • Figure 3 shows the Level 2 header format conforming to the IEEE 802.6 Standard. There are seven fields altogether with only the destination address (DA) field 142 of immediate interest. It consists of two subfields, the first of four bits indicating the address type and the second a 60 bit subfield of address. When the address is according to CCITT E.164 then all 60 bit positions are taken up by the 15 binary-coded decimal numbers of that address. Its format is shown in Figure 4.
  • DA destination address
  • FIG. 5A is a block diagram of a router.
  • the router takes in segments serially having the format of Figure 2 on an uninterrupted time basis on input line 520, modifies them in the appropriate manner and puts them out serially on output line 538.
  • Input and output, in use, are continuous and regular, at the rate of the network transmission. For instance, if the rate is 44.210 Mbit/s, one of the standard net rates in public network digital transports and currently planned to be used in DQDB networks in North America, then the rate of segment input and output is 104, 269 segments/second.
  • a router with the architecture of Figure 5A and with components of the invention is feasible at that and higher rates, for instance 140 and 155 Mbit/s which are also currently contemplated in DQDB networks.
  • the input and output can be serial in individual bits or in groups of bits, for instance 8 bit groups or octets, and that will not alter the principles of the invention.
  • the router is comprised of identifiable standard components: latches 503 and 504, demultiplexers 506, 507 and 508, multiplexors 509, 510, 511, 512 and 513, and delays 541, 542, 543 and 544. It incorporates two systems of the invention: the address-to-VCI translator 501 and the packet re-assembler/label server 502. The timing of events in all components and the systems is under the control of Timing Control 505, which itself is synchronized to the bits or groups of bits and segment starts in the input.
  • Latch 503 captures S_Type, which is field 75 in the format of Figure 2 and indicates the segment type.
  • the contents of latch 503 provides an indication to Demultiplexer 506 and also to the systems 501, 502 and Multiplexor 513. If the segment is a single segment message (SSM) or a beginning of message (BOM), the Demultiplexer 506 puts the segment on line 521. If it is a continuation of message (COM) or end of message (EOM) then it is put on line 522.
  • Delay 541 delays the segment sufficiently to allow a decision ' to be made, having regard to the contents of latch 503 as to which output to switch to in time for the arrival of the first bit of the " segment.
  • the segments leaving the router must have the same bit fields as they came in with, except for the VCI and M_ID which are fields 71 and 76 in Figure 2. Further exceptions are two .cyclic redundancy fields that are recalculated and changed. We assume that these are not done in the router but in a further unit that follows it. But of course that function could also be incorporated in the router system without altering the invention.
  • the segments leaving the router must have VCIs and M_ID's appropriate for their passage to their next immediate destination.
  • the VCIs are the labels by which the ATM switch, for instance 101 or 103 of Figure 1, transfers the segments from a given input port to intended output ports.
  • the M_ID's are the labels that logically link the separate segments of a message, and must be different for different messages that are concurrent or interleaved in their segments for a given source and destination.
  • the appropriate VCI is determined from the final destination address or subscriber number, such as that of 91 or 97 in Figure 1, which is carried at the head end of the message, i-e. at the start of field 77 of SSMs and BOMs.
  • the final destination is latched from the incoming SSM and BOM by Latch 504 and presented on line 527 to the Address-to-VCI Translator 501 which determines the appropriate VCI and puts it on line 528.
  • the SSM or BOM is demultiplexed in Demultiplexor 508 which places the VCI and M_ID that it has on entry on line 525 and the remaining fields on line 526.
  • VCI_IN and M_ID_IN on line 325 and VCI_OUT on line 528 are read into the Message Reassembler/Label Server 502, so that this unit is able to recognize the subsequent COMs and EOM of that same message and give to these the same VCI_OUT and M_ID_0UT as are given to the BOM.
  • the remaining fields on line 526 are applied via Delay 543 to Multiplexor 512 which multiplexes them with 1 VCI_0UT and M_ID_OUT to make up B0M_0UT.
  • the M_ID_OUT is
  • the M_ID is in all cases a null
  • Reassembler/Label Server 502 which supplies the appropriate 0 (null) M_ID_0UT for the SSM. Therefore SSM_0UT is formed by 1 the same multiplexing as is B0M_0UT and appears on the same 2 line 536.
  • VCI_IN, M_ID_IN are input to the Reassembler/Label Server 502 which recalls the VCI_0UT and M_ID_0UT that had been given to the BOM segment of that message.
  • VCI_0UT and M_ID_OUT are multiplexed in Multiplexor 510 and* the output of this multiplexor is multiplexed with the remaining fields of the segment, C0M_R_IN or E0M_R_IN in Multiplexor 511 which places the resulting segment, C0M_0UT or E0M_0UT on line 535.
  • Multiplexor 513 selects for output as SEG_0UT on line 538 the input either on line 536 or 535, whichever is appropriate by the S_Type indication on line 540.
  • Demultiplexing and multiplexing are shown in Figure 5A ' as being performed in progressive stages. This is for the sake of description only. In actual implementation all of the demultiplexing, shown in units 506, 507 and 508, would be more effectively done in a single demultiplexer, and of all the multiplexing, shown in units 509-513, in a single multiplexor. Also for the sake of description only, B0M_R_IN and SSM_R_IN are shown as distinct from COM_R_IN and E0M_R_IN. In implementation they would not be distinguished and would be on common line. Hence the two 1 delays 542 and 543 would also be a single delay. 2
  • 19 segments may quite arbitrarily be any of the four types, 20 BOM, * SSM, COM or ' EOM, the tasks performed with respect to a
  • 34 address has 60 bits, the number of possible different
  • 35 addresses is 2 60 or 10 18 .
  • the destination address D_ADDR on line(s) 522 is demultiplexed into the (n+1) fields, FieldJ), Field_l...Field i on lines 211,214, ...216. These fields are presented as addresses to the random access memories 221,222, ...225,226. From each memory a read-out is made of a candidate VCI, VCI_0 on line 244, VCI_1 on line 234,...VCI-n on line 236. Also read out from each memory is a logical variable, I Q on line 243, I on line 244,...,I n on line 246.
  • the candidate VCIs are input to the multiplexor MUX 270 and the logical variables to the logical unit 250.
  • the logical unit produces control signals on lines 260 which collectively select the appropriate VCI and this becomes VCIJDUT on the multiplexor output lines 528.
  • the VCI and logical variables stored and retrieved from the memories are dependent on the particular partitioning of the address _ and the particular interconnections of hierarchical domains that are made.
  • the task of writing to the memories would be done by a network management system.
  • the selection of the VCI is for the case where the partitioning of the address is strictly hierarchical and where furthermore this partitioning corresponds exactly to the hierarchical division into domains.
  • the logical variable is then simply a single binary bit indicating whether a routing to at least that level is indicated and the selection is then effected by a priority encoding by the logical unit or priority encoder 250.
  • the task of priority encoding is known and can be - understood from the following mathematical description of the function of a priority encoder.
  • FIG. 8 A realization of the encoder is given in Figure 8.
  • the logical variables I l t to I 7 are put on lines 285 through 291. These or their negations or inverses, as for instance the negation of I ⁇ 2 by the "negator or inverter 292, are put in the different combinations shown to the OR gates 300 to 304.
  • the outputs of the OR gates along with certain combinations of 1- j 's or negation I- j 's are input to the AND gates 305, 306 and 307 that produce as their outputs and put on lines 308, 309 and 310 respectively XQ, X and 2 .
  • the label selection is implemented by the multiplexor 270 of Figure 5B.
  • a realization of a multiplexer for the simplified case of selecting one from four sixteen bit labels is illustrated in Figure 9.
  • XQ and x j *_ are presented to the decoder 410.
  • XQ x components
  • X-**_ one particular output line 421, 422, 423 or 424 is asserted.
  • Table II. 1 These lines are applied to the ENABLE inputs of tri-state
  • VCI_0, VCI_1, VCI_2 and VCI_3 respectively VCI_0, VCI_1, VCI_2 and VCI_3 and depending on
  • 30 line 524 are presented to and are demultiplexed by 310 and
  • N-L k2 m +12 n + n2 ⁇ k+1 ) + m2( k+1 ) (4)
  • N 2 (m+n) 2 ⁇ m+n > (5)
  • N ⁇ is very much smaller than N 2 .
  • N**L is approximately eleven million, while N 2 is in excess of 5 x 10 11 or five hundred thousand million.
  • the four servers 317, 318, 325 and 326 in the block schematic ' of Figure 6 are all similar circuits differing only in numerical sizes of memories and lines and can be understood with the help of Figure 7.
  • the Key 350 in Figure 7 represents any one of the inputs VCI_IN 311 or M_ID_IN 312 or combined VCI TAG and M_ID_IN TAG 324 of Figure 6.
  • the TAG 396 in Figure 7 represents respectively the VCI TAG 322 or M_ID_IN TAG 323 or VCIJDUT 327 or M_ID_0UT 328 of Figure 6.
  • the key 350 is applied on bus 356 as address selection to Count RAM 340 and on bus 355 as address selection to Label RAM 365.
  • This enables the read-out and write-in of data stored at the selected memory locations.
  • a count value 347 from the RAM 340 is read out into a counter 346, and a label value 389 from the RAM 365 is read into Tag_latch 395.
  • Writing into the RAMs and operation of the counter 346, latch 395 and TAG_FIF0 380 are under the control of a controller 385.
  • the controller 385 receives segment type indication on bus 397. It also receives on bus -390 the Tag value as read out from the Label RAM 365, and on bus 348 the updated count value produced by the counter 346. It also has the possibility of input of externally generated labels on bus 399.
  • controller 385 outputs the error code on bus 386 and the New_output indication on line 387.
  • the controller can be a micro-programed processor with a wide choice of specific embodiments.
  • FIG. 10A to 10D A flow diagram of the program is illustrated in Figures 10A to 10D.
  • the tag server and actions of its controller 385 may be explained more fully by reference to Figure 7 for the case of a VCI TAG server i.e. the server 317 of Figure 6.
  • the Key 350 appearing on buses 355 and 356 is then the VCI as it has come in the header of the current segment. If the segment is a COM (continuation of message), the Label read out from the Label RAM 365 is non-zero, and previously stored for that VCI. The Count read-out of the Count RAM 340 is also non-zero. The .controller checks if the read out Label and Count are non-zero. If either or both were zero that would signify an error condition and the controller would signal it by producing an error code on bus 386.
  • the controller issues a Load command on the line 394 and the VCIJTAG is latched into the Tag_latch 395.
  • the segment is a BOM (beginning of message) there may or may not be a VCIJTAG for it. If there is, then the Count and Label, as read out, are non-zero. In that case the Controller will latch the VCIJTAG into the Tag_Latch 395 as before. It will also put an Increment command on the line 343 which increase the Count of the counter 346 by one. Following this the controller will put a Write command on the line 341 to write the updated Count into the Count RAM 340. If there is no VCIJTAG for the given VCI, then the Count and Label, as read out are zero, and a VCIJTAG has to be assigned.
  • Assigning of the VCIJTAG occurs from the TAG_FIF0 380 on command from the controller. Assuming the TAG_FIF0 380 is not empty, the next in line unused VCIJTAG is read out by command on line 370 onto bus 366, and by command on line 360, it is written into the Label RAM 365 which also makes the VCIJTAG appear on the bus 389. The valid VCIJTAG is now latched into the Tag_Latch 395. Also the Count is incremented making it one, and written into the Count RAM 340 as before.
  • TAG_FIF0380 Should the TAG_FIF0380 be empty when a BOM arrives and assigning of a tag is necessary, then no assignment can be made. It will be an error condition that will result in the loss of that message.
  • the numerical size of the TAG space can be selected so as to ensure that the possiblity of ' running into depletion is of negligible probability.
  • the segment is an EOM (end of message)
  • the conditions and actions in reading the Label RAM 365 are the same as for a COM. But there is the possibility that the tag becomes free and is returned to the pool.
  • the controller 385 puts a Decrement command on the line 344 to the counter 346. This reduces the Count by one and the updated Count is written into the Count RAM 340.
  • Tag_Latch 395 If the resulting Count equals zero then the Tag has become free.
  • the tag is latched into the Tag_Latch 395 and also by Write command on the line 391 written into the TAG_FIFO 380. Following this, an all-zeros tag is put by the controller on the bus 366 and by Write command on line 360 written into Label RAM 365.
  • the operation of the other two servers in Figure 6, the M_ID_IN TAG server 318 and the M_ID_0UT server 326, are similar and can be understood by analogy.
  • the M_ID_0UT server 326 differs from the other two only in that M_ID_0UT labels are limited in, their total number by the number allocated to the server * by an external manager (not shown) and not the size of space. Labels can be brought in from an outside source via label in bus 399 and into the TAG_FIF0 380 via bus 372.
  • the Key comprised of VCIJTAG and M_ID_TAG, is unique for a particular datagram and the Count will be one for a particular Key following BOM and go back to zero, following EOM.
  • the function of the Count RAM 340 is nil and may be dispensed with in this case.
  • the VCIJDUT server differs from the M_ID_0UT server only that it does not have a pool of labels and therefore does not require the service of a TAG_FIF0. Also, in common with the M_ID_0UT server, it does not require a COUNT RAM.
  • a VCIJDUT is determined by the system of Figure 5 on entry of BOM. It is passed to the Controller of the VCIJDUT server via bus 399 as shown in Figure 7. The Controller writes it via bus 366 into label RAM 365. On arrival of EOM, that address location is zeroed, again via bus 366.
  • three types of router, Types I, II and III have been described, it will be appreciated that a generic embodiment is possible. By appropriate change of executable programs in the controllers a generic router can be changed from one type to another.
  • connectionless zero level domains can be dispensed with by connecting the end equipment directly to the routers, one pair of routers for each separate end equipment but this is less favourable in that it requires a substantially larger number of routers.
  • the zero level domains act as concentrators, allowing one router to serve a large number of equipments while at the same time providing a connectionless switched service for intradomain communication.
  • the concentration function can also be achieved by a connection-oriented domain with a simplified routing function from the separate end equipments, if all connectionless messages are sent to a single router. The router then approximates the central connectionless server.
  • connection-oriented concentrator does not itself provide any connectionless intradomain communication, and the router functionality has to be accordingly enlarged to provide it.

Landscapes

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

Abstract

Le réseau, qui sert à l'acheminement ou routage de datagrammes composés d'au moins un segment, comprend au moins un organe de commutation de segments (101 ... 104) et plusieurs routeurs (111 ... 130) connectés entre l'organe de commutation (101 ... 104) et plusieurs terminaux (91 ... 98) et destinés à traiter les données contenues dans un datagramme transféré depuis un premier terminal (91). On peut ainsi faire passer le datagramme d'un premier routeur (111) à un second routeur (118) via l'organe de commutation (101 ... 104) et du second routeur (118) à un second terminal (96). La présente invention prévoit également un procédé de routage de datagrammes, dans lequel le routage des datagrammes s'effectue par l'intermédiaire d'un agencement hiérarchique d'organes de commutation sur la base de leurs adresses de destination finale. Un routeur, servant à connecter les organes de commutation et à traiter l'adresse de destination finale pour permettre le transfert des datagrammes à travers le réseau, est également décrit.
EP19890912760 1988-11-10 1989-11-10 Distributed router of connectionless packets over connection oriented networks Withdrawn EP0442936A4 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
AUPJ139688 1988-11-10
AU1396/88 1988-11-10

Publications (2)

Publication Number Publication Date
EP0442936A1 true EP0442936A1 (fr) 1991-08-28
EP0442936A4 EP0442936A4 (en) 1992-12-09

Family

ID=3773497

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19890912760 Withdrawn EP0442936A4 (en) 1988-11-10 1989-11-10 Distributed router of connectionless packets over connection oriented networks

Country Status (3)

Country Link
EP (1) EP0442936A4 (fr)
CA (1) CA2002729A1 (fr)
WO (1) WO1990005419A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0521027A4 (en) * 1990-03-22 1994-10-19 Australian & Overseas Telecom Multicasting method for a telecommunications network
JP2752522B2 (ja) * 1990-12-20 1998-05-18 富士通株式会社 広帯域ｉｓｄｎにおけるフロー制御方式
US20020101871A1 (en) 1991-01-31 2002-08-01 Fujitsu Limited Connectionless communication system
WO1995033324A2 (fr) * 1994-05-23 1995-12-07 British Telecommunications Public Limited Company Reseau de telecommunications optique
JP3537318B2 (ja) 1998-07-24 2004-06-14 富士通株式会社 特定のコネクションの通信データを加工する交換機および交換方法

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0260043A2 (fr) * 1986-09-05 1988-03-16 AT&T Corp. Méthode de traitement d'un appel virtuel dans un central téléphonique privé

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4550397A (en) * 1983-12-16 1985-10-29 At&T Bell Laboratories Alternate paths in a self-routing packet switching network
BE904100A (fr) * 1986-01-24 1986-07-24 Itt Ind Belgium Systeme de commutation.
CA1254982A (fr) * 1986-05-14 1989-05-30 Northern Telecom Limited Methode de commutation d'informations et commutateur connexe
EP0253940B1 (fr) * 1986-06-25 1991-05-02 International Business Machines Corporation Méthode et système d'acheminement de blocs de données dans des réseaux de communication de données
CA1309519C (fr) * 1987-03-17 1992-10-27 Antonio Cantoni Transfert de messages dans un systeme a multiplexage
EP0335562B1 (fr) * 1988-03-31 1996-07-10 AT&T Corp. Architecture et organisation d'un réseau métropolitain de télécommunications par paquets à hautes performances

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0260043A2 (fr) * 1986-09-05 1988-03-16 AT&T Corp. Méthode de traitement d'un appel virtuel dans un central téléphonique privé

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
9TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION, Tel Aviv, 30th October - 3rd November 1988, pages 303-309, Elsevier Science Publishers B.V. (North-Holland), NL; A. ALBANESE et al.: "A routing strategy for interconnecting high-speed metropolitan area networks" *
PROCEEDINGS OF THE IEEE, vol. 71, no. 12, December 1983, pages 1365-1371, IEEE, New York, US; A. LYMAN CHAPIN: "Connections and connectionless data transmission" *
See also references of WO9005419A1 *

Also Published As

Publication number Publication date
CA2002729A1 (fr) 1990-05-10
WO1990005419A1 (fr) 1990-05-17
EP0442936A4 (en) 1992-12-09

Similar Documents

Publication Publication Date Title
US5271004A (en) Asynchronous transfer mode switching arrangement providing broadcast transmission
US5307343A (en) Basic element for the connection network of a fast packet switching node
US5394393A (en) Method for the routing of a packet of data in a digital transmission network
JP2880271B2 (ja) 帯域制御方法および回路
US5892932A (en) Reprogrammable switching apparatus and method
US5212686A (en) Asynchronous time division switching arrangement and a method of operating same
US5446738A (en) ATM multiplexing system
US5724349A (en) Terabit per second ATM packet switch having out-of-band control with multi casting
US5687172A (en) Terabit per second distribution network
CA2112136C (fr) Commutateur atm a large bande a tampon d'entree
US5940389A (en) Enhanced partially self-routing algorithm for controller Benes networks
US5504743A (en) Message routing
US4845702A (en) Optical telecommunication package switching system using asynchronous techniques
US5321691A (en) Asynchronous transfer mode (ATM) switch fabric
US5768270A (en) ATM switch using synchronous switching by groups of lines
WO1992014319A1 (fr) Commutateur de paquets a capacite de telediffusion pour reseaux a mode de transfert asynchrone (atm)
JP2738762B2 (ja) 高速パケット交換機
US5642349A (en) Terabit per second ATM packet switch having distributed out-of-band control
Denzel et al. A highly modular packet switch for Gb/s rates
US6327261B1 (en) Translation process for an ATM cell header
EP0442936A1 (fr) Routeur reparti servant a l'acheminement de paquets de datagrammes, du type sans connexion, sur des reseaux a connexions
AU637988B2 (en) Distributed router of connectionless packets over connection oriented networks
US6683854B1 (en) System for checking data integrity in a high speed packet switching network node
Yang et al. BATMAN: A new architectural design of a very large next generation gigabit switch
Woo A novel switching architecture for ATM networks

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19910503

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH DE FR GB IT LI LU NL SE

A4 Supplementary search report drawn up and despatched

Effective date: 19921022

AK Designated contracting states

Kind code of ref document: A4

Designated state(s): AT BE CH DE FR GB IT LI LU NL SE

17Q First examination report despatched

Effective date: 19940929

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: QPSX COMMUNICATIONS LTD.

RIN1 Information on inventor provided before grant (corrected)

Inventor name: BUDRIKIS, ZIGMANTAS LEONAS

Inventor name: CANTONI, ANTONIO

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 19960601