EP2220831A1 - Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données - Google Patents

Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données

Info

Publication number
EP2220831A1
EP2220831A1 EP07858305A EP07858305A EP2220831A1 EP 2220831 A1 EP2220831 A1 EP 2220831A1 EP 07858305 A EP07858305 A EP 07858305A EP 07858305 A EP07858305 A EP 07858305A EP 2220831 A1 EP2220831 A1 EP 2220831A1
Authority
EP
European Patent Office
Prior art keywords
data
node
transmitted
loop
data transmission
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
EP07858305A
Other languages
German (de)
English (en)
Other versions
EP2220831A4 (fr
Inventor
Tapio Marttinen
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.)
Wiseriver Ltd Oy
Original Assignee
Wiseriver Ltd Oy
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 Wiseriver Ltd Oy filed Critical Wiseriver Ltd Oy
Publication of EP2220831A1 publication Critical patent/EP2220831A1/fr
Publication of EP2220831A4 publication Critical patent/EP2220831A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2803—Home automation networks
    • H04L12/2838—Distribution of signals within a home automation network, e.g. involving splitting/multiplexing signals to/from different paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/403—Bus networks with centralised control, e.g. polling
    • H04L12/4035—Bus networks with centralised control, e.g. polling in which slots of a TDMA packet structure are assigned based on a contention resolution carried out at a master unit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/4013—Management of data rate on the bus
    • H04L12/40136—Nodes adapting their rate to the physical link properties

Definitions

  • the invention relates to a method and system for asynchronous data transmission in a data transmission network.
  • the invention relates to a system described in the preamble of claim 1 and to a method described in the preamble of claim 20 for transmitting data asynchronously in a data transmission network.
  • Distinct problems are associated with the above mentioned issues. For example, installation of several different types of cables and systems, and also their service and alteration, is expensive and complex. These kinds of systems require even physically many kinds of plug sockets or connection points for connecting equip- ment and applications to a data transmission network supporting it. In the state of the art there are known some solutions and attempts to combine all data transmission solutions to one medium. Nevertheless, also these are very complicated and vulnerable systems, because they typically contain a lot of electronics for the correct reading, interpreting and transmitting of data elements according to various protocols. Further, the more different applications there are connected in the solution according to a known system, the more counting capacity and memory resources are required from the processor running the system.
  • the object of the invention is thus to achieve such a solution, with which above- mentioned drawbacks relating to the state of the art can be reduced.
  • the object of the invention is to create a universal data transmission system, from which the transmission capacity needed by all kinds of data transmission applications can be separated for all of them.
  • applications using data transmission such as lo- cal area networks, sound reproduction equipment, telephone systems and antenna networks are taken into use, they traditionally require the installation of a separate cabling for them.
  • the object of the invention is, by programmatic measures, to separate an independent data transmission connection or a data transmission connection to be connected to en external network restricted to a certain area.
  • the system of the present invention is characterised in what is shown in the char- acterising part of the system claim 1.
  • the method of the present invention is characterised in what is shown in the characterising part of the method claim 20.
  • the system according to the invention relates to asynchronous data transmission in a data transmission network, in which the data transmission network comprises at least two nodes, namely at least one main node and at least one connection node.
  • the data transmission network further comprises at least one loop administered by the main node so that the main node is adapted to generate to the loop a primary carrier frame (CF) transmitting data in the loop.
  • CF primary carrier frame
  • the loop has at least one connection node, to which at least one device, such as TV, stereos, loudspeaker, telephone or computer, is connected.
  • the device is linked to an application, which provides the devices with a data transmission connection, through which the devices can communicate with each other or to an external network.
  • connecting the device can act as a trigger for the generation of the application (plug & play).
  • the invention is also characterised in that in the node data is only transmitted to one direction in the primary carrier frame via at least one channel.
  • the channel is typically a data transmission resource which is separated from the transmission capacity of the data transmission network in a time shared manner and which is assigned to the application, the resource being assigned to the use of the embodiment most typically when arranging or forming an application.
  • a data unit to be transmitted between the transmitting and receiving node is divided into slices to be transmitted at equal intervals according to the size of the data field determined for the channel, the transmitted data unit relating to the application being data according to any data transmission protocol.
  • each slice of the data nit divided into slices is transmitted transparently to the recipient as a bit string independent of the data transmission protocol through the channel in question in the data field of the primary carrier frame, without touching the contents or structure of the transmitted data entity and without reading its possible address or length fields.
  • a connection circuit in the data transmitting node has been adapted to provide as output an electric signal to be transmitted in the bit string transmitted in the data transmission network, indicating the starting point of the data unit in the bit stream transmitted in the data transmission network.
  • the receiving node is made to form a timely electric signal indicating the beginning of the bits in the data unit in the connection circuit of the receiving node so that the receiving node can pick the starting point of the data unit assigned to it in the bit stream transmitted in the data transmission network.
  • the invention contains only a few general definitions for the mode of transmitted data (Transmission Mode, TM). However, the facts mentioned above are common to all these transmission modes; for example, defining the starting point of the data unit. Nevertheless, the processing of the transmission modes in the buffers devi- ates somewhat from each other.
  • the modes of the invention are the following:
  • - TM4 Free frame length, free repetition frequency, one transmitter
  • - TM5 Point-to-Point P-P, free repetition frequency, free frame length, but however, in most applications standard repetition frequency and frame length, bidirectional connection between two points. There may also be other possible modes, but they will not be discussed in connection with this document.
  • the said transmission modes are based on the transmission of a free-length packet in a transparent manner. They are characterised in the use of a reservation bit (R-bit) in front of the channel. The first slice of the packet begins from the beginning of the data field used by the channel. The end again generally impinges on something in the middle of the data field. The end point is found in a manner discussed later in this document.
  • the transmission modes TM2 - TM5 are special cases of TM1.
  • the most common use of the TM1 mode is the Ethernet application.
  • the channel In this transmission mode, the channel is in common use (Ethernet's original Carrier Sense Multiple Access with Collision Detection (CSMA/CD) protocol is in use).
  • the transmitting device of the user is connected to the connection node.
  • the Ethernet transmitter/receiver circuit of the connec- tion node sets active the signal "Receive Data valid, RXDV". This signal is active to the end of the last bit in the packet.
  • RXDV Reserve Data valid
  • the transmitting connection node fills the 16-bit "slices" in successive primary carrier frames in the channel reserved for it as long as there are bits in the packet.
  • the last slice is usually not whole.
  • the transmitter changes the R-bit to zero in the last slice belonging to the transmission. When the R-bit is zero for the first time after the reservation, the channel is not free, and no connection node attempts to reserve the channel then.
  • TM2 has a frame of standard measure, so the end of the packet in the last slice will be known from this.
  • the R-bit is only intended for the reservation of the chan- nel.
  • TM3 is similar to TM2, but only one transmitter is allowed.
  • TM3 has a frame of standard measure, in practice often also standard repetition frequency.
  • the R-bit is used, but only for finding the beginning of the frame. Typical applications are in sound reproduction (e.g. CD format and S/PDIF).
  • TM4 is the same as TM1 , but only one transmitter is allowed.
  • a typical application is e.g. the transmission of TV channels.
  • TM5 has the same principle as TM1 , but in this mode the transmission takes place between two points.
  • the use of the R-bit is the same as in TM1 , but both points terminate the coming bit string and transmit, if there is something to transmit.
  • the R-bit must not pass the connection node as such, even though there is nothing to transmit.
  • the repetition frequency and frame length can be standard, but they may also vary just as well. Typical applications are e.g. intercommunication stations and videophones.
  • Channel is a resource (Channel or Resource) assigned to an application in the primary carrier frame.
  • the channel length can vary from zero to the size of the entire effective load. All capacity free at a specific time is in the channel #127.
  • one TV channel (with the capacity of 2-5 Mbit/s) takes up one channel according to the invention.
  • the Ethernet application is one channel.
  • Device is a device to be connected to the connection node, such as TV, loudspeaker, CD player, telephone or computer.
  • the device is associated with an application, which will be defined later.
  • Transparency refers in this invention to that the contents or structure of the transmitted data entity will not be touched and possible address or length fields will not be read.
  • Mode is either a transmission mode (TM1 - TM7) or an internal mode SI or
  • Primary carrier frame is the primary transmission unit the invention uses in a loop, carrier frame (CF), which is repeated 64000 or 8000 times a second.
  • CF carrier frame
  • Delimiter bit (D) follows temporally the reservation bit (R) in the data stream.
  • the delimiter bit is active only when the last bits of a sliced data unit are in the data field of the primary carrier frame of the channel.
  • Loop is a typical topology for the data transmission solution used by the invention.
  • the lower level loop has been divided into four segments, which are also independent loops.
  • the loop is administered by at least one node in the loop, the main node.
  • the system may have several loops, either of different or same level
  • Typical total capacity for an upper level loop is at present 1 Gbit/s, but it is obvious that as technology evolves, this will increase. In addition it has to be taken into account that the loop can be duplicated so that the total capacity of the system is 2 Gbit/s on the upper level.
  • One higher- level loop has typically 1024 channels and a lower-level loop has 128 channels, but it is also obvious that the numbers of channels presented here are only exemplary, and the invention is by no means restricted to the said number of channels.
  • Node is either a connection node or main node in the loop.
  • a device is con- nected to the loop via the connection node.
  • the main node again administers the said loop.
  • the application includes devices, for example, loudspeakers in a sound reproduction system and their sound source, which is e.g. provided with a digital S/PDIF connec- tion; or e.g. PC and its connection equipment connected to a local network
  • LAN local area network
  • An application is typically created automatically (plug-and-play) on the user side by connecting a first device that belongs to the application to a connection node.
  • Arranging transmission resources needed by external service provid- ers requires measures by a person authorised for (distant) administration of the system.
  • the applications are fully independent, and they can be defined to comprise desired areas in any parts of a building (or block, different houses in housing corporations). In a big building there can be thousands of separate applications. Space can be made for a new application any time without disturbing the other applications.
  • One application generally needs one channel.
  • Data field is a field reserved for a channel in the primary carrier frame.
  • Data unit (packet or frame) is a user's data unit, which is transmitted be- tween at least two devices belonging to an application.
  • R Reserve bit
  • - "Reservation bit” (R) is located temporally first in the data flow, indicating whether the said shared channel is currently reserved or free.
  • the reservation bit is associated with the alternative method for finding the end of the packet.
  • - "Slice” is a part of data divided from the data unity to be transmitted and intended to be transmitted in accordance with the invention. The thickness of the slice depends in each case on the transmission speed needed. In accordance with the invention, the data unit is sliced into pieces or slices of 1/64000 or 1/8000 seconds.
  • connection circuit of a data transmitting node is adapted to provide as output a second electric signal to be transmitted in a bit stream transmitted in the data transmission network.
  • the signal indicating the length of the data unit is delivered in the data transmission network through the nodes in the data transmission network to at least one data receiving node, in which the signal controls the receiving node to read the length of the transmitted data unit.
  • connection circuit of the data transmitting node is adapted to provide as output a third electric signal to be transmitted in the bit stream transmitted in the data transmission network, indicating the end point for the data unit in the bit stream transmitted in the data transmission network.
  • the receiving node is made to form a timely electric signal indicating the end of the bits belonging to the data unit in the connection circuit of the receiving node so that the receiving node can pick the end point of the data unit assigned to it in the bit stream transmitted in the data transmission network.
  • connection circuit of the data transmitting node provides as output one signal, which, in addition to the starting point, also indicates the end point for the data unit.
  • a signal can be, for exam- pie, an RxDV signal (receive data valid), which typically is active during the transmission of the whole data unit, i.e. the transmission of all slices.
  • RxDV signal receive data valid
  • isochronous transmission e.g. pulse-code modulated transmission (PCM) of a telephone
  • PCM pulse-code modulated transmission
  • a framing signal is used, which indicates only the beginning, but the length of data is constant).
  • the receiving node is made to form a timely electric signal indicating the beginning of the bits in the data unit and, in addition, a timely electric signal indicating the end of the bits in the data unit in the connection circuit of the receiving node so that the receiving node can pick the starting and end points for the data unit assigned to it in the bit stream transmitted in the data transmission network.
  • the channel is in shared use by at least two devices so that the first bit preceding the data field temporally is a reservation bit (R) indicating, whether the said shared channel is currently reserved or free.
  • the reservation bit (R) is temporally followed by a delimiter bit (D), which is active only when the last bits of the sliced data unit are present in the data field of the primary carrier frame in the channel.
  • the reservation bit (R) is set to be inactive only in the next data field of the primary carrier frame after the transmission of the last bits associated with the sliced data unit.
  • the setting of the reservation bit (R) to be inactive is adapted to cause the respective control signal to become inactive in the receiving node, such as e.g. to deliver the "transmit enable" signal to the Ethernet transmitter/receiver.
  • the delimiter bit (D) is set to be active only in connection with the next data field of the primary carrier frame, if the last bits of the sliced data unit cannot fit to the data field of the primary car- rier frame of the channel, when the data indicating the number of last bits in the sliced data unit has been temporally added in front of the said last bits in the sliced data unit (i.e. the data field), in which case the number of bits is indicated with a minus sign indicating that the data representing the number of bits con- cerns temporally the previous received slice.
  • the reservation bit (R) is arranged to indicate the beginning of the data field in the sliced data unit to be transmitted especially when the transmitted data unit is a frame with constant length.
  • the main node is adapted to time the transmission of the primary carrier frame and to fill its necessary fields with data supplied by different data transmitting nodes and to copy the required fields from the basic carrier frame arriving from the loop to be transmitted again to the loop.
  • the main node can also be adapted to connect and administer several loops, to which the main node is adapted to generate the basic carrier frame (CF) transmitting data in the loops.
  • the main node is adapted to combine several loops administered by it to at least one higher-level loop as a bigger system, the higher-level loop being administered by at least one main node relating to a higher-level loop.
  • the main node administering at least one higher-level loop can also connect the said loops and the related main nodes to at least one external data network.
  • VBR Very Bit Rate support
  • VBR will only be used in a higher-level loop (HLR), but it is generally determin- able.
  • the VBR additional attribute can be set to any transmission mode so that the application mainly negotiates the minimum and maximum length for the channel (the number of bits in the channel) with the main node.
  • the duration of a multi frame (MF) is 512 primary carrier frames (CF).
  • CF primary carrier frames
  • SMF sub-multi frame
  • the transmitting node of the application using VBR can write the capacity it needs next at a place determined by the number of its own channel. After the next successful transmission of MF (everyone has reported to have received it without errors), the new bandwidth will be taken into use for the channel.
  • the correctness of the initial addresses for the channels can always be checked.
  • the alternatives are the adding of a parity bit (CRC, Cyclic Redundance Check) or an error-correcting code. All the alternatives need a certain number of additional bits.
  • Each node checks the correctness of the reception of the initial addresses for the channels used by it (i.e. once in an MF) (in a connection node, there are e.g. 6 gates, each with its own channel). If the node detects a bit error, it reports this in the parameter field of the third SMF channel, number 127 (the last channel, because its parameter field will not be needed for another purpose), the first SMF containing the initial addresses for all 128 channels, by changing all bits in it to ones.
  • CRC Cyclic Redundance Check
  • the main node still repeats this by changing these bits to ones also in the fourth SMF, because in this way also the connection nodes located before the node detecting the error are notified of it. All the connection nodes will then "know" that the new recently divided channel configuration will not be taken in to use, but a new round will be waited for.
  • capacity is thus divided for the applications in a time-shared manner.
  • data transmission is transparent in the present invention.
  • the length field or address field of the user's data unit will not be read, but data travels to the area that has been determined for it as if the area had its own data transmission line.
  • the arrangement according to the present invention should thus be understood logically as a line infrastructure, of which e.g. data transmission lines will be taken into use for (one) LAN (or LAN segment) of a certain enterprise, the lines travelling in the enterprise's premises (in any selected rooms even in a big building).
  • only devices connected to the system read addresses travelling in the "lines”, i.e. no other components of the invention (with the exception of a higher-level main node, which sees to traffic out from the system of the invention i.e.
  • the invention can comprise e.g. two levels of hierarchies, a lower (Lower Level Ring (LLR)) and higher (Higher Level Ring, HLR) level.
  • LLR Lower Level Ring
  • HLR Higher Level Ring
  • the higher level can be used, for example, for connecting the applications in an apartment or office to extend to an external network and to each other.
  • the lower level can be used for connecting e.g. the devices in an office to each other (e.g. 128 applications / apartment).
  • the lower level typically consists of four loops, which are called segments, and between which a connection will occur according to applications via the main node in the loop.
  • a certain kind of hierarchy is thus essential in the invention so that it is possible to form several independent, locally restricted or unrestricted data transmission applications, in which data transmission is transparent, guaranteeing that any data can be transmitted, even such data, which has not even been developed yet.
  • the invention thus determines for the transmission a limited number of universally valid transmission modes (explained in more detail below in the description of the invention), by means of which any transmission protocol can be transmitted in the system between desired nodes (2 or several) and returned to the receiver in the mode in which it was at the input point.
  • an application connecting loudspeakers and a CD player etc. is at least in a normal case restricted either to a room or at least an apartment.
  • An office can instead be located in several floors. In addition, some floors may contain other offices.
  • LANs of an office are typically used in the area of all premises used by the office.
  • the present invention thus includes undisputed advantages in relation to solutions known from the state of the art.
  • electronics process the data stream on an electric logic level (or programmatically), when no operational malfunction of a microprocessor, congestion or error can affect the progress of data.
  • congestion or error can affect the progress of data.
  • the invention processes all data in the same way as
  • the different data transmission modes of the applications are really “transparent” in accordance with the inventive idea, which ensures that data transmission is undelayed and that the system does not suffocate to the unloading, conversion and packing of user's data.
  • the invention offers e.g.
  • the amount of electronics needed in the connection nodes is minimal; no processing of the microprocessor is needed for data transmission, in which case data transmission cannot be jammed to a program error; the system according to the inven- tion can have an innumerable number of different applications; and the lack of performance of the microprocessor will not rise to be a hindrance; no new cables need to be installed after the implementation of the system of the invention, even though new equipment or data transmission applications were to be added to the data transmission system of the invention; and the devices can be connected to the system e.g. by USB, Ethernet (10/100Base-T) or Bluetooth connections by using e.g. UpnP (Universal Plug and Play) (a protocol, which negotiates the transmission resources and finds associated devices and can connect them to the correct network).
  • UpnP Universal Plug and Play
  • Figure 1 illustrates a first exemplary system for transferring data asynchro- nously in a data transmission network according to an embodiment of the pre- sent invention
  • Figures 2A-C illustrate a second exemplary system for transferring data asyn- chronously in a data transmission network according to an embodiment of the present invention
  • Figure 3 illustrates a third exemplary system for transferring data asynchro- butly in a data transmission network according to an embodiment of the present invention
  • Figure 4 illustrates an exemplary structure for a data transmission system for transferring data asynchronously in a data transmission network according to an embodiment of the present invention
  • Figures 5A-E illustrate an exemplary buffer system for transferring data asynchronously in a data transmission network according to an embodiment of the invention
  • Figure 6 illustrates an exemplary arrangement of data buses used between buffers according to an embodiment of the present invention
  • Figures 7A-B illustrate an exemplary method for processing data contained in slices in a node according to an embodiment of the present invention.
  • Figures 8A-B illustrate some exemplary methods for transferring data between buffers and for processing data in a node according to an embodiment of the present invention.
  • Figure 1 illustrates a first exemplary system 100 for transmitting data asyn- chronously in a data transmission network 102 according to an embodiment of the present invention.
  • the data transmission network in Figure 1 comprises e.g. an upper-level main node 104, and further at least one loop 106a administered by the main node, to which loop the main node is adapted to generate a primary carrier frame (CF, Figure 4) transmitting data in the loop.
  • the data transmission network also comprises several lower-level (LLR) main nodes 108 associated with the loop generated by the main node.
  • the nodes 108 comprise at least one loop 106b, which they administer themselves, and in which case the said nodes 108 are main nodes of the said look 106b, i.e.
  • the loop 106b can have several connection nodes 1099 for connecting devices 110 to the data transmission sys- tern.
  • the devices 110 are linked to an application, in which data transmitted by the devices or coming from an external network is transmitted via the data transmission system of the invention between devices belonging to the same application.
  • the main node can also be adapted to connect and ad- minister several loops. Further, the main node, especially an upper-level main node, can, when needed, connect the loops administered by it and the lower- level main nodes and the lower-level loops administered by them to at least one external data network 112.
  • the system of the invention can be expanded almost endlessly.
  • the loop struc- ture can be duplicated to two loops transmitting data to opposite directions, in which case the advantage is achieved that the system will tolerate one complete cable break without disturbing the operation.
  • FIGS 2A-C illustrate a typical loop 106b administered by the lower-level main node 108.
  • four loops administered by the said main loop 108 can be connected to the lower-level main node 108, which loops can comprise a certain number of connection nodes 109.
  • the loops 106b administered by the lower level can be chains among themselves, in which data is transmitted uni- directionally to the last node and then turns back, or they can be duplicated loops.
  • each loop can transmit data with the speed of 95 Mbit/s, i.e. by means of four loops it is possible to transmit 380 M/bit/s per apartment.
  • Figure 2A illustrates two chained loops 201 , 202.
  • Figure 2B there is a secured loop 203, which can tolerate one complete cable break.
  • Figure 2C again illustrates a connection node 108, which has two gates under a lid, to which temperature, twilight, anti-theft and other sensors and actuators 204 required by the house automation can be connected, such as relays and digital-to- analogue converters. These can be connected to an automation system separate for each apartment or to a system common to the whole house. According to an embodiment the connection can be converted programmatically for several standardised connections.
  • Figure 3 illustrates a system 300 administered by one lower-level main node 108, which has three different loops 301 , 302, 303, of which the loops 301 and 303 are chained, and the loop 302 is a secured loop.
  • the loops have connec- tion nodes 109, to which different devices 110, such as e.g. PC, TV and telephone, can be connected.
  • devices 110 such as e.g. PC, TV and telephone
  • some elements essential for house automation such as temperature sensors 204 are connected to the connection nodes.
  • connection node 109 is characterised by a connection circuit 109a, which according to an embodiment of the invention provides different signals (described elsewhere in this document) for indicating e.g. the starting and/or end points and length information on the data.
  • Figure 4 illustrates an exemplary structure for a data transmission system 400 for transmitting data asynchronously in a data transmission network according to an embodiment of the invention, in which the structure is a primary carrier frame 400 transmitting data and generated by the main node administering the loop.
  • the primary carrier frame is divided into channels, for example 128 channels. It is characteristic of the invention that in the loop data is transmitted to one direction only in the primary carrier frame 400 via at least one channel 3, 7, 11 , 12, 13, 23, 25, 127. "One direction" has to be understood so that the primary carrier frame "travels" e.g. clockwise so that data is available at the points A, B, C in an order according to their mutual sequence.
  • a channel is typically a data transmission resource assigned to an application and separated from the transmission capacity of the data transmission network in a time-shared manner, the resource being assigned to the use of the application upon establishment, most typically when connecting the first device associated with the application to a connection node of the loop.
  • the length of each channel can vary between 0 -
  • the channel lengths can be varied any time without disturbing other traffic.
  • the primary carrier frame typically fills the loop entirely. In the example in Figure 4, part of the channels 0-25 is in use and the rest are unused so that their length is zero.
  • the channel 127 has the whole capacity remaining unused by the other channels.
  • the main node assigns a suitable channel for the application in ques- tion on the basis of messages transmitted by the new device. For example, when the application is TV (the device has to have an Ethernet connection, or a digital box with such a connection has to be used), it will upon connection connect to a connection node in a channel used at first by PCs.
  • the main node routes the traffic transmitted by the TV to the upper-level main node, which identifies the desired service provider (if there is one).
  • the lower-level main node arranges an own channel (from the resource loop) for the TV (2-5 Mbit/s). The capacity will be reduced from the PC resource.
  • the lower-level main node connects the channel (resource) of the channel reserved for this TV to the channel (resource) of the upper-level loop, to which the up- per-level loop feeds the data of the desired TV channel.
  • the upper-level main node arranges a new channel (from the resource loop) to the upper-level loop, if the TV channel in question is not currently watched in the apartment. Each TV turned on in the apartment will get an own channel (resource) from the loop.
  • the main node can give the said TVs the same channel (resource) from the loop for saving transmission capacity.
  • Connecting an analogue phone to the connection node typically requires an adapter.
  • the lower-level main node identifies the call signal sent by the adapter and arranges an own channel (resource) typically of e.g. 64 kbit/s for the connection.
  • the lower-level main node connects the apartment level channel to the channel reserved for telephone com- munications in the upper-level loop. This is a so-called group channel or resource, which thus is one channel, but containing an own internal resource for each phone in the house.
  • the gateway in the upper-level main node converts the telephone conversation into an IP conversation (VoIP) in a general network.
  • VoIP IP conversation
  • Figures 5A-E illustrate an exemplary buffer system 500 for transmitting data asynchronously in a data transmission network according to an embodiment of the invention.
  • a buffer structure 500 used in a lower-level main node, the structure typically having eight internal buffers 502, 504 (one for each loop in an arrangement with four loops) and three ex- ternal buffers 506, 508, 510.
  • the buffers Biext and Bo- ext 506, 508 operate as buffers between the main node and the upper-level loop, of which the buffer Biext 506 receives data from the upper-level loop, and from the buffer Boext 508 data is delivered to the upper-level loop.
  • the buffer eB operates as a buffer between several loops administered by the lower-level main node.
  • Figure 5A only two internal buffers are shown in Figure 5A.
  • Figure 5B(1 ) illustrates an example of the first input buffer 502 BiO, to which the data contained in the primary carrier frame and circulated in the lower-level loop is read.
  • data is read possibly for each loop to its own buffer BiO, BM , Bi2, Bi3 that, however, are identical with each other.
  • Figure 5B(2) illustrates a principal view of the operation of the input buffer 502.
  • the buffer 502 has two replaceable halves 502a, 502b (swapi , swap2) so that data can be received to the one and the other can already be fully received. It is possible to write successively to the input buffer, but its halves 502a, 502b can be read in free order.
  • On the read side there are typically 64 pointers. This restricts the number of active channels to 64 in the loop, but it has to be noted that this can be changed in accordance with buffer principle known from the state of the art.
  • Figure 5C illustrates an example of the first output buffer 504 BoO, in which data is transmitted to the primary carrier frame circulating in the lower-level loop.
  • the output buffer can be written in free order and it is read in channel order, but e.g. the whole data structure of isochronous channels has to be stored to the output buffer. That is why each channel, which is active in the loop, has its own pointer.
  • the output buffer in the example has 64 read and write point- ers, that is the maximum of 64 channels or channel groups (successive, identical channels are treated as one channel) can be active in the loop.
  • Figure 5D illustrates an example of the external buffer eB 510 (External Buffer) intended for data transmission between loops.
  • the data bus of the buffer in the example is 8-bit so it can serve all four lower-level loops in a time multiplexed manner (data transmission between internal buffers is 1-bit). All shared transmission modes use the external buffer, because the channel can be reserved in the next loop. While waiting for release, several packets may end up in a queue. That is why there are 8 layers (LayerO - Layer7) in each channel buffer (CB), each of which can accommodate one packet.
  • FIG. 5E illustrates an example of the input and output buffers 506, 508
  • the invention uses two internal modes, which define whether the data is restricted to one loop (Segment Internal, Sl) or to all four
  • the channel in the SI mode reserves the number also in the loops, in which it is not active (and does not reserve capacity).
  • the channel in the SI mode can read directly from the upper-level loop or an external network. This possibility exists e.g. because of TV applications.
  • Figure 6 illustrates an exemplary arrangement 600 of data buses used be- tween buffers according to an embodiment of the invention.
  • 602 illustrate only the routes possible in the SI mode. Vertical transmissions between internal buffers are on a 1-bit, the other ones on an 8-bit data bus.
  • FIG. 7A illustrates an exemplary method 700 for processing data processed by slices in a node according to an embodiment of the invention, especially in TM1 mode.
  • the slice 4 of the packet to be transmitted (Slice #4) is arriving at the main node. It will be loaded to a layer to be filled in eB, which layer accommodates the whole packet.
  • the layer will most advantageously be reserved so big that it will accommodate the biggest data unit that comes to question, which in case of Ethernet is 1560 bytes.
  • Figure 7B illustrates an exemplary case 702 for processing data processed by slices in a node according to an embodiment of the invention, especially in TM1 mode.
  • the packet of the example contains 151 bytes, which is 1208 bits.
  • the slice in the Figure is 15 bits so 80 slices are 1200 bits and, consequentially, of the 1208 bits of the whole packet 8 remain in the last slice.
  • the R bit is thus 0 for the first time, and at the beginning of it there is a number which indicates the number of faultless bits, i.e. the number of bits belonging to the packet after the number, if the number is positive. If the number is negative, the last bits belonging to the packet were already in the previous slice.
  • the number is recorded to the register "Valid Bits Count", and "Bit Counter" stays to indicate the first free place in the buffer.
  • the number field in the last slice has to be so long that it accommodates the maximum length for the slice.
  • TM2 mode Processing in TM2 mode is otherwise similar to the one in Figures 7A and B, but "Valid Bit Count” is not in use and “Bit Counter” is constant (set upon implementation of the application).
  • TM3 one transmitter
  • space equivalent to one slice will be reserved to the internal buffer (Bo).
  • the packet sets immediately off to the net loop (standard delay as consequence), "Bit Counter” is constant and "Valid Bit Count” is not in use in TM 3.
  • TM4 is a special case of TM1 (one transmitter). Data processing is similar to that in TM1 , but no external buffer is needed. Space for two slices can be reserved to the internal buffer (Bo), because the second last slice can be transmitted only after it becomes apparent from the last slice, whether the last or second last slice is incomplete. In TM4 the delay is constant, but one basic se- quene (1/64000 seconds) bigger in TM3. In TM4, "Bit Count" and "Valid Bit Count" are in use.
  • TM5 is associated with a bidirectional connection between two points, in which the processing in the main node is similar to that in TM4.
  • Figure 8A illustrates an exemplary method 800 for transmitting data between buffers and for processing data in a node according to an embodiment of the invention, especially in TM1 transmission mode and AS mode, i.e. mode, in which data is transmitted between all loops.
  • the transmitting application (Source AN) is in the loop 1.
  • the slice is immediately transmitted back to the own loop so that also possible devices connected to the connection nodes before the transmitter can read it.
  • the slice is copied to the next loop via eB.
  • the data stream is terminated 802 before its return to the loop 1.
  • SI mode differs from the one illustrated in Figure 8A in that in SI mode data is not copied to the next loop.
  • Figure 8B illustrates a second exemplary method 804 for transmitting data between buffers and for processing data in a node according to an embodiment of the invention, especially in TM5 transmission mode and AS mode, i.e. mode in which data is transmitted between all loops.
  • the data stream circulates all loops and meets on the way the other party of the connection, which terminates 806 it (writes on it, if it has something to transmit).
  • the differences can be seen in the figure at the tick (806) and in that there are two transmitters (Source AN1 , Source AN2), which naturally also are receivers.
  • TM1 example in Figure 8A
  • a so-called multi frame is known from several data communications protocols (PDH, Plesiochronous Digital Hierarchy (standard ITU-T G.703, G.704), and SDH, Synchronous Digital Hierarchy (G.707-709), with which slowly changing data is transmitted at certain intervals so that the multi frame consists of a multiply (e.g. 32) of an actual frame (repeated 8000 times a second).
  • a field of the multi frame is concatenated as a frame.
  • the initial addresses of the fields in each 128 channels are transmitted during 512 frames in 128 successive primary carrier frames (CF), which is typically repeated 64000 times a second.
  • CF primary carrier frames
  • the multi frame (MF) may typically also include other parameters.
  • PDH and SDH mentioned above are isochronous protocols, and they transmit a standard-length frame at standard intervals (8000 times a second).
  • the present invention is based on the electronic components, transmitter- receivers, connectors, cables and light fibres according to the Ethernet standard, and signal levels, forms and frequencies are in accordance with the Ethernet standard, in which the physical layer in the OSI model is Ethernet's, but the link layer is the invention's own.
  • the invention can be varied in accordance with requirements of other possible data transmission systems and/or standards.
  • the Ethernet connection has been shown as an example of the user's device connection.
  • the connection can also be, for example, USB.
  • the connection can, for example, be replaced by a wireless Bluetooth link.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Automation & Control Theory (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention concerne un procédé et un système (100) pour transmettre des données de manière asynchrone dans un réseau de transmission de données (102) comportant au moins deux nœuds (le nœud principal et le nœud de connexion, 104, 108). Le système comprend également une boucle (106a, 106b), dans laquelle les données sont transmises dans une trame de porteuse principale (400) par l'intermédiaire de canaux (3, 7, 11, 12, 13, 23, 25, 127). Le nœud principal (104, 108) gère la boucle et génère pour celle-ci également la trame de porteuse principale (400) de transmission de données. Les dispositifs connectés au nœud de connexion appartiennent à une application, à laquelle un canal est attribué dans la boucle, c'est-à-dire une ressource de transmission de données séparée de la trame de porteuse d'une manière partagée dans le temps ; un champ de données, dans lequel l'unité de données de l'utilisateur est transmise divisée en autant de parties de la longueur du champ de données que nécessaires pour transmettre l'unité de données entière. Les tranches sont transmises au récepteur de manière transparente en tant que chaîne de bits indépendante du protocole de transmission de données par l'intermédiaire dudit canal dans le champ de données de la trame de porteuse sans toucher au contenu ou à la structure de l'unité de données à transmettre et sans lire son adresse possible ou ses champs de longueur. Un circuit de connexion (109a) dans le nœud de transmission de données est adapté pour fournir, en tant que sortie, un premier signal électrique à transmettre dans le flot de bits transmis dans le réseau de transmission de données, indiquant le point de début pour l'unité de données dans le flot de bits transmis dans le réseau de transmission de données. Dans ce cas, le nœud de réception peut former un signal électrique opportun indiquant le commencement des bits appartenant à l'unité de données dans le circuit de connexion du nœud recevant le signal électrique.
EP07858305A 2007-11-28 2007-11-28 Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données Withdrawn EP2220831A4 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/FI2007/000281 WO2009068721A1 (fr) 2007-11-28 2007-11-28 Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données

Publications (2)

Publication Number Publication Date
EP2220831A1 true EP2220831A1 (fr) 2010-08-25
EP2220831A4 EP2220831A4 (fr) 2010-12-22

Family

ID=40678073

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07858305A Withdrawn EP2220831A4 (fr) 2007-11-28 2007-11-28 Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données

Country Status (2)

Country Link
EP (1) EP2220831A4 (fr)
WO (1) WO2009068721A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0410636A2 (fr) * 1989-07-28 1991-01-30 AT&T Corp. Système de communication amélioré
US6865188B1 (en) * 1997-02-17 2005-03-08 Communication & Control Electronics Limited Local communication system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5898669A (en) * 1996-03-22 1999-04-27 Shimony; Ilan ATM traffic management device
AU5811798A (en) * 1996-12-30 1998-07-31 Digital Equipment Corporation Method using a standardized protocol for transmission of frames of data across ahigh speed bus
US6977939B2 (en) * 2001-01-26 2005-12-20 Microsoft Corporation Method and apparatus for emulating ethernet functionality over a serial bus
US20070153815A1 (en) * 2005-12-30 2007-07-05 George Geeyaw She System and Method For Establishing And Maintaining Simultaneous Operation of Asynchronous and Isochronous Communications
WO2007098412A1 (fr) * 2006-02-17 2007-08-30 Standard Microsystems Corporation Système et procédé de transfert de différents types de données en continu et par paquets sur une ligne de transmission ethernet utilisant une structure de trames et de paquets délimitée par des violations de codage ethernet

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0410636A2 (fr) * 1989-07-28 1991-01-30 AT&T Corp. Système de communication amélioré
US6865188B1 (en) * 1997-02-17 2005-03-08 Communication & Control Electronics Limited Local communication system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
NAKATSUKA S ET AL: "MELNET: HIERARCHICAL HYBRID LOCAL AREA NETWORK" PROCEEDINGS OF THE ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS. SCOTTSDALE, ARIZONA, MAR. 26 - 28, 1986; [PROCEEDINGS OF THE ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS], WASHINGTON, IEEE COMP., vol. CONF. 5, 1 March 1986 (1986-03-01), pages 239-245, XP000810056 *
See also references of WO2009068721A1 *

Also Published As

Publication number Publication date
WO2009068721A1 (fr) 2009-06-04
EP2220831A4 (fr) 2010-12-22

Similar Documents

Publication Publication Date Title
CN1143221C (zh) 向总线桥中的多个总线节点分配周期时钟的方法和装置
US5550802A (en) Data communication network with management port for isochronous switch
US5280477A (en) Network synchronous data distribution system
US5412651A (en) Structure and method for combining PCM and common control data on a backplane bus
US5991831A (en) High speed serial communications link for desktop computer peripherals
EP1113626B1 (fr) Dispositif d'interface de couche de liaison pour mettre en oeuvre un réseau distribué
US6343331B1 (en) Local communication system and apparatus for use therein
US6023730A (en) Communication system with separate control network for managing stream data path
US5533017A (en) Line interface device for fast-packet switching network
US7852857B2 (en) Coupler for a ring topology network and an ethernet-based network
Sze A metropolitan area network
US6741566B1 (en) Remote management ethernet network and device
US4905219A (en) Three level distributed control for networking I/O devices
JPH0695677B2 (ja) 複数チヤネルを有するネツトワークの伝送方式
WO2009068721A1 (fr) Procédé et système pour transmettre des données de manière asynchrone dans un réseau de transmission de données
US6115391A (en) Method and apparatus for integrating multiple repeaters into a single collision domain
US5592484A (en) Telecommunication network having a number of stations which are connected to a token ring network, and station for such a network
FI120225B (fi) Menetelmä ja järjestelmä tiedonsiirtämiseksi asynkronisesti tiedonsiirtoverkossa
JP3713825B2 (ja) 情報処理装置、通信システムおよびその方法
CN1663202A (zh) 用于串行通信总线的数据链路层设备
USRE39395E1 (en) Data communication network with transfer port, cascade port and/or frame synchronizing signal
KR100333557B1 (ko) 데이터 통신 기능을 구비한 전화기
US6904042B2 (en) Network coupling device and data network with network coupling device
Bohm The DTM protocol: Design and Implementation
Brandsma PHILAN: A local-area network based on a fibre-optic ring

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: 20100628

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

RIN1 Information on inventor provided before grant (corrected)

Inventor name: MARTTINEN, TAPIO

A4 Supplementary search report drawn up and despatched

Effective date: 20101119

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20111011

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: 20130601