EP0413123A1 - Method of transmitting data over an optical star network, and station and optical star network operating according to the same - Google Patents

Method of transmitting data over an optical star network, and station and optical star network operating according to the same Download PDF

Info

Publication number
EP0413123A1
EP0413123A1 EP90112834A EP90112834A EP0413123A1 EP 0413123 A1 EP0413123 A1 EP 0413123A1 EP 90112834 A EP90112834 A EP 90112834A EP 90112834 A EP90112834 A EP 90112834A EP 0413123 A1 EP0413123 A1 EP 0413123A1
Authority
EP
European Patent Office
Prior art keywords
star
network according
information
station
stations
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.)
Granted
Application number
EP90112834A
Other languages
German (de)
French (fr)
Other versions
EP0413123B1 (en
Inventor
Gianfranco De Cristofaris
Franco D'ignazio
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.)
Alcatel Lucent NV
Original Assignee
Alcatel NV
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 Alcatel NV filed Critical Alcatel NV
Publication of EP0413123A1 publication Critical patent/EP0413123A1/en
Application granted granted Critical
Publication of EP0413123B1 publication Critical patent/EP0413123B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44Star or tree networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/64Hybrid switching systems

Definitions

  • the present invention relates to a UCOL-type star network for the optimal management of various kinds of traf­fic according to the preamble of claim 1.
  • UCOL network is configured as a passive star where each station is connected with its star center via two dedicated optical fibres.One fibre serves for trans­mission from the station to the star center and the other one for reception.
  • Each optical fibre is assimilable to a multiple transmission channel.
  • optical fibre link using the coherent optics technology allows that different channels be multiplexed through frequency division and used for se­veral transmissions along the same fibre, thus optimizing the link resources.
  • the present access protocols do not fit with a UCOL network.
  • the access proto­col systems using the priority concept are already availab­le,at the present state of the art they appear to be intrin­secally very complicated as to frame structure.For such rea­son they cannot satisfy the functional characteristics of a UCOL network and cannot optimize the resources therein con­ tained.
  • the object of the present invention is to eliminate the drawbacks of the prior art and to provide a UCOL network able to meet all the mentioned requirements by using new access protocol features which allow to solve the access dispute to the resources of a type UCOL network and to optimize the network resources,as well as to be able to transmit simultaneously,along the same channel and through cell transmission, both synchronous and packet traffic.
  • such a network can operate both with synchronous and asynchronous traffic, by using the same channel (reference is made to packet and syn­chronous traffic as an example).
  • the ideal situation for a UCOL network is the one in which there is a continuous data flow, controlled by the access protocol from the stations 7,8,9,10...N to the star-center 6 without these data packets colliding each other thus generating an unintelligibility of their con­tents.
  • the access protocol accordinging to the present inven­tion,provides for the subdivision of each channel 1 into frames 2.
  • an optimal repetition time of each single frame,fixed in one millisecond,i.e. each frame re­peats at each millisecond in the transmission channel, is established.
  • the frame 2, according such an access proto­col, is then shared out,in this istance,into three parts. More particularly, into a first part 3 individuating basi­cally an information related to frame beginning; into a part 4 characterizing essentially an information about the status of data access queues from the various stations; as well as into a part 5 related to data informative contents from the various stations.
  • the part 3 of the beginning of frame comprises 48 bytes and is subdivided in two sections 3a and 3b.
  • the section 3a contains the information related to frame beginning.
  • the section 3 contains a field called GUARD TIME related to a time approximately evaluated as 50 nanoseconds which provides for measurement errors related to a time in­formation concerning the measurement of distance between a station and the star center 6,of which an exhaustive expla­nation will be given hereinafter,in order to avoid colli­ sion among the data blocks.
  • a first section 4a relative to the synchronization of data flow from the stations, which acts for discriminating seve­ral blocks transmitting in synchronism
  • a section 4b cal­led MGT (MANAGEMENT)
  • MANAGEMENT a section whose information acts for providing new communication channels for distributed networks upon new requests from management of the network itself.
  • sections 4c, 4d, 4e, 4f, 4g which, indicated in figure by P0 to P4, represent five priority classes related to access priority for data coming from the stations to the star center, used for selec­ting data access of a station with respect to the others, as a function of transmission priority, i.e. of wait time. All this to conform the synchronous traffic treatment modes to the packet traffic treatment mode, but considering that the synchronous traffic has a higher priority with respect to packet traffic.All the above mentioned traffics are thus managed by informations related to corresponding priority classes.
  • the higher priority class is that one ha­ving the lower number,i.e. class 0 represents the highest priority. Morevoer, class 0 is exclusively reserved for synchronous traffic,while the other ones are reserved for further priorities.
  • Each priority class has two bytes for quantizing the priority intrinsic value and which in any case represents, as priority class, a number proportional to the maximum time the information transmitted by a sta­tion, meant as data quantity, must wait before its trans­mission. Normally, this time decreases as the wait time increases and, when it reaches the maximum priority and is not transmitted, the packet is abandoned.
  • Each of the 64 subparts of part 4, configured as hereinbefore described, contains totally 28 bytes.
  • the part 5 related to informations is also structured in various sections: one,5a,for synchronism,as said in section 4a, another one containing an information characterizing both the source and the destination of the informative contents and the information beginning, and is indicated by 5b,and,in the end, there is the cell informa­tion,indicated by 5c, still closed by GUARD TIME field 5d.
  • the whole part 5 can contain 200 subparts, each structured in the same manner as part 5, from 5a to 5d, just illustrated and provided with 88 bytes for each of 200 subparts.
  • 16 bytes are used for synchronization, 3 bytes for identifying the terminal station and for having a spare for eventual applications not foreseen and, of the remaining bytes, 64 are used for the real information, also in conformity with the rules nowadays in use, and five for providing a further beginning of real intrinsic informative part.
  • each station sends initially an own signal toward the star center,waiting its return.
  • the initialization time in­formation which value corresponds with the distance of the station from the star center.
  • said time infor­mation characterizes an advance time for the transmission of data informative contents, which time begins when allowed by the synchronism information and the priority class and lasts for a period corresponding exactly to propagation de­lay of the information along the link optical channel and depends on the effective measured distance between the sta­tion and the star center.
  • the bytes present in the various sections of the va­rious parts 3,4,5 provide a data set which,travelling along channel 1, allow to avoid collisions among data coming from the various stations,optimize the channel sharing trough the one millisecond time, and allow to provide an informa­tion on the status of accesses through queues status 4.
  • cell transmissions can also be sent, as just mentioned, both in case of synchronous traffic and packet traffic.
  • Such a protocol structure for network access can be easily implemented because it can be subdivided into fur­ther frame shares without any difficulty.
  • the frame structure is particularly simple and does not imply any com­plication neither of bytes or further subparts burden.
  • the basic concepts of the network subject of the present invention can be summarized,on the one hand, in the initialization of stations according to their distance from the star center and,on the other hand, in the frame sharing into three parts 3,4,5, which provide together a plurality of characteristic informations,the access queues status, as well as the possibility of cell transmission, which make such type of protocol specific for UCOL networks.
  • Such networks have the particular star topology, as well as particular technical aspects such as distance and station number parameters, and the aforementioned services such as, inter alia, the possibility of managing simultaneously, on the same channel, both the synchronous traffic and the packet traffic.
  • the number of usable optical channels has been fixed equal to 24.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Optical Communication System (AREA)
  • Steering Control In Accordance With Driving Conditions (AREA)
  • Ceramic Products (AREA)
  • Power Steering Mechanism (AREA)
  • Casting Devices For Molds (AREA)
  • Traffic Control Systems (AREA)
  • Road Signs Or Road Markings (AREA)

Abstract

The present invention relates to a UCOL-type star network, comprising a central unit or passive star center and a plurality of depending stations intercommunicating via two-way optical fiber link channels, in which an access protocol generated by the stations linked to the star cen­ter shows a frame structure cyclically repeating every mil­lisecond,and is shared in at least three parts where, in the first one,informations related to frame beginning are idivi­duated,in the second one informations related to priority queues status are individuated, which informations allow to determine which station has access to the network, and are inherent to priority classes allowing to manage the various kinds of synchronous and asynchronous traffic, as well as a third part in which there is the information content to be transmitted, the whole under a constant control on data flow synchronism,in order to avoid a mutual data overlapping and to allow the sending of various kinds of traffic on the sa­me channel, upon initialization of each station with an own time information depending on its distance from the star center.

Description

  • The present invention relates to a UCOL-type star network for the optimal management of various kinds of traf­fic according to the preamble of claim 1.
  • As it is known,in the communications management in a network,where there are several transmitting stations,it is important to determine the access priorities of each sta­tion to the network itself,and then to the resources there­of,so as to avoid collision between the informative packets generated by the various stations.
  • Relatively to UCOL networks, such a problem is par­ticularly prominent due to their particular characteristics concerning topology, technical features and types of offe­red services.
  • Indeed,a UCOL network is configured as a passive star where each station is connected with its star center via two dedicated optical fibres.One fibre serves for trans­mission from the station to the star center and the other one for reception.
  • Each optical fibre is assimilable to a multiple transmission channel.
  • The particular kind of optical fibre link using the coherent optics technology,allows that different channels be multiplexed through frequency division and used for se­veral transmissions along the same fibre, thus optimizing the link resources.
  • As concerns the management of the access of each station to the network,the present access protocols do not fit with a UCOL network.Moreover,although the access proto­col systems using the priority concept are already availab­le,at the present state of the art they appear to be intrin­secally very complicated as to frame structure.For such rea­son they cannot satisfy the functional characteristics of a UCOL network and cannot optimize the resources therein con­ tained.
  • This is due to the fact that the trend of the ideal management of access disputes to network resources, during the transmission of the various data coming from the va­rious stations, is not well defined in the prior art.
  • Therefore,the object of the present invention is to eliminate the drawbacks of the prior art and to provide a UCOL network able to meet all the mentioned requirements by using new access protocol features which allow to solve the access dispute to the resources of a type UCOL network and to optimize the network resources,as well as to be able to transmit simultaneously,along the same channel and through cell transmission, both synchronous and packet traffic.
  • This object is achieved by the features set forth in the claim 1,whereas further details and improvements are evidenced in the subclaims.
  • From an operative point of view, such a network can operate both with synchronous and asynchronous traffic, by using the same channel (reference is made to packet and syn­chronous traffic as an example).
  • Moreover, with such a network it is possible to avoid the collision between data flows, being able to pro­vide for the errors due to information on the measurement of distance between the station and the star center,and it is possible to prepare the informations for transmission, knowing a transmission advance time which depends on the information propagation delay along the optical channel in addition to the measured distance between the station and the star-center.
  • Finally with such a network it is possible to clas­sify, thanks to priority classes, the kind of traffic to be managed.
  • The invention will now be described in detail next herein, by way of an example, with reference to the atta­ched drawings, wherein:
    • -in Fig.1 a UCOL network is schematically illus­trated; and
    • -in Fig.2 there is illustrated the frame structure of the access protocol of the UCOL transmission network, ac­cording to the present invention.
  • First of all it is a good thing to state beforehand that generally a UCOL network is to be considered as a mul­tichannel network,thereby the access protocol described he­reinafter is referred only to one channel,but what has been stated can be implemented on all others.
  • The ideal situation for a UCOL network is the one in which there is a continuous data flow, controlled by the access protocol from the stations 7,8,9,10...N to the star-center 6 without these data packets colliding each other thus generating an unintelligibility of their con­tents.
  • The access protocol,according to the present inven­tion,provides for the subdivision of each channel 1 into frames 2.
  • First of all, an optimal repetition time of each single frame,fixed in one millisecond,i.e. each frame re­peats at each millisecond in the transmission channel, is established. The frame 2, according such an access proto­col, is then shared out,in this istance,into three parts. More particularly, into a first part 3 individuating basi­cally an information related to frame beginning; into a part 4 characterizing essentially an information about the status of data access queues from the various stations; as well as into a part 5 related to data informative contents from the various stations.
  • Each of these parts is, in turn, subdivided into sec­tions having a well defined quantity of bytes.
  • The part 3 of the beginning of frame,specifically, comprises 48 bytes and is subdivided in two sections 3a and 3b. The section 3a contains the information related to frame beginning.The section 3 contains a field called GUARD TIME related to a time approximately evaluated as 50 nanoseconds which provides for measurement errors related to a time in­formation concerning the measurement of distance between a station and the star center 6,of which an exhaustive expla­nation will be given hereinafter,in order to avoid colli­ sion among the data blocks.
  • In part 4 of frame 2,related to queues status, are a first section 4a,relative to the synchronization of data flow from the stations, which acts for discriminating seve­ral blocks transmitting in synchronism; a section 4b, cal­led MGT (MANAGEMENT), which is an additional section whose information acts for providing new communication channels for distributed networks upon new requests from management of the network itself.
  • In part 4 are then five more sections 4c, 4d, 4e, 4f, 4g, which, indicated in figure by P0 to P4, represent five priority classes related to access priority for data coming from the stations to the star center, used for selec­ting data access of a station with respect to the others, as a function of transmission priority, i.e. of wait time. All this to conform the synchronous traffic treatment modes to the packet traffic treatment mode, but considering that the synchronous traffic has a higher priority with respect to packet traffic.All the above mentioned traffics are thus managed by informations related to corresponding priority classes.
  • Normally, the higher priority class is that one ha­ving the lower number,i.e. class 0 represents the highest priority. Morevoer, class 0 is exclusively reserved for synchronous traffic,while the other ones are reserved for further priorities. Each priority class has two bytes for quantizing the priority intrinsic value and which in any case represents, as priority class, a number proportional to the maximum time the information transmitted by a sta­tion, meant as data quantity, must wait before its trans­mission. Normally, this time decreases as the wait time increases and, when it reaches the maximum priority and is not transmitted, the packet is abandoned.
  • In part 4 according to access queues status in the frame, it is decided which of the packets must be transmit­ted with the subsequent frame.
  • Now ,since in the present case the maximun foreseen number of stations is better to be 64, in such part there are 64 subparts, each structured as part 4 just described from 4a to 4h.
  • Also in part 4,at the end of the five priority clas­ses,there is a GUARD TIME field, in that case indicated by 4h,having the same purposes of the previous one, namely 3b.
  • Each of the 64 subparts of part 4, configured as hereinbefore described, contains totally 28 bytes.
  • For the synchronization,16 bytes are needed,while for section 4b,2 bytes are needed; on the contrary, for each priority class,2 bytes are necessary.
  • Finally,the part 5 related to informations is also structured in various sections: one,5a,for synchronism,as said in section 4a, another one containing an information characterizing both the source and the destination of the informative contents and the information beginning, and is indicated by 5b,and,in the end, there is the cell informa­tion,indicated by 5c, still closed by GUARD TIME field 5d. The whole part 5 can contain 200 subparts, each structured in the same manner as part 5, from 5a to 5d, just illustrated and provided with 88 bytes for each of 200 subparts.
  • Of these 88, 16 bytes are used for synchronization, 3 bytes for identifying the terminal station and for having a spare for eventual applications not foreseen and, of the remaining bytes, 64 are used for the real information, also in conformity with the rules nowadays in use, and five for providing a further beginning of real intrinsic informative part.
  • Obviously, several informations pertaining to more than one of such 200 subparts, can be grouped together so as to provide a single informative concept.
  • After each frame has been prepared and after each station is enabled to send its informations, the entire net­work will have its map of informative cells wherein each station will have priorities characterized by priority clas­ses 4c to 4g.
  • All this occurs upon initialization of each station with an own time information depending upon its distance from the star center.
  • Indeeed,each station sends initially an own signal toward the star center,waiting its return. In this way it is possible for each station to get the initialization time in­formation, which value corresponds with the distance of the station from the star center. In substance, said time infor­mation characterizes an advance time for the transmission of data informative contents, which time begins when allowed by the synchronism information and the priority class and lasts for a period corresponding exactly to propagation de­lay of the information along the link optical channel and depends on the effective measured distance between the sta­tion and the star center.
  • The bytes present in the various sections of the va­rious parts 3,4,5 provide a data set which,travelling along channel 1, allow to avoid collisions among data coming from the various stations,optimize the channel sharing trough the one millisecond time, and allow to provide an informa­tion on the status of accesses through queues status 4.
  • Moreover, cell transmissions can also be sent, as just mentioned, both in case of synchronous traffic and packet traffic.
  • Such a protocol structure for network access can be easily implemented because it can be subdivided into fur­ther frame shares without any difficulty.Besides, the frame structure is particularly simple and does not imply any com­plication neither of bytes or further subparts burden.
  • The basic concepts of the network subject of the present invention can be summarized,on the one hand, in the initialization of stations according to their distance from the star center and,on the other hand, in the frame sharing into three parts 3,4,5, which provide together a plurality of characteristic informations,the access queues status, as well as the possibility of cell transmission, which make such type of protocol specific for UCOL networks. Indeed, such networks have the particular star topology, as well as particular technical aspects such as distance and station number parameters, and the aforementioned services such as, inter alia, the possibility of managing simultaneously, on the same channel, both the synchronous traffic and the packet traffic.
  • Relatively to the UCOL network described in the present invention, the number of usable optical channels has been fixed equal to 24.
  • It must be specified that the maximum number of sta­tions linkable to the star center via optical channels should never exceed thirty kilometers, since such parameters should largely influence the network performances.
  • Obviously, other improvements and developments are also possible, all falling within the inventive sphere of the present invention.

Claims (12)

1) A UCOL-type star network for an optimal mana­gement of various kinds of traffic, of the type comprising a central unit or passive star center and a plurality of de­pending stations connected via two-way optical fiber chan­nels,said stations communicating trough an access protocol comprising a frame structure, said network being characteri­zed in this, that the stations, once assumed an initialita­tion time information, which is characteristic of each sta­tion and function of its distance from the star center, are able to generate an own access protocol wherein each frame is presented in a sequential fashion and cyclically repea­ted in time with a duration fixed and structurally divided into several time parts in which it is possible to indivi­duate informations concerning the beginning of the frame, the priority queues status to determine the access to the network of the stations data and the priority classes cor­responding to various kinds of traffic, as well as the in­formative contents to be effectively transmitted by each station, once a synchcronism information of data flow, cy­clically transmitted by one of the stations, has obtained the consent for transmitting the informative data contents.
2) A star network according to claim 1, characteri­zed in that said time information individuates an advance time of the informative contents, present in data which begins when allowed by the synchronism information and by priority class and lasts for a period corresponding exactly to the propagation delay of the information along the link optical channel and depends on the effective dis­tance measured between the station and the star center.
3) A star network according to claim 1, characteri­zed in that the number of said priority classes is equal to the various kinds of traffic which can be managed by said network.
4) A star network according to claim 1, characteri­zed in that the informative data contents is transmitted in cell modules.
5) A star network according to claim 1, characteri­zed in that said time parts are at least three, in each fra­me, namely a first part in which there are identified a first section containing said information related to frame beginning, and another containing a further field,called G.T.(GUARD TIME) ,to provide for the errors related to the information about the measurement of the distance between station and star centers ; a second part in turn divided into a number of subparts equal to the number of stations mana­geable in said network, in each of which there are identi­fied a section containing said information related to data flow synchronism,a series of sections containing said in­formations related to priority classes and to priority queues status, and a final section containing a further field of aforesaid G.T. type; as well as a third part in turn subdivided into a plurality of subparts, in each of which there are identified a section containing the infor­mation related to data flow synchronism, a section assigned to the intrinsic informative contents and a final section containing a further field of aforesaid G.T. type.
6) A star transmission network according to claim 1, characterized in that the fixed repetition time of the frame is of one millisecond.
7) A star transmission network according to claim 5, characterized in that in each subpart of the second part there is also a further section, called MGT (MANAGEMENT) containing an information representing an additional sec­tion,which provides new transmission channels upon new de­ mands in the network management.
8) A star transmission network according to claim 5, characterized in that in each subpart of third part the­re is also a further section containing the information re­lated to the source of the informative contents transmitted with the cell module.
9) A star network according to claims 1 or 5, cha­racterized in that the first part contains a total number of bytes equal to 48.
10) A star network according to claim 5, characteri­zed in that each subpart of the second part has a number of bytes equal to 28.
11) A star network according to claim 5, characteri­zed in that each subpart of the third part has a number of bytes equal to 88, 69 of which belonging to the informative module cell.
12) A star network according to what hereinbefore described and illustrated for the specified objects.
EP90112834A 1989-07-06 1990-07-05 Method of transmitting data over an optical star network, and station and optical star network operating according to the same Expired - Lifetime EP0413123B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
IT2111289 1989-07-06
IT8921112A IT1230301B (en) 1989-07-06 1989-07-06 STAR TRANSMISSION NETWORK, UCOL TYPE, FOR THE OPTIMAL MANAGEMENT OF DIFFERENT TYPES OF TRAFFIC.

Publications (2)

Publication Number Publication Date
EP0413123A1 true EP0413123A1 (en) 1991-02-20
EP0413123B1 EP0413123B1 (en) 1995-01-18

Family

ID=11176923

Family Applications (1)

Application Number Title Priority Date Filing Date
EP90112834A Expired - Lifetime EP0413123B1 (en) 1989-07-06 1990-07-05 Method of transmitting data over an optical star network, and station and optical star network operating according to the same

Country Status (9)

Country Link
US (1) US5172374A (en)
EP (1) EP0413123B1 (en)
JP (1) JP2758068B2 (en)
AT (1) ATE117488T1 (en)
DE (1) DE69016126T2 (en)
ES (1) ES2070217T3 (en)
FI (1) FI102339B (en)
GR (1) GR3014921T3 (en)
IT (1) IT1230301B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0506214A1 (en) * 1991-03-27 1992-09-30 Siemens Aktiengesellschaft Method for operating a multiplex-control for an on-board network for automotive-vehicle
US5483532A (en) * 1991-07-04 1996-01-09 Telefonaktiebolaget Lm Ericsson Method of packeting continuous data information and packet data in frames

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5570364A (en) * 1994-04-14 1996-10-29 Lucent Technologies Inc. Control for multimedia communication on local access table
JP3262453B2 (en) * 1994-05-13 2002-03-04 キヤノン株式会社 Information sharing method, line allocation method, and communication system using the same
DE19511332A1 (en) * 1995-03-28 1996-10-02 Sel Alcatel Ag Broadband distribution system and method therefor
US5680394A (en) * 1995-07-11 1997-10-21 Amati Communications Corporation Time division duplexed high speed data transmission system and method
JP3832860B2 (en) * 1996-09-07 2006-10-11 バイエリッシェ モートーレン ウエルケ アクチエンゲゼルシャフト Data bus for multiple bus sharing devices
US6904057B2 (en) 2001-05-04 2005-06-07 Slt Logic Llc Method and apparatus for providing multi-protocol, multi-stage, real-time frame classification
US6901052B2 (en) 2001-05-04 2005-05-31 Slt Logic Llc System and method for policing multiple data flows and multi-protocol data flows
EP1953959A1 (en) * 2007-02-01 2008-08-06 British Telecommunications Public Limited Company Data communication

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0255442A2 (en) * 1986-07-30 1988-02-03 ALCATEL ITALIA S.p.A. Circuit device for implementing the access protocol for serial exchange of numerical informations among terminals interconnected by an optical fiber star network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0255442A2 (en) * 1986-07-30 1988-02-03 ALCATEL ITALIA S.p.A. Circuit device for implementing the access protocol for serial exchange of numerical informations among terminals interconnected by an optical fiber star network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Ninth International Conference on Computer Communication October 1988, NORTH HOLLAND-AMSTERDAM (NL) pages 373 - 378; S.TREVES: "BROADBAND LOCAL AND METROPOLITAN AREA NETWORKS IN AN IBCN ENVIRONMENT" *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0506214A1 (en) * 1991-03-27 1992-09-30 Siemens Aktiengesellschaft Method for operating a multiplex-control for an on-board network for automotive-vehicle
US5483532A (en) * 1991-07-04 1996-01-09 Telefonaktiebolaget Lm Ericsson Method of packeting continuous data information and packet data in frames

Also Published As

Publication number Publication date
ATE117488T1 (en) 1995-02-15
JP2758068B2 (en) 1998-05-25
ES2070217T3 (en) 1995-06-01
FI102339B1 (en) 1998-11-13
IT1230301B (en) 1991-10-18
FI903400A0 (en) 1990-07-05
JPH0345044A (en) 1991-02-26
DE69016126T2 (en) 1995-06-08
FI102339B (en) 1998-11-13
GR3014921T3 (en) 1995-05-31
EP0413123B1 (en) 1995-01-18
US5172374A (en) 1992-12-15
IT8921112A0 (en) 1989-07-06
DE69016126D1 (en) 1995-03-02

Similar Documents

Publication Publication Date Title
US6490256B1 (en) Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
Chipalkatti et al. Protocols for optical star-coupler network using WDM: Performance and complexity study
KR100447302B1 (en) Communications protocol for packet data particularly in mesh topology wireless networks
US6141336A (en) Traffic scheduling method, system and article of manufacture for a wireless access to an asynchronous transfer mode network
US7925162B2 (en) Communication system and method for an optical local area network
US5570355A (en) Method and apparatus enabling synchronous transfer mode and packet mode access for multiple services on a broadband communication network
CA2469142A1 (en) Optical network communication system
EP0413123A1 (en) Method of transmitting data over an optical star network, and station and optical star network operating according to the same
CA2443066C (en) Time slot scheduling for shared-medium communications networks
CN103441960A (en) Real-time multi-business data communication multiplexing method of electric power system
US6181947B1 (en) System for the wireless transmission of a frame-synchronized signal between a radio base station and at least one mobile terminal
US20020052956A1 (en) Method for allocating resources
US6298049B1 (en) Method and arrangement for upstream timeslot assignment, and communication system wherein the method is used
Cheung et al. EQEB-a multi-channel extension of the DQDB protocol with tunable channel access
US6160823A (en) Transmission system formed by at least a base station, a mobile station and a nodal station and base station and mobile station suitable for use in such a system
Marsan et al. On the performance of topologies and access protocols for high-speed LANs and MANs
EP1365623B1 (en) Timeslot management method and upstream signal frame structure
Levine et al. A reservation and collision-free media access protocol for optical star local area networks
JPH07505032A (en) Transmission time allocation method in passive optical communication network
JP2563820B2 (en) Information transfer device
Chipalkatti et al. A hybrid dynamic reservation protocol for an optical star network
Choi Performance analysis of a bandwidth guaranteed medium access control protocol for WDM local networks
Strosslin et al. A¯ flexible MAC protocol for all-optical WDM metropolitan area networks
Martini et al. Real-time communication in the demand-priority LAN-the effects on normal priority traffic
Kohashi et al. Integrated-circuit and packet-switching applications to a loop system for local area networks

Legal Events

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

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

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

RBV Designated contracting states (corrected)

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

17P Request for examination filed

Effective date: 19910803

17Q First examination report despatched

Effective date: 19930820

RBV Designated contracting states (corrected)

Designated state(s): AT BE CH DE ES FR GB GR LI NL SE

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE ES FR GB GR LI NL SE

REF Corresponds to:

Ref document number: 117488

Country of ref document: AT

Date of ref document: 19950215

Kind code of ref document: T

REF Corresponds to:

Ref document number: 69016126

Country of ref document: DE

Date of ref document: 19950302

ET Fr: translation filed
REG Reference to a national code

Ref country code: GR

Ref legal event code: FG4A

Free format text: 3014921

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2070217

Country of ref document: ES

Kind code of ref document: T3

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19980612

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SE

Payment date: 19980624

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 19980625

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 19980629

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19980630

Year of fee payment: 9

Ref country code: GR

Payment date: 19980630

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 19980701

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 19980709

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: ES

Payment date: 19980716

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990705

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990705

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990706

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: THE PATENT HAS BEEN ANNULLED BY A DECISION OF A NATIONAL AUTHORITY

Effective date: 19990730

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990731

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990731

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990731

Ref country code: GR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990731

BERE Be: lapsed

Owner name: ALCATEL N.V.

Effective date: 19990731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20000201

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19990705

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

EUG Se: european patent has lapsed

Ref document number: 90112834.8

NLV4 Nl: lapsed or anulled due to non-payment of the annual fee

Effective date: 20000201

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20000503

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20000810

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20090716

Year of fee payment: 20