High capacity data communication network and network node suitable for the same

Abstract: The invention relates to a high capacity data communication network and to a network node suitable for the same. The network is based on a parallel architecture, linking the nodes of the network itself, having a plurality of logic communication media, wherein for each communication medium a different node of the network is primarily either advantaged or at a disadvantage. In this way the fairness of the traffic handling is assured aside from the type of protocol used.

Description: The present invention relates to a high capacity data communication network and to a network node suitable for the same. In both local (LAN) and metropolitan (MAN) data communication networks, one of the factors to be taken into account in evaluating the communication protocol, is the possibility of a fair sharing of the communication medium capacity among the network nodes. For metropolitan area network a protocol, known as DQDB (Distributed Queueing Dual Bus), has been standardized by the IEEE 802.6 working group; for a detailed description of such protocol one may refer, e.g., to the book of Martin De Prycker titled "Asynchronous Transfer Mode: solution for Broadband ISDN", London, Ellis Horwood, Nov. 1990, para. 6.5 "DQDB", pages 246 to 255. Such a protocol is based upon a dual bus architecture, in which there are two network nodes that act also as head-end stations generating and erasing slots over and from the network, and in which all the network nodes transmit by capturing the free slots. One of the well known problems of such protocol is the "unfairness", i.e. the fact that some nodes of the network are favoured with respect to the others, more precisely: the nearer a node has a position on the bus close to the head-end station, the greater the probability of capturing a free slot will be; such advantage is reduced by the fact that the DQDB protocol has a slot-reserving mechanism. Several solutions to this problem are known from the literature; for a short review see, e.g., P. Davids et al., "Performance enhancement in DQDB networks", Proceedings EFOC/LAN '92, pages 223 to 228, Paris, 24-26/06/92; such solutions do not solve totally the problem; moreover they are not always easily and economically implementable. The data communication networks, in particular the metropolitan area networks, are nowadays required a higher and higher capacity in terms of traffic transportation. Several solutions have been proposed using optical fibers and WDM (Wavelength Division Multiplex) technique, among which the parallel architecture based on DQDB protocol set forth by S. Casale et al. in "A PARALLEL ARCHITECTURE FOR A DQDB MAN", Proceedings ICCC '92 pages 415 to 419, Genoa, 28/09 - 02/10/1992, is of particular interest. Also this parallel architecture has the problem of "unfairness" since it is composed of a plurality of dual buses all connected to the various nodes and using the DQDB protocol. It is an object of the present invention to overcome the drawbacks of the known art and, in particular, to provide a network in which the capacity of the communication medium can be fairly shared among the network nodes, without reducing the throughput of the network itself. This object is achieved through the data transmission network having the characteristics set forth in claim 1 or through the metropolitan network having the characteristics set forth in claim 4. Further advantageous aspects of the present invention are set forth in the subclaims. By using a parallel architecture to connect the nodes of a network having a plurality of logic communication media, in which for every communication medium a different network node is primarily either advantaged or at a disadvantage, the fairness is assured aside from the type of protocol used. In this manner, moreover, the capacity of the network not only is undiminished, but even increased. Advantageously the logic communication media can be implemented through a single optical fiber by using the WDM technique. The invention will become more apparent from the following description taken in conjunction with the attached drawing the sole figure of which shows an embodiment of a network, in accordance with the present invention, formed by three nodes. A data communication network always comprises a plurality of nodes and a communication medium designed to interconnect such nodes according to a communication protocol. It often happens that in data communication networks, at least one node has a preferential or penalizing condition as to the treatment of the traffic generated by it in relation to the connection with such communication medium; this can be due to the protocol, to the network topology, or both; in case of a DQDB network the node acting as a head station is in a primary preferential condition and the node acting as an end station is in a primarily penalizing condition; the same applies to any node of the network; in fact, this will be in a preferential condition with respect to nodes that are located downstream of its position on the bus and will be in a penalizing condition with respect to nodes that are located upstream of its position on the bus. The network in accordance with the present invention comprises at least one further communication medium designed to interconnect the nodes of the network according to the same communication protocol in such a way that a node of the network different from the preceding one is in the same preferential or penalizing condition as to the treatment of the traffic generated by it in relation to the connection with such further communication medium. The explanation as to how the teachings of the present invention can be applied to a DQDB network is given here with reference to the figure. The network illustrated in the figure comprises three nodes ST1, ST2, ST3 connected each other through three dual buses B1, B2, B3; each dual bus comprises two single buses respectively designated by suffixes "-L1" and "-L2": therefore, e.g., the dual bus B1 comprises the single buses B1-L1 and B1-L2. Assuming now to have at disposal a DQDB network formed by the three nodes ST1, ST2, ST3, and the dual looped bus B1; assuming in addition that node ST1 acts as head-end station for the dual looped bus B1. According to the teachings of the invention a second dual looped bus B2 has to be arranged and a node different from ST1 has to act as a head-end station: for instance node ST2. In order to reach the maximum fairness, it will be enough to see that the number of communication media comprised in the network is equal to the number of nodes of the network itself: still referring to the foregoing example, it will be necessary to arrange three dual buses B1, B2, B3 in which the three nodes ST1, ST2, ST3 act respectively as head-end stations. It is clear that in doing so the fairness of the network is no longer depending on the intrinsic fairness of the protocol; on the contrary, it can be even advantageous to use a strongly unfair, easy to implement protocol and have it to the network parallel structure to re-establish the fairness. It is particularly advantageous if the communication media are realized through a sole physical communication medium (a coaxial cable, an optical fiber, ...) using the known frequency division multiplexing technique. The metropolitan network based upon the above-mentioned teachings will now be described in accord with the present invention. Such metropolitan network comprises a set of nodes (e.g., ST1, ST2, ST3) and a first of looped buses (e.g. B1-L1, B2-L1, B3-L1); the buses of such first plurality are designed to interconnect the nodes according to a corresponding plurality of slot capturing schemes, and different nodes operate from slot generation/erasure stations for different schemes. One realization of such a metropolitan area network could be constituted by a parallel but simplified variant in the protocol of a DQDB network. The DQDB protocol is based upon the fact that information slots travel over one of the single buses and the reservations of information slots travel over the other bus in an opposite direction to the preceding one; such mechanism is then doubled thanks to the presence of two buses (see the afore-mentioned book for further details). Since the reservations serve to improve the network's fairness, they could be eliminated thanks to the parallel structure illustrated above and therefore also the second bus could be avoided. Naturally the ideal condition is when the number of buses of the first plurality is equal to the number of nodes of the set. More advantageously from the network reliability viewpoint (possibility of open-bus reconfiguration in case of failures), the metropolitan area network further comprises a second plurality of looped buses (e.g. B1-L2, B2-L2, B3-L2) corresponding to such first plurality; the buses of such pluralities are, two-by-two, designed to interconnect the network nodes according to a corresponding plurality of multiple-access distributed queues schemes (DQDB), and different nodes act as head-end stations for different schemes. A realization of such a metropolitan area network could consist in a parallel version of a DQDB network. Also in this instance, therefore, the slot reservation mechanism could be avoided. Such a realization would have the great advantage of increasing to a large extent the network capacity and fairness and of maintaining the compatibility with IEEE 802.6 standard. Such a plurality of buses can be advantageously realized through a sole physical communication medium using the frequency division multiplexing technique. In particular, due to high capacity needs, such physical communication medium can be an optical fiber and the used multiplexing technique is the wavelength division one. A preliminary statement is now made as to the word subset of a predetermined set which will be used hereinafter to designate a set including a number of components comprised between 1 and N-1, where N is the number of components of such predetermined set. Once a plurality of schemes has been prepared in advance, several variants to their use by the set of network nodes may arise, for instance: nodes belonging to a subset of the network transmit data by using only schemes belonging to a subset of the plurality, or nodes belonging to a subset of the network receive data by using only schemes belonging to a subset of the plurality. Naturally, the network according to the present invention needs special nodes to be able to operate, at least capable of interacting with a plurality of communication media and of schemes. In particular the network node in accord with the present invention is capable of transmitting and receiving data through a plurality of logic communication media according to the same slot-based protocol, and is such that, for at least one of the logic communication media, it acts as a slot generator. In addition, should the logic communication medium form a loop or a closed bus, it will act also as a slot eraser.

Claims: A data communication network comprising a plurality of nodes (ST1, ST2, ST3), and a plurality of parallel communication media (B1-L1, B2-L1, B3-L1); characterized in that each of said plurality of nodes communicates data through said plurality of communication media according to a distributed queue dual bus protocol; in that each of said plurality of communication media interconnects all of said plurality of nodes to bidirectionally cany transmifted data independently of a remainder of said plurality of communication media; in that each respective communication medium of said plurality of communication media has a different one of said plurality of nodes functioning as a respective head-end station of said respective communication medium; and in that said respective head-end shation has a highest priority to transmit data through said respective communication medium. Network according to claim 1, characterized in that it comprises a number of communication media equal to the number of nodes of said plurality. Network according to claim 1, characterized in that said communication media are realized through a sole physical communication medium by using the frequency division multiplexing technique. A metropolitan area network comprising : a set of nodes (ST1, ST2, ST3), and a first plurality of buses (B1-L1, B2-L1, B3-L1) interconnecting all of said set of nodes; characterized in that subsets of said set of nodes are defined within said set of nodes; in that each of said first plurality of buses is a looped bus; in that different ones of said set of nodes comprise means for generating and erasing time slots according to a respective scheme; in that each said respective scheme corresponds to one of said subsets of said set of nodes; in that each respective bus of said first plurality of buses has a different one of said set of nodes functioning as a respective head-end station of said respective bus; and in that said respective head-end station has a highest priority to transmit data over said respective bus. Metropolitan area network according to claim 4, characterized in that the number of buses of said first plurality is equal to the number of nodes of said set. Metropolitan area network according to claim 4, characterized in that it further comprises a second plurality of buses (B1-L2, B2-L2, B3-L2) corresponding to said first plurality, the buses of said pluralities being, two-by-two, designed to interconnect said nodes according to a corresponding plurality of multiple-access, distributed queues schemes, and in that the buses of said pluralities are looped buses and different nodes act as head-end stations for different schemes. Metropolitan area network according to claim 4, characterized in that a plurality of buses are realized through a sole physical communication media by using the frequency division multiplexing technique. Metropolitan area network according to claim 7, characterized in that said physical communication medium is an optical fiber and in that the multiplexing technique is the wavelength division multiplexing. Metropolitan area network according to claim 5, characterized in that nodes belonging to a subset of said set are designed to transmit data by using only schemes belonging to a subset of said plurality. Metropolitan area network according to claim 5, characterized in that nodes belonging to a subset of said set are designed to receive data by using only schemes belonging to a subset of said plurality.

Inventors: GABRIAGUES JEAN-MICHEL, MASETTI FRANCESCO, GABRIAGUES, JEAN-MICHEL, MASETTI, FRANCESCO
Applicants: CIT ALCATEL, ALCATEL
Application year: 1994
Main classification: H04L12
IPC codes: H04L12