WO2001033780A1 - Procede permettant de gerer les ressources d'un reseau de communication numerique de multiplexage par repartition dans le temps - Google Patents

Procede permettant de gerer les ressources d'un reseau de communication numerique de multiplexage par repartition dans le temps Download PDF

Info

Publication number
WO2001033780A1
WO2001033780A1 PCT/SE2000/002107 SE0002107W WO0133780A1 WO 2001033780 A1 WO2001033780 A1 WO 2001033780A1 SE 0002107 W SE0002107 W SE 0002107W WO 0133780 A1 WO0133780 A1 WO 0133780A1
Authority
WO
WIPO (PCT)
Prior art keywords
time slot
node
nodes
link
ownership
Prior art date
Application number
PCT/SE2000/002107
Other languages
English (en)
Inventor
Johan Ageby
Christer Bohm
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 AU15635/01A priority Critical patent/AU1563501A/en
Publication of WO2001033780A1 publication Critical patent/WO2001033780A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/08—Time only switching
    • 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
    • H04L12/423—Loop networks with centralised control, e.g. polling
    • 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
    • H04L12/427—Loop networks with decentralised control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13176—Common channel signaling, CCS7
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13204—Protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13292—Time division multiplexing, TDM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13392—Channels assigned according to rules

Definitions

  • the present invention relates to a method m connection with controlling utilisation of communication resources m a digital time-division multiplexed communication network. More particularly, the present invention relates to allocation of time slots m a Dynamic synchronous Transfer Mode (DTM) network.
  • DTM Dynamic synchronous Transfer Mode
  • a DTM network is an example of a circuit switched time- division multiplexed communication network designed for broadband data transfer m public and local area networks.
  • DTM architecture see for example Ch ⁇ ster Bohm, Per mdgren, Lars Ramfelt, and Peter Sjodin, "The DTM Gigabit Network", Journal of High Speed Networks, 3(2), 109-126, 1994, and Lars Gauffin, Lars Hakansson, and B orn Pehrson, "Multi-gigabit networking based on DTM", Computer Networks and ISDN Systems, 24(2), 119-139, April 1992.
  • the topology of a DTM network is based on unidirectional communication on time-division multiplexed bitstreams propagating on optical fibres, each bitstream preferably being accessed by multiple nodes, e.g. m a bus or ring structure.
  • the bandwidth of each wavelength is divided into 125 ⁇ s frames, which m turn are divided into 64-bit time slots.
  • Write access to such slots is governed by allocation of slots to different nodes.
  • a node may v/ ⁇ te data into a specific slot, i.e. into a specific time slot position withm each frame, only if the node has write access to this specific slot position.
  • the slot access protocol guarantees the slot access to be conflict free, which means tha any two or more nodes do not write data I ⁇ XO the same slot.
  • write access to the time slots of said frame is typically distributed among the nodes having access to said bitstream.
  • a node will thus typically own a number of time slots withm the frame and may thereby use these time slots for transmission.
  • slot ownership may be changed when required. For example, a node that owns a time slot may, if so requested or required, give away slot ownership of that time slot to a second node that is m need of capacity. The other node will thus be the new owner of the time slot and will, from then on, have the write access to this slot.
  • a first node that owns a time slot may also, if so desired or required, temporarily lend the write access to that time slot to a second node that for some reason requires more transmission capacity.
  • the second node borrowing the time slot will temporarily have the write access to the time slot, but will typically be obliged to, at some point time, return write access to the slot to the owner of the slot, i.e. to the first node.
  • O9736402 discloses a method a communication network of the aforementioned kind, which the degree of temporary allocation of time slots is evaluated, and m which, responsive to the evaluation of temporary allocation, the number of slots being owned by nodes is changed accordingly. That is, the ownership of a time slot is transferred from one node to another based on the degree of borrowing of time slots.
  • the signalling preceding the reallocation of a time slot produces overhead signalling the network, thereby introducing a problem of reduced bandwidth available for data transfer.
  • attempts to reduce the overhead signalling due co time slot reallocat on can cause further problems relating to deteriorating fragmentation of time slots the network.
  • reallocation of time slots between nodes is quick and "simple", i.e. not introducing excess control needs m the network, for providing adaptability to the instantaneous data transfer requirements of the nodes.
  • means must be provided for preventing severe fragmentation of time slots m the long-term perspective .
  • control of ownership change of time slots is thus centralised to one node operative to control distribution changes of time slot ownership on behalf of at least two or more other nodes on a link, while the procedure of borrowing/lending of time slots is decentralised the network, i.e. the responsibility of controlling loan of time slots is left to the nodes themselves, without interference from the node controlling the ownership
  • loan and ownership of time slots is handled by separate mechanisms, thereby making implementation of these features less complicated. Furthermore, the requirements on the chosen implementation are relaxed by the mechanisms being separate.
  • a method is provided where the short term needs m the system, such as instantaneous demand for write access to time slots, is controlled by a decentralised loan procedure, while long term needs, such as ownership of time slots and avoidance of fragmentation, is controlled by a centralised procedure.
  • the present invention thus introduces the advantage of loan and ownership procedures being implemented at beneficial parts of the network. Accordingly, loan of time slots (short term needs) is controlled by distributed (decentralised) functions m the system and is thereby instantaneously responsive to changing demands of write access to time slots. Ownership of time slots and fragmentation issues (long term needs) is, on the other hand, controlled by centralised functions the system, thereby providing an overall view and long term structure of time slot ownership.
  • the use of a centralised approach for control of slot ownership simplifies design without negatively affecting channel set-up delays, as changes slot ownership are typically performed on a long term basis.
  • Fig. la is a schematic view of an exemplary topology of a time -division multiplexed network
  • Fig lb illustrates a preferred frame structure, and how the frames are divided into time slots
  • Fig. 2 is a schematic signalling diagram showing a loan procedure
  • Fig. 3 is a schematic signalling diagram showing an ownership change procedure .
  • FIG. la An exemplary communication network N m accordance with the present invention is shown fig. la.
  • the topology is a single-ring structure comprising one unidirectional ring link L. All nodes N on the link L can thus communicate by sending messages on the link.
  • the bandwidth of the link is divided into essentially fixed size, e.g. 125 ⁇ s, frames each comprising essentially fixed size, e.g. 64 bit, time slots, as shown fig. lb.
  • essentially fixed size e.g. 64 bit
  • time slots e.g. 64 bit
  • the number of time slots within each frame is around 3900.
  • the start of each frame is identified by a so-called synchronisation slot S, and the end of each frame is provided with so-called guard band slots G included to accommodate for small jitters m the network frame frequency.
  • the remaining slots of the frame are control and data slots used for transporting control signalling and payload data, respectively, between the nodes N on the link L. Write access to the control and data slots are distributed, and may at any time be redistributed as desired, among the nodes N connected to the link L.
  • control messages sent and received by nodes m the network.
  • These control messages include, but are not limited to, Resource Announce (RES_ANN) messages, Ownership Change Request (CH__REQ) messages, Resource Transfer Request (TR_REQ) messages, Resource Transfer (RES_TR) messages and Ownership Change (OWN_CH) messages.
  • RES_ANN Resource Announce
  • CH__REQ Ownership Change Request
  • TR_REQ Resource Transfer Request
  • OWN_CH Ownership Change
  • a Resource Announce (RES_ANN) message can be sent by any node, preferably broadcast to all nodes on the same link, and includes information on the amount of free resources (time slots) being owned by the sending node. This message is intermittently sent by all the nodes on the link to keep the other nodes updated on the demands of each node. If one node needs more time slots it can send a Resource Transfer Request (TR_REQ) message to one or more nodes, thereby requesting a loan of time slots. Such message will contain the amount of required resources (number of time slots) .
  • the node receiving the request If the node receiving the request has a surplus of slots, it can comply with the request, and send a Resource Transfer (RES_TR) message to the requesting node identifying the slots for which write access thereto is being transferred. In this way, the borrowing and lending of time slots is distributed m the network, and handled by the borrowing and lending nodes.
  • RES_TR Resource Transfer
  • any node can send an Ownership Change Request (CH_REQ) message to a master node, for example being appointed as the node having the lowest link layer address on the link, handling the ownership of time slots in the network, thereby alerting the master of a desired ownership change.
  • This message includes information on the amount of required resources (i.e. number of time slots required) .
  • the master node may at any time, for example based upon Ownership Change Request messages from nodes, based upon auditing the Resource Announce messages, based upon network operator input, based upon an evaluation of the degree of borrowing and lending of slots, or based upon input from another application decide to change the ownership distribution between nodes m the network.
  • a change ownership distribution of time slots is initiated by an Ownership Change (OWN_CH) message sent by the master node to all the nodes on the link.
  • This message is preferably broadcast, and includes information on which time slots are owned by which nodes. In this way, each node is informed about the ownership of every time slot. If a time slot that was previously owned by a certain node is no longer owned, nor use, by this node, the time slot is immediately transferred to the new owner by the old owner sending a Resource Transfer (RES__TR) message to the new owner. If, on the other hand, the time slot is being used by the old owner when the Ownership Change (OWN_CH) message transferring the ownership is received, the old owner will continue to use the slot, now being a borrowed time slot.
  • RES__TR Resource Transfer
  • each time slot is, by each node the network, considered to be in a certain state.
  • a time slot can be one of several states including, but not being limited to, the following states: FREE, i.e. the time slot is available for immediate use by the node ;
  • BUSY i.e. the time slot is used for transfer of data by the node, i.e. allocated to a channel (the time slot may be either owned by the node at issue or borrowed from another node) ⁇
  • LENT i.e. the time slot is owned by the node, but is temporarily allocated (lent) to another node
  • LOST i.e. the time slot is neither owned by the node at issue, nor borrowed from another node.
  • the state of a time slot will be affected in the following way, depending on its initial state, responsive to an Ownership Change message.
  • the time slot is initially in the FREE state, and the time slot is still owned by the node at issue after receiving the Ownership Change (OWN_CH) message, the time slot remains in the FREE state. If the time slot, on the other hand, is owned by another node after receiving the Ownership Change (OWN_CH) message, the time slot will go into the LOST state, and a Resource Transfer (RES_TR) message will be sent to the new owner.
  • RES_TR Resource Transfer
  • time slot is initially in the LENT state, and the time slot is still owned by the node at issue after receiving the Ownership Change (OWN__CH) message, the time slot remains in the LENT state. If the time slot, on the other hand, is owned by another node after the Ownership Change (OWN_CH) message, the time slot will go into the LOST state, without any further action.
  • the time slot will go into the LENT state. As soon as the node at issue receives a Resource Transfer (RES_TR) message regarding the particular time slot (from the previous owner) , the slot will go into the FREE state. If the time slot, on the other hand, is still owned by another node after reception of the Ownership Change (OWN_CH) message, the time slot will remain in the LOST state.
  • RES_TR Resource Transfer
  • the time slot will remain in this state regardless of the contents of the Ownership Change (0WN_CH) message. However, upon deallocation of the time slot from a channel, the time slot will go into the FREE state if the slot is still owned by the node at issue. If the slot is no longer owned by the node at issue after the Ownership Change (OWN_CH) message, the deallocation will put the slot in the LOST state, and a Resource Transfer (RES_TR) message will be sent to the new owner.
  • RES_TR Resource Transfer
  • a link is considered to comprise three nodes: A, B and C.
  • node C is a master node handling the distribution of time slot ownership between the nodes. All the nodes on the link intermittently broadcast Resource Announce (RES_ANN) messages 10 to all nodes on the link, these messages containing information on the number of slots m the FREE state at the respective sender of the message, and optionally information about a safe margin buffer or the number of slots being borrowed from other nodes.
  • RES_ANN Resource Announce
  • Node B then sends an Ownership Change Request message (CH_REQ) 11 to node C (the master node) , requesting ownership of a greater number of slots. It is not required by the master node to receive an Ownership Change Request for making a decision about ownership redistribution, but it is taken as an alert about a desire for redistribution of slot ownership.
  • CH_REQ Ownership Change Request message
  • All new slots allocated to node B will be put the LENT state by node B until write access to these slots is transferred to (and received by) node B. Any slots that are m the FREE state at node A, and for which node B is to be the new owner, are then more or less immediately transferred to node B (through a RES__TR message 13a) , thereby entering the LOST state at node A and entering the FREE state at node B. Slots used by (i.e. being m the BUSY state of) node A, and for which node B is to be the new owner, remains m the BUSY state at node A as long as the channel to which these slots are allocated is being used for transmission of data.
  • a link is considered to comprise three nodes: A, B and C.
  • node C is assumed to be a master node controlling the ownership of time slots.
  • the master node is not as such involved the loan procedure.
  • node A announces its resources by broadcasting a Resource Announce message (RES__ANN) 20 to all other nodes (including the master node) .
  • node B requires write access to a greater number of time slots for transmission of data.
  • B ⁇ the Resource Announce (RES_ANN) message 20 sent by node A node B receives the assumed information that node A keeps a surplus of time slots.
  • node B sends a Transfer Request (TR_REQ) message 21 to node A, requesting a transfer of time slots to node B (i.e. requesting a transfer of write access to time slots) .
  • TR_REQ Transfer Request
  • Node A replies to the request (complies with the request) by sending a Resource Transfer (RES_TR) message 22, containing an identification of the transferred time slots, to node B, node B thereby gaining write access to, i.e. borrowing, the identified time slots.
  • Node B then starts to transmit data using the transferred time slots.
  • node B returns some, or all, of the borrowed time slots to node A by sending a Resource Transfer (RES_TR) message 23 to node A, containing an identification of the returned time slots.
  • RES_TR Resource Transfer
  • the ownership of the borrowed time slots did not change during the loan procedure. However, if the time slots borrowed by node B have a new owner when they are to be returned, they are returned to the proper (new) owner.
  • the master node C is completely outside the loan procedure.
  • the master node C may, however, audit the loan procedure by listening to the messages sent by the borrowing and lending nodes.
  • the master node C itself may of course participate a loan procedure as any other node on the link, whereby the master not does not act as a master node, but rather as a normal borrowing/lending node, m accordance with the inventive loan procedure not requiring any controlling master node.
  • the present invention thus provides a method that significantly improves the efficiency of resource use m the communication system
  • time slot ownership and/or borrowing/lending has been described herein primarily with respect to time slot positions as such within a recurrent frame
  • such access could also advantageously be negotiated with respect to only a portion of the concerned link, thereby making it possible for different nodes to have access/control of the same time slot over different portions of the link, sometimes referred to as "slot reuse" .
  • slot reuse a preferred embodiment is not intended to limit the scope of the invention, but should merely be taken as a preferred mode of carrying out the invention.
  • the scope of the invention is defined in the appended claims .

Landscapes

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

Abstract

L'invention concerne un procédé permettant de gérer les ressources d'un réseau de communication numérique de multiplexage par répartition dans le temps. Ce réseau comprend des noeuds sur une liaison. Ces noeuds peuvent posséder des créneaux temporels et ils peuvent en prêter et en emprunter. Un noeud de cette liaison est chargé de commander les changements de propriété des créneaux temporels au profit d'au moins deux noeuds de la liaison, tandis que la commande de l'emprunt et du prêt des créneaux temporels est décentralisée parmi les noeuds de la liaison.
PCT/SE2000/002107 1999-11-05 2000-10-27 Procede permettant de gerer les ressources d'un reseau de communication numerique de multiplexage par repartition dans le temps WO2001033780A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU15635/01A AU1563501A (en) 1999-11-05 2000-10-27 A method for handling resources in a digital time division multiplexed communication network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9904025A SE9904025L (sv) 1999-11-05 1999-11-05 Förfarande i ett digitalt kommunikationssystem
SE9904025-5 1999-11-05

Publications (1)

Publication Number Publication Date
WO2001033780A1 true WO2001033780A1 (fr) 2001-05-10

Family

ID=20417632

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2000/002107 WO2001033780A1 (fr) 1999-11-05 2000-10-27 Procede permettant de gerer les ressources d'un reseau de communication numerique de multiplexage par repartition dans le temps

Country Status (3)

Country Link
AU (1) AU1563501A (fr)
SE (1) SE9904025L (fr)
WO (1) WO2001033780A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004055682A1 (fr) * 2002-12-17 2004-07-01 Kvaser Consultant Ab Schematisation de messages dans un systeme de commande et de supervision distribue
GB2457785A (en) * 2008-02-29 2009-09-02 Nec Electronics Corp Reservation of medium access slots in wimedia alliance
EP2141839A1 (fr) * 2008-06-30 2010-01-06 Thomson Licensing, Inc. Procédé et dispositif pour emprunter des intervalles de temps

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4866708A (en) * 1987-10-28 1989-09-12 American Telephone And Telegraph Company, At&T Bell Laboratories Communication channel ownership arrangement
EP0428407A2 (fr) * 1989-11-15 1991-05-22 Digital Equipment Corporation Liaison de communication intégrée ayant une largeur de bande attribuée dynamiquement et un protocole pour la transmission d'information de répartition
EP0510290A1 (fr) * 1991-04-22 1992-10-28 International Business Machines Corporation Insertion et extraction libre de collisions de canaux par commutation circuit dans une structure de transmission par commutation paquet
JPH04316240A (ja) * 1991-04-16 1992-11-06 Fuji Xerox Co Ltd 回線交換システムにおけるタイムスロット分散管理方式
WO1997024846A1 (fr) * 1995-12-28 1997-07-10 Dynarc Ab Procede et structure de gestion des ressources d'un reseau
WO1997036402A1 (fr) * 1996-03-25 1997-10-02 Net Insight Ab Procedure de reaffectation
WO1999055036A2 (fr) * 1998-04-17 1999-10-28 Net Insight Ab Procedes et appareils pour affecter des intervalles temporels a des canaux a commutation de circuits

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4866708A (en) * 1987-10-28 1989-09-12 American Telephone And Telegraph Company, At&T Bell Laboratories Communication channel ownership arrangement
EP0428407A2 (fr) * 1989-11-15 1991-05-22 Digital Equipment Corporation Liaison de communication intégrée ayant une largeur de bande attribuée dynamiquement et un protocole pour la transmission d'information de répartition
JPH04316240A (ja) * 1991-04-16 1992-11-06 Fuji Xerox Co Ltd 回線交換システムにおけるタイムスロット分散管理方式
EP0510290A1 (fr) * 1991-04-22 1992-10-28 International Business Machines Corporation Insertion et extraction libre de collisions de canaux par commutation circuit dans une structure de transmission par commutation paquet
WO1997024846A1 (fr) * 1995-12-28 1997-07-10 Dynarc Ab Procede et structure de gestion des ressources d'un reseau
WO1997036402A1 (fr) * 1996-03-25 1997-10-02 Net Insight Ab Procedure de reaffectation
WO1999055036A2 (fr) * 1998-04-17 1999-10-28 Net Insight Ab Procedes et appareils pour affecter des intervalles temporels a des canaux a commutation de circuits

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PATENT ABSTRACTS OF JAPAN *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004055682A1 (fr) * 2002-12-17 2004-07-01 Kvaser Consultant Ab Schematisation de messages dans un systeme de commande et de supervision distribue
US7711880B2 (en) 2002-12-17 2010-05-04 Lars-Berno Fredriksson Schematizing of messages in distributed control and supervision system
US8037226B2 (en) 2002-12-17 2011-10-11 Xinshu Management, L.L.C. Time and event based message transmission
US8364875B2 (en) 2002-12-17 2013-01-29 Xinshu Management, L.L.C. Time and event based message transmission
US8700836B2 (en) 2002-12-17 2014-04-15 Xinshu Management, L.L.C. Time and event based message transmission
US9594709B2 (en) 2002-12-17 2017-03-14 Callahan Cellular L.L.C. Time and event based message transmission
US10025738B2 (en) 2002-12-17 2018-07-17 Callahan Cellular L.L.C. Time and event based message transmission
US10579562B2 (en) 2002-12-17 2020-03-03 Callahan Cellular L.L.C. Time and event based message transmission
US11157429B2 (en) 2002-12-17 2021-10-26 Callahan Cellular L.L.C. Time and event based message transmission
GB2457785A (en) * 2008-02-29 2009-09-02 Nec Electronics Corp Reservation of medium access slots in wimedia alliance
EP2141839A1 (fr) * 2008-06-30 2010-01-06 Thomson Licensing, Inc. Procédé et dispositif pour emprunter des intervalles de temps

Also Published As

Publication number Publication date
SE9904025L (sv) 2001-05-06
SE9904025D0 (sv) 1999-11-05
AU1563501A (en) 2001-05-14

Similar Documents

Publication Publication Date Title
JP4299461B2 (ja) 回線切替チャネルへ時間スロットを割付ける方法および装置
US6504853B1 (en) Reallocation procedure
US6320863B1 (en) Backplane architecture for dynamic synchronous transfer mode
CA2060981C (fr) Insertion et extraction sans collision de canaux a commutation de circuits dans une structure de transmission a commutation de paquets
JP2970685B2 (ja) マルチチャネル伝送リング用のアクセス制御システム
AU1404197A (en) Method and arrangement for network resource administration
US5982747A (en) Method for managing failures on dynamic synchronous transfer mode dual ring topologies
US6631125B1 (en) Channel set-up in wideband, code division multiple access systems
JP3231307B2 (ja) 交換経路予約構成
US7305002B1 (en) Methods for controlling resources in a communication network
JP2002511704A (ja) リングトポロジにおける動的同期転送モードの同期化方法及び装置
US6108347A (en) Non-polled dynamic slot time allocation protocol
US5390182A (en) System for synchronous bandwidth allocation in token ring networks
JPH11215080A (ja) 上流側タイムスロットの割当てのための方法および装置と、該方法が使用される通信システム
EP1227610B1 (fr) Protocoles MAC intelligents et distribués pour réseaux en anneau DWDM
WO2001033780A1 (fr) Procede permettant de gerer les ressources d'un reseau de communication numerique de multiplexage par repartition dans le temps
US20020126688A1 (en) Bitstream management
WO2001033775A1 (fr) Procede de commande de ressources sur une liaison de communication transportant des donnees dans des intervalles de temps
EP0776560B1 (fr) Systeme de bus de donnees comprenant des moyens de controle des ressources
US20020126687A1 (en) Bitstream management
US6122297A (en) Arrangement and method relating to digital communication systems
WO2000062488A1 (fr) Procede et systeme concernant le controle de ressources dans un reseau de communication
Casale et al. A method for dynamic bandwidth allocation in the FDDI II MAN
WO1996028911A1 (fr) Systeme et procede de communication numerique
JPS6236942A (ja) ル−プ形通信システムにおけるバツフア管理方式

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

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

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

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

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP