+

WO1997036400A1 - Affectation de n×uds pilotes de tranches de temps pour n×uds asservis - Google Patents

Affectation de n×uds pilotes de tranches de temps pour n×uds asservis Download PDF

Info

Publication number
WO1997036400A1
WO1997036400A1 PCT/SE1997/000522 SE9700522W WO9736400A1 WO 1997036400 A1 WO1997036400 A1 WO 1997036400A1 SE 9700522 W SE9700522 W SE 9700522W WO 9736400 A1 WO9736400 A1 WO 9736400A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
slave node
slot
slave
time
Prior art date
Application number
PCT/SE1997/000522
Other languages
English (en)
Inventor
Per Lindgren
Christer Bohm
Lars Gauffin
Original Assignee
Net Insight Ab
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 Net Insight Ab filed Critical Net Insight Ab
Priority to AU23149/97A priority Critical patent/AU2314997A/en
Priority to EP97915819A priority patent/EP0886933A1/fr
Publication of WO1997036400A1 publication Critical patent/WO1997036400A1/fr

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/2852—Metropolitan area 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/403—Bus networks with centralised control, e.g. polling

Definitions

  • the present invention relates to a method and an arrangement for a simplified interface to a node in a time multiplexed network using time slots in a frame.
  • Terminals act as network hosts and may comprise almost any electrical device, including mobile telephones, television sets, multimedia workstations or super computers for millions of dollars.
  • the terminal hosts may differ from one another with respect to proces ⁇ sing capacity and the requirements on communication services with many orders of magnitude.
  • the two basic types of networks are first connec ⁇ tion-oriented circuit-switched networks, which are used within for example telecommunication, and second, connec ⁇ tion-less packet-switched networks, exemplified by the Internet.
  • circuit-switched networks When a circuit-switched network is used for computer communication, circuits are left open between bursts of data, which results in waste of resources. This situation occurs due to the fact that the setting up and removal of connections takes too long time compared to the dynamic variations of the user's need.
  • Another source of resource waste in circuit-switched networks is the limitation that only symmetric duplex channels may be established, which results in that only half of the resources allocated to the connection are used when the information flow is simplex.
  • a packet-switched network lacks means for resource reservations and must add information to a header in each message before transmission. Furthermore, delays in a packet- switched network are not predictable enough and packets may even be lost during transmission due to buffer limits or destroyed information in the header. The two last factors make it difficult to support real-time services in a packet-switched network.
  • ATM Advanced Technology Attachment
  • CCITT International Telegraph and Telephone Consultative Committee
  • B-ISDN Broadband - Integrated Service ⁇ ces Digital Network
  • ATM is connection-oriented and establishes a channel like circuit-switched networks before transmission, but uses small packets of fixed size, called cells, for transmission of information.
  • ATM's packet-oriented nature requires that the network has mechanisms such as buffer scheduling and link hand- lers to be able to provide real-time guarantees for a connection.
  • DTM Dynamic Synchronous Transfer Mode
  • channels are communication abstraction. These channels differ from telephony circuits in different ways. First, the channel set-up time is short enough to allow resources to be allocated/deallocated dynamically according to the demand of the user. Second, channels are simplex, thus minimising the overhead. Third, channels are multirate, which gives the possibility to support large variations in the user's demand of capacity.
  • channels are inherently multicast, allowing more than one destination.
  • Access points and terminals withm the public net ⁇ work are the most cost sensitive products in the mfra- structure of telephony and data communication, and are therefore key components in succeeding to obtain a large connectivity also for homes.
  • There are two possibilities to obtain low cost access either a simple access proto ⁇ col s used that allows efficient implementation of low cost nodes, for example at homes, or the network may provide the end user with an infrastructure that allows high communication capacity that makes it possible for server nodes to interact with simple terminals.
  • a first step in the latter direction has been shown for example with the network computer concept, where the network is stripped with for example very little memory and own disk capacity.
  • the task of the node control may be to sort out data and control information, negotiate about establish ⁇ ing and releasing channels and negotiation about diffe- rent grades of service (GOS) with other nodes, to mention some tasks.
  • GOS diffe- rent grades of service
  • the object of this invention s thus to obtain a cost efficient solution to be able to offer broadband services in a time multiplexed network. According to the invention, the above mentioned and other objects are accomplished by a method, an arrange ⁇ ment, a slave node and a master node as claimed m the accompanying claims.
  • the present invention provides a solution to the above mentioned problems related to a time multi ⁇ plexed network, such as a DTM-like network, by providing a master node that is responsible for establishing and removing channels on the behalf of one or several slave nodes, and by reducing the processing and control signalling ability or need of the slave node, which only takes commands from the master node and possibly request services from the master node by sending request messages to the master.
  • This provides possibilities to reduce the hardware and software needed m the slave node.
  • at least one node in the network is assigned as a master node.
  • Each master node controls a set of slave nodes by deter ⁇ mining what channels or time slots that are set up to and from its slaves in relation to a third node, i.e. which channels or time slots that the slave node shall write/read through when communication to a third node, the third node being the master node, another slave node or any other kind of node.
  • the master also manages all signalling with other nodes, for example to negotiate establishing and removing channels (channel management) , handling the network resources on behalf of its slaves (resource management) and it may also handle other sorts of network management, such as fault management and accounting. This allows for implementing the slave nodes with a simple technique without complicated and expensive processing capabilities for signalling, protocol proces- sing and management, etc., thus obtaining a non-expensive node solution.
  • a command channel set up between the master and the slave.
  • special commands are sent from the master, instructing the slave to receive data from or transmit data into one or several time slots of a channel.
  • Within the slave there is a function that listens to the command channel and performs the orders of the command words. Since this function is very specialised, it can be easily implemented, for example in a Programmable Logic Device (PLD) or a small Field Programmable Gate Array (FPGA), and thereby an efficient handling even of very high-rate data streams is obtained without expensive and complica ⁇ ted software and hardware.
  • PLD Programmable Logic Device
  • FPGA Field Programmable Gate Array
  • time slot that is to be used for the command channel between the master and the slave may be predeter- mined in the network and can be stored m the slave, for example in a flash memory or Read Only Memory (ROM) .
  • Another alternative is to let the assignment of time slot to the command channel be dynamically set by letting the slave search for a given slot pattern, sent out by the master. The master either sends this pattern in the time slot that is to act as command channel, or sets a value in the special slot that tells the slave what slot to use for the command channel.
  • the slave node may also send a message (a request) to the master, informing that the slave wants the master to perform a certain service or a certain function.
  • This service may be that the master contacts another node in the network or on another subnetwork on the behalf of the slave, for example to set up a channel from the other node to the slave.
  • the master is then responsible for doing all the necessary control signalling to establish a channel between the other node and the slave node.
  • Fig 1 schematically illustrates a first embodiment according to of the invention
  • FIG. 1 schematically illustrates a second embodiment according to of the invention
  • Fig 3 schematically illustrates a receiving unit of a slave node according to another embodiment of the invention
  • Fig 4 schematically illustrates a transmitting unit of a master node according to another embodiment of the invention.
  • Fig 5 schematically illustrates a transmitting unit of a slave node according to another embodiment of the invention.
  • Fig 6 schematically illustrates the start-up of a slave node according to another embodiment of the invention
  • Fig 7 schematically illustrates how the slave node receives commands from the master node according to another embodiment of the invention.
  • Fig 1 shows an embodiment of the invention, wherein a master node 45 controls a slave nodes 47 over a subnet ⁇ work 46 to which a third node 49 is attached, which node 47 for example may be another slave node or a "normal node".
  • the information in the subnetwork 46 is transpor ⁇ ted in frames or cycles that are further divided into time slots.
  • the slave node 47 may send data in one time slot per frame, the request channel or slot 51, to request a function or a service from the master node 45.
  • the request message contains a request for an incoming channel of which the third node 49 is the source.
  • the master node 45 then handles all necessary signalling with the third node 49 (channel 54 and 55) , among other things asking the third node 49 about what slots are used for the channel requested by the slave node 47, on behalf of its slave node.
  • the third node announces the channel (channel 53 m this case) via its usual control channel 55 to the master node.
  • the master then uses its command channel 52 to the slave node 47 to instruct the slave node 47 to listen to the correct time slots, i.e. channel 53.
  • Figure 2 shows another embodiment of the invention, comprising two subnetworks 31 and 32, a switch node 33 that switches channels between the two subnetworks, a master node 34 that controls a slave node 35 over the subnetwork 31, and a third "normal" node 36 that is attached to second subnetwork 32.
  • Fig 2 shows a system with dual buses.
  • the subnetwork 32 not attaching the master and slave node, need not necessarily be a time multiplexed network, even though this is a preferred situation.
  • the information in the subnetwork 31 is transported in frames that are further divided into time slots.
  • the slave node 35 may send request data in one time slot per frame, the request channel 21, to request a function or a service from the master node 34.
  • the request message on channel 21 contains a request for an incoming channel of which the third node 36 on the other subnetwork 32 is the source.
  • the master node 34 then negotiates with the third node 36 via the switch node 33, the master nodes 34 using its control channel 50 to ask for a channel from the node 36 to be switched via the switch node 33, which switches the channel 42 from subnetwork 32 to the channel 43 in the subnetwork 31.
  • the switch node 33 tells the master node 34 what slots are used for the switched channel from the node 36 using the switch nodes usual control channel 22.
  • the master node 34 uses its command channel 20 to the slave node 35 (one time slot per frame) to set up the slave node 35 to listen to the correct time slots, i.e. to listen to channel 43.
  • the connection between subnetwork 32 and subnetwork 31 is provided via the switch node 33. This is of course not necessary.
  • the master node 34 could also act as the switch node.
  • Figure 3 shows a receiving unit which may be similar for both a slave node and a master node.
  • the receiving unit comprises a demultiplexer 1 which demultiplexes a serial bitstream 2 that arrives on a transferring media 3.
  • the receiving unit further comprises a time slot counter 4 to address a channel table which has one entry 6a-6g for each time slot of a frame (a-g) .
  • Each entry 6a- 6g is divided in at least two parts; a flag 9a-9g mdica- ting whether the corresponding slot is to be read into the node, and an LCI (Logical Channel Identifier) 10a- lOg.
  • the LCI is used to forward the incoming data to the correct end user 12 m the node.
  • the slot is read from the demultiplexer and combined with the LCI 10c and is placed in the buffer 11 where the data, depending on what the LCI 10c indicates, is forwarded to the correct end user 12. This procedure may be the same for all nodes.
  • FIG 4 shows an exemplifying embodiment of how a master node sends data.
  • the master node comprises a time slot counter 25, which is incremented for each time slot in the frame that passes the master node.
  • the time slot counter 25 addresses a channel table 14 which, in the same way as for the receiving unit, has one entry for each time slot a-g in a frame. However, in this case the counter is pointing a number of slots ahead. That is if the slot passing the node slot b in the frame, the time slot counter 25 may point at entry corresponding to slot d in the channel table 14.
  • the offset between the passing time slot and the time slot the time slot counter is pointing at depends on the bit rate of the link and the processing capacity of the master node.
  • the flag 17d of the entry of the channel table indicates that the master node should send data in the corresponding time slot d
  • a request for data to put in that slot d is sent to the transmitting user 13 indicated by the LCI 37d of the entry.
  • the end user 13 copies data directly to a memory 23 corresponding to the entry d of the channel table.
  • the time slot counter 25 also addresses the memory 23 at the entry 18b corresponding to the passing time slot b. If the flag 17b indicates that the node should send in the passing time slot b, the passing data is blocked and the data from the memory entry 18b is passed to the multiplexer 19 that forwards it onto the link.
  • the slave node's request transmitting unit and procedure is presented, which can be implemented in a much simpler way than compared to conventional nodes.
  • the transmitting unit of the slave node can be implemented as in the master node, but since the slave node only needs to send simple requests the implementation can be simplified, as will be described below.
  • the slave node comprises a register 20 which contains the slot number 21d which the slave should use to send requests to a master.
  • a FIFO-queue First-In-First-Out
  • the slave node wants to send a request to the master node, it writes data into a FIFO-queue (First-In-First-Out) 32. If there is data to oe sent in the FIFO queue 32 when the time slot d, corre ⁇ sponding to the request channel to the master node, passes on the fiber 31, i.e. when the time slot counter 28 points at the request slot number 21d m the register 20, the data at the head of the FIFO-queue 32 is forwar ⁇ ded via a multiplexer 22 onto the link 31 in that time slot d of the bitstream 30.
  • FIFO-queue First-In-First-Out
  • a slave node may want to send data to the master node.
  • the slave node may want to change the incoming data to another channel in a video on demand or TV application, or change of WWW page in an Internet application.
  • the possibility to a simplified procedure is allowed by the fact that the slave node only sends data to the master and that it only uses one sending channel, the request channel.
  • the master node and the slave node must of course agree on the time slot to be used for the request channel, it may also exist restrictions on when the time slot can be used if several slave nodes share the same time slot.
  • the master node and the slave node may agree on what time slot to use, for example by having the slave node be preset, for example by using a flash or prom memory, or by letting the master node instructing the slave node by sending a command word in the command channel, indicating what time slot to use for the request channel.
  • the embodiment m Fig 5 could easily be adapted for trans- mitting other data than request data from the slave.
  • FIG. 6 shows the procedure when a new slave node is attached to the network or is activated.
  • the slave node does not have a signalling protocol implementation, but a reduced slave function for interpreting command words from the master.
  • the function reads a Programmable Read Only Memory (PROM) 35, which contains data 37 that is copied to the entry 40e in the flag table 40 and data 36 containing a flag 36b and an LCI 36a which are copied into the entry 41f in the channel table 41.
  • the LCI 36a indicates that incoming data from that time slot should be interpreted by the reduced slave function that handles incoming command words from the master node.
  • the node is now activated and may receive command words on the time slot corresponding to entry 41f in the channel table.
  • the slave node may also send information (request messages) in the time slot corresponding to entry 40e in the flag table.
  • Figure 7 shows an exemplifying procedure wherein the master node commands the slave node to read certain time slots.
  • the time slot counter 4 in the slave node points at an entry 43f in the channel table 42
  • data from the master node is copied from the corresponding time slot f.
  • the entry 43f of the channel table indicates that the incoming data 44 belongs to the command channel and are thus destined for the reduced slave function (RNC) .
  • the reduced slave function reads the data field 44B of the command word 44 which indicates that the data fields 44C-4D should be written into the entries 43b-43d in the channel table 42.
  • the only assignment the reduced slave function has m this implementation is to copy data received in a special time slot (f) into indicted entries (b-d) in the memory 42.
  • the reduced slave function may also have more advanced assignments, such as interpreta ⁇ tion of incoming messages (command words) .
  • the informa ⁇ tion about what time slots for the slave node to read may also arrive in several separate command words.
  • the result of the above procedure is that the slave node now is set to read data also m the time slots b-d corresponding to the entries 43b-43d and that the end user of the data received in these slots is VOD.
  • VOD represents an end user attached to the slave node that is to receive data.
  • the master node has information about which end users that are attached to the slave node.
  • the invention is not limited to the embodiments described above with reference to the drawings, but can easily be modified within the scope of the accompanying patent claims.
  • the invention is further not restricted to DTM networks but can be used in any time multiplexed networks with cycles and time slots of arbitrary sizes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Time-Division Multiplex Systems (AREA)
  • Small-Scale Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention se rapporte au domaine du transfert de données en tranches de temps à l'intérieur d'une structure d'un réseau à multiplexage dans le temps (46) qui comprend un n÷ud pilote (45) et un n÷ud asservi (47). L'affectation de tranches de temps (53) pour le n÷ud asservi (47) à utiliser lors de la réception de données provenant d'un troisième n÷ud (49) ou de la transmission de données vers ce troisième n÷ud (49) est commandée par le n÷ud pilote (45).
PCT/SE1997/000522 1996-03-25 1997-03-25 Affectation de n×uds pilotes de tranches de temps pour n×uds asservis WO1997036400A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU23149/97A AU2314997A (en) 1996-03-25 1997-03-25 Master node allocation of time slots for slave nodes
EP97915819A EP0886933A1 (fr) 1996-03-25 1997-03-25 Affectation de n uds pilotes de tranches de temps pour n uds asservis

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9601133-3 1996-03-25
SE9601133A SE508794C2 (sv) 1996-03-25 1996-03-25 Slavnoder

Publications (1)

Publication Number Publication Date
WO1997036400A1 true WO1997036400A1 (fr) 1997-10-02

Family

ID=20401929

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE1997/000522 WO1997036400A1 (fr) 1996-03-25 1997-03-25 Affectation de n×uds pilotes de tranches de temps pour n×uds asservis

Country Status (4)

Country Link
EP (1) EP0886933A1 (fr)
AU (1) AU2314997A (fr)
SE (1) SE508794C2 (fr)
WO (1) WO1997036400A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000078077A1 (fr) * 1999-06-10 2000-12-21 Net Insight Ab Procede et reseau de communication mobile pour l'interconnexion de stations de base et de centres de commutation mobiles
WO2001078329A1 (fr) * 2000-03-30 2001-10-18 Net Insight Ab Procedes permettant d'etablir une signalisation de commande entre des noeuds connectes a la meme ligne de communication
EP1264738A3 (fr) * 2001-06-05 2004-06-09 Autonetworks Technologies, Ltd. Faisceau de cables
WO2004062315A1 (fr) * 2002-12-16 2004-07-22 Intel Corporation Systeme, procede et dispositif permettant de transmettre un message d'etat d'intervalle temporel entre des noeuds sonet
WO2004113129A1 (fr) * 2003-06-20 2004-12-29 Sistemas Integrados Para La Automoción, S.L. Systeme de cablage numerique destine a des vehicules
EP1610498A1 (fr) * 2004-06-21 2005-12-28 Gefran S.p.A. Protocole de synchronisation et de communication pour processus distant
EP2141839A1 (fr) * 2008-06-30 2010-01-06 Thomson Licensing, Inc. Procédé et dispositif pour emprunter des intervalles de temps
EP1838060A3 (fr) * 2006-03-22 2010-11-24 Yamaha Corporation Dispositif de réseau audio
US11251863B2 (en) * 2016-09-21 2022-02-15 Huawei Technologies Co., Ltd. Protection switching method and node

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1989008363A1 (fr) * 1988-03-02 1989-09-08 Telefonaktiebolaget L M Ericsson Systeme de telecommunication pour la transmission d'informations entre des abonnes relies a un systeme de bus
US4949395A (en) * 1989-07-07 1990-08-14 Telefonaktiebolaget L M Ericsson Method and arrangement for dynamically allocating time slots to connections in a digital mobile radio system
EP0477659A1 (fr) * 1990-09-28 1992-04-01 ALCATEL ITALIA S.p.A. Procédé et dispositif d'allocation d'intervalles de temps dans un réseau en étoile

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1989008363A1 (fr) * 1988-03-02 1989-09-08 Telefonaktiebolaget L M Ericsson Systeme de telecommunication pour la transmission d'informations entre des abonnes relies a un systeme de bus
US4949395A (en) * 1989-07-07 1990-08-14 Telefonaktiebolaget L M Ericsson Method and arrangement for dynamically allocating time slots to connections in a digital mobile radio system
EP0477659A1 (fr) * 1990-09-28 1992-04-01 ALCATEL ITALIA S.p.A. Procédé et dispositif d'allocation d'intervalles de temps dans un réseau en étoile

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
COMPUTER NETWORKS AND ISDN SYSTEMS, Volume 24, No. 2, April 1992, (Amsterdam), LARS GAUFFIN, "Multi-Gigabit Networking Based on DTM", pages 119-130. *
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Volume 14, No. 2, February 1996, CHRISTER BOHM et al., "Fast Circuit Switching for the Next Generation of High Performance Networks", pages 299-300. *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000078077A1 (fr) * 1999-06-10 2000-12-21 Net Insight Ab Procede et reseau de communication mobile pour l'interconnexion de stations de base et de centres de commutation mobiles
WO2001078329A1 (fr) * 2000-03-30 2001-10-18 Net Insight Ab Procedes permettant d'etablir une signalisation de commande entre des noeuds connectes a la meme ligne de communication
US6934284B1 (en) 2000-03-30 2005-08-23 Net Insight Ab Methods for establishing control signaling at link start-up
EP1264738A3 (fr) * 2001-06-05 2004-06-09 Autonetworks Technologies, Ltd. Faisceau de cables
US7525989B2 (en) 2002-12-16 2009-04-28 Intel Corporation System, method and device for time slot status messaging among SONET nodes
WO2004062315A1 (fr) * 2002-12-16 2004-07-22 Intel Corporation Systeme, procede et dispositif permettant de transmettre un message d'etat d'intervalle temporel entre des noeuds sonet
WO2004113129A1 (fr) * 2003-06-20 2004-12-29 Sistemas Integrados Para La Automoción, S.L. Systeme de cablage numerique destine a des vehicules
CN100408381C (zh) * 2003-06-20 2008-08-06 汽车集成电路系统股份有限公司 用于车辆的数字布线系统
US7719133B2 (en) 2003-06-20 2010-05-18 Sistemas Integrados Para La Automocion, S.L. Digital wiring system for vehicles
EP1610498A1 (fr) * 2004-06-21 2005-12-28 Gefran S.p.A. Protocole de synchronisation et de communication pour processus distant
EP1838060A3 (fr) * 2006-03-22 2010-11-24 Yamaha Corporation Dispositif de réseau audio
EP2360881A1 (fr) * 2006-03-22 2011-08-24 Yamaha Corporation Dispositif de réseau audio
US8189602B2 (en) 2006-03-22 2012-05-29 Yamaha Corporation Audio network system
EP2485445A1 (fr) * 2006-03-22 2012-08-08 Yamaha Corporation Procédé pour executer une connexion de ligne dans un sytstème de réseau audio
EP2141839A1 (fr) * 2008-06-30 2010-01-06 Thomson Licensing, Inc. Procédé et dispositif pour emprunter des intervalles de temps
US11251863B2 (en) * 2016-09-21 2022-02-15 Huawei Technologies Co., Ltd. Protection switching method and node

Also Published As

Publication number Publication date
SE9601133L (sv) 1997-10-10
SE9601133D0 (sv) 1996-03-25
SE508794C2 (sv) 1998-11-09
EP0886933A1 (fr) 1998-12-30
AU2314997A (en) 1997-10-17

Similar Documents

Publication Publication Date Title
US5524113A (en) ATM switch interface
US6320863B1 (en) Backplane architecture for dynamic synchronous transfer mode
US5982780A (en) Resource management scheme and arrangement
US5410542A (en) Signal computing bus
RU99107134A (ru) Узел и интерфейс телекоммуникационной системы (варианты) и способ установления сопряжения
US5982747A (en) Method for managing failures on dynamic synchronous transfer mode dual ring topologies
JPH0574978B2 (fr)
WO2002015460A2 (fr) Topologie specifiee par un protocole d'auto-configuration de liaison
EP0685951A2 (fr) Interface de ligne pour réseau de paquets rapide
US5838687A (en) Slot reuse method and arrangement
JPH10285185A (ja) Ａｔｍネットワークにおいてデータ・セル伝送をスケジューリングする方法
EP1068699A1 (fr) Procede et dispositif de synchronisation du mode de transfert synchrone dynamique dans une architecture en anneau
WO1997036400A1 (fr) Affectation de n×uds pilotes de tranches de temps pour n×uds asservis
US5960002A (en) Defragmentation method and arrangement
US20020126688A1 (en) Bitstream management
CN1247684A (zh) 电信网络中的连接设备
Bohm et al. The DTM gigabit network
GB2261796A (en) A TDM parallel communications bus
Lindgren et al. Fast Connection Establishment in the DTM Gigabit Network.
US20020126687A1 (en) Bitstream management
Bohm The DTM protocol: Design and Implementation
JP3142027B2 (ja) フレ−ム振り分け多重化方法およびそれを用いた交換システム
JP2667766B2 (ja) ノード間接続方式
Kaario et al. Dimensioning of a multimedia switching bus
JP3075276B2 (ja) ファイバーチャネルファブリックおよびファブリックポート

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AT AU AZ BA BB BG BR BY CA CH CN CU CZ CZ DE DE DK DK EE EE ES FI FI GB GE GH HU IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SK TJ TM TR TT UA UG US UZ VN YU AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1997915819

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

Ref document number: 97534329

Format of ref document f/p: F

WWP Wipo information: published in national office

Ref document number: 1997915819

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

WWW Wipo information: withdrawn in national office

Ref document number: 1997915819

Country of ref document: EP

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载