Time division multiplexed link connections between a switching matrix and a port in a network element
9 claims: 3 independent, 6 dependent
- 1A network element comprising an input port (PORT) and time division multiplex switching matrices (SWITCH, A to D), said input port being connected to said switching matrices through a number of backpanel connections, wherein the input port (PORT) is adapted to receive a number of input flows (L0 to L15), wherein each of said input flows (L0 to L15)is in the form of bits arranged in frames, wherein each frame comprises tributaries, wherein the input port (PORT) comprises:a memory for storing a predetermined number of bytes for each tributary;a slicer for slicing the stored predetermined number of bytes for each tributary, thus forming a number of word structures;and a backpanel framer for forming backpanel frames with said word structures, characterized in that the number of said word structures, for each tributary is equal to the number of said switching matrices (SWITCH, A to D), in that the capacity of the input flow is equal to the capacity of the overall backpanel connection capacity, and in that each backpanel frame (A0) comprises, for a number of input flows (L0, L1, L2, L3) equal to the number of switching matrices (A to D), a corresponding word structure of all the tributaries ((0 0 , 0 1 ), (1 0 , 1 1 ), ... (47 0 , 47 1 )).
- 6A method for feeding time division multiplex switching matrices of a network element through a number of backpanel connections, the method comprising the steps of receiving input flows (L0 to L15), wherein each of said input flows (L0 to L15) is in the form of bits arranged in frames, wherein each frame comprises tributaries, storing a predetermined number of bytes for each tributary;slicing the stored predetermined number of bytes for each tributary, thus forming a number of word structures and forming backpanel frames with said word structures, characterized in that the step of slicing comprises forming word structures in a number which is equal to the number of said switching matrices and in that the capacity of the input flow is equal to the capacity of the overall backpanel connection capacity, and in that each backpanel frame (A0) comprises, for a number of input flows (L0, L1, L2, L3) equal to the number of switching matrices (A to D), a corresponding word structure of all the tributaries ((0 0 , 0 1 ), (1 0 , 1 1 ), ... (47 0 , 47 1 )).
Independent claims3
50 paragraphs, as filed
0001The present invention relates to telecommunication network elements, typically ADMs (Add/Drop Multiplexers) or DXC (Digital Cross-connects). In particular, the present invention relates to a port device for connecting input flows to a switching matrix (also known as switching fabric) and a method for providing a plurality of input flows to a switching matrix in a network element. Furthermore, the present invention relates to a backpanel frame for transmitting input flows to a switching matrix.
0002As it is known, an ADM is a network element that provides access to all, or some subsets, of the constituent signals contained within an STM-N. The constituent signals are added to or dropped from the STM-N signal as it passes through the ADM.
0003Digital cross-connect systems are commonly employed to controllably rearrange and redirect the contents of signals being communicated in digital transmission systems. However, with ever increasing demands for larger transmission capacity, there is a need for increasingly larger capacity non-blocking switch units used in the cross-connect switching fabric. In particular, there is the need to provide a fabric switch whose capacity can be easily varied.
0004In network elements, input flows are received at ports and sent to a switching matrix through backpanel connections. After a cross-connection is carried out at such a switching matrix, the properly cross-connected data are sent to output ports.
0005Several different arrangements are known for providing a switching matrix with data from a port. Unfortunately, prior art solutions are focused on specific applications, for instance for transporting only SONET or SDH or OTN payload. Furthermore, the known arrangements are typically derived from standard frame formats and thus they are not optimized for efficient, flexible, agnostic and scalable architectures.
0006The Applicant has felt the need to provide an agnostic arrangement having the capability to cross-connect both High Order SONET/SDH tributaries and ODUx (Optical Data Unit) tributaries.
0007The Applicant has also felt the need to provide an arrangement allowing a scalable "word slice" approach maximizing the matrix capacity and minimizing complexity and power dissipation of the switching matrix.
0008In addition, the Applicant has felt the need to provide a link protection between port and switching matrix.
0009<patcit id="pcit0001" dnum="WO02052788A"><text>WO 02/052788</text></patcit> discloses a method and apparatus for transferring information in a communication system.
0010<patcit id="pcit0002" dnum="WO0215489A"><text>WO 02/15489</text></patcit> discloses high performance switches and routers with parallel switching domains having sub-unity speedup.
0011According to a first aspect, the present invention provides a network element comprising an input port and time division multiplex switching matrices, said input port being connected to said switching matrices through a number of backpanel connections, wherein the input port receives a number of input flows, wherein each of said input flows is in the form of bits arranged in frames, wherein each frame comprises tributaries, wherein the input port comprises: a memory for storing a predetermined number of bytes for each tributary; a slicer for slicing the stored predetermined number of bytes for each tributary, thus forming a number of word structures; and a backpanel framer for forming backpanel frames with said word structures, characterized in that the number of said word structures, for each tributary is equal to the number of said switching matrices, in that the capacity of the input flow is equal to the capacity of the overall backpanel connection capacity, and in that each backpanel frame comprises, for a number of input flows equal to the number of switching matrices, a corresponding word structure of all the tributaries.
0012Preferably, each of said backpanel frames comprises an overhead section and a payload section, the overhead section including a plurality of words and redundant data, the payload section including a plurality of words with redundant data.
0013Preferably, said redundant data provide a forward error correction protection feature.
0014Preferably, said predetermined number of bytes for each tributary is eight, said eight stored bytes being arranged into four 2-bytes structures of four words each that are provided to four switching matrices through said backpanel connections.
0015The network element according to any of preceding claims, wherein the port is ASIC implemented.
0016According to a second aspect, the present invention provides a method for feeding time division multiplex switching matrices of a network element through a number of backpanel connections, the method comprising the steps of: <ul id="ul0001" list-style="none" compact="compact"><li>receiving input flows, wherein each of said input flows is in the form of bits arranged in frames, wherein each frame comprises tributaries, storing a predetermined number of bytes for each tributary; slicing the stored predetermined number of bytes for each tributary, thus forming a number of word structures and forming backpanel frames with said word structures, characterized in that the step of slicing comprises forming word structures in a number which is equal to the number of said switching matrices and in that the capacity of the input flow is equal to the capacity of the overall backpanel connection capacity, and in that each backpanel frame comprises, for a number of input flows equal to the number of switching matrices, a corresponding word structure of all the tributaries.</li></ul>
0017The step of forming backpanel frames may comprise the steps of providing an overhead section and a payload section, the overhead section including a plurality of words and redundant data, the payload section including a plurality of words with redundant data.
0018The redundant data preferably provide a forward error correction protection feature.
0019Preferably, eight bytes of one tributary are stored in the port memory, said eight bytes being arranged into four 2-bytes structures of four words each that are provided to four switching matrices through said backpanel connections.
0020The present invention will become clear after reading the following detailed description, to be read with reference to the attached drawings, wherein: <ul id="ul0002" list-style="dash" compact="compact"><li><figref idref="f0001">Figure 1</figref> shows a single square switching matrix cross-connecting M flows, with each flow comprising T time slots;</li><li><figref idref="f0002">Figure 2</figref> shows an arrangement of four square switching matrices cross-connecting 4xM flows, with each flow comprising T time slots;</li><li><figref idref="f0003">Figure 3</figref> shows a first embodiment of backpanel frame according to the present invention;</li><li><figref idref="f0003">Figure 4</figref> shows a second embodiment of backpanel frame according to the present invention;</li><li><figref idref="f0004">Figure 5</figref> shows a third embodiment of backpanel frame according to the present invention; and</li><li><figref idref="f0005">Figure 6</figref> diagrammatically shows an input port according to one embodiment of the present invention.</li></ul>
0021With reference first to <figref idref="f0001">Figure 1</figref>, an elementary square TDM matrix is shown and designed as SWITCH. The matrix of <figref idref="f0001">Figure 1</figref> comprises M input links, each link carrying T time slots. The cross connection capability is N x N, where N = M x T. Let's call C the capacity of each time slot in Mbit/s: the overall capacity of the elementary matrix of <figref idref="f0001">Figure 1</figref> is then N x C.
0022By mapping a tributary in one or more time slots, it is possible to use the matrix of <figref idref="f0001">Figure 1</figref> for different tributary bit rates. The number Nt of time slots required for each tributary is N<sub>t</sub> = ┌f<sub>T</sub>/C┐, where f<sub>T</sub> is the tributary bit rate.
0023The Applicant has followed this novel approach for providing a higher capacity matrix arrangement. The basic idea consists in using multiple elementary TDM matrices in parallel. With k matrices in parallel the cross connection capability still is N x N but the capacity of the single equivalent time slot (made of k elementary time slots in parallel) is C<sub>k</sub>=C x k. Each time slot is distributed through the k elementary matrices, and the tributaries are switched by the k matrices working in parallel. As an example, <figref idref="f0002">Figure 2</figref> shows four switching matrices (k=4), designed A, B, C and D, respectively.
0024To exploit the flexibility of this kind of novel approach, a particular backpanel frame structure has been defined for the link between ports and matrices. In particular the port according to the present invention is connected to all the elementary matrices used in a specific configuration, through a link simply composed by an ordered structure of time slots handled by the matrix, plus some overhead for link management and communication between port and matrix. A first embodiment of backpanel frame according to the present invention is shown in <figref idref="f0003">Figure 3</figref>.
0025The frame according to <figref idref="f0003">Figure 3</figref> is an 8 KHz frame with an overall frequency of 2,48832 Gbit/sec (equivalent to an STM-16 or OC-48 bit rate) transporting a synchronous transmission payload, typically SDH or SONET (AU4 or AU3). The backpanel frame of <figref idref="f0003">Figure 3</figref> comprises a first portion with a frame alignment word (FAW), an overhead and a number of payload packets. In the embodiment of <figref idref="f0003">Figure 3</figref>, each word comprises 16 bits, namely two bytes. The frame alignment word comprises 48 words, the overhead comprises 192 words and each payload packet comprises 768 words (equivalent to 768 time slots); there are 25 of such packets.
0026As the capacity of each time slot (each word in a packet) is C=8000x25x16 bit/s = 3.2 Mb/s, it is possible to accommodate one AU3 (f<sub>AU3</sub>=50.304 Mb/s) in 16 time slots, as C<sub>16</sub>=16x3.2 Mb/s = 51.2 Mb/s. In this case, it is possible to built an AU3 switch with up to 16 matrices working in parallel, each one handling one of the 16 time slots; the resulting system is able to switch up to Mx768 AU3. Similarly, it is possible to build a system with (1) 2, 4, 8 matrices working in parallel, each one respectively handling (16) 8, 4, 2 time slots of a single AU3. The resulting systems will be able to switch respectively up to (Mx48) Mx96, Mx192, Mx384 AU3.
0027An AU4 is simply transported using three times the slots necessary for an AU3. The same applies for higher bit-rates tributaries. It is convenient to synchronize the SDH/SONET tributaries to the backpanel frame: this can be achieved with pointer processing, putting an SDH/SONET Section adaptation function on the port; moreover, as C<sub>16</sub>>f<sub>AU3</sub>, some bits in the time slots will contain fixed stuffing.
0028The frame according to <figref idref="f0003">Figure 4</figref> is a 2,7648 Gbit/sec frame (8 KHz periodicity) transporting a synchronous transmission payload, typically SDH or SONET. The backpanel frame of <figref idref="f0003">Figure 4</figref> comprises a first portion with a frame alignment word (FAW), a stuffing portion, an overhead and a number of payload packets. In the embodiment of <figref idref="f0003">Figure 4</figref>, each word comprises 16 bits, namely two bytes. The frame alignment word comprises 48 words, the overhead comprises 204 words and each payload packet comprises 816 words. Between FAW and overhead, some stuffing is provided. In the shown embodiment, the stuffing comprises 132 words.
0029As it is clear from <figref idref="f0003">Figure 4</figref>, both the overhead and payload sections comprise a plurality of words and each word has redundant data providing forward error correction features. In this way, the link between Port and Matrix becomes protected in order to enable the use of a big number of High Speed links with very dense boards layout. The FEC algorithm and frame structure could be designed in order to provide an adequate coding gain and minimize the complexity of FEC encoder and decoder. The 13<sup>rd</sup> payload packet is empty (i.e. contains stuffing data) when the frame is carrying SDH/SONET payload: in this case the capacity of each time slot is still C=8000x25x16 bit/s = 3.2 Mb/s. As a consequence, the mapping of AU4 and AU3 in this case is identical to the one defined for the 2,48832 Gbit/sec frame.
0030The frame according to <figref idref="f0004">Figure 5</figref> is a 2,7648 Gbit/sec frame (8 KHz periodicity) transporting ODU tributaries (OTN payload).
0031The backpanel frame of <figref idref="f0004">Figure 5</figref> comprises a first portion with a frame alignment word (FAW), a stuffing portion, an overhead and a number of payload packets. In the embodiment of <figref idref="f0004">Figure 5</figref>, each word comprises 16 bits, namely two bytes. The frame alignment word comprises 48 words, the overhead comprises 204 words and each payload packet comprises 816 words. Between FAW and overhead, some stuffing is provided. In the shown embodiment, the stuffing comprises 132 words.
0032As it is clear from <figref idref="f0004">Figure 5</figref>, both the overhead and payload sections comprise a plurality of words and each word has redundant data providing forward error correction features. In this way, the link between Port and Matrix becomes protected in order to enable the use of a big number of High Speed links with very dense boards layout. The FEC algorithm and frame structure could be designed in order to provide an adequate coding gain and minimize the complexity of FEC encoder and decoder.
0033In this case all the payload packets can be filled with payload: the capacity of each time slot is increased up to C=8000x26x16 bit/s = 3.328 Mb/ s. This allows for a mapping of one ODU1 in 16x48=768 time slots, a mapping of one ODU2 in 16x192=3072 time slots, and a mapping of an ODU3 in 16x768=12288 time slots. As the ODUx tributary cannot be synchronized to the 8KHz backpanel frame, a convenient plesiochronous mapping method must be defined for this case, e.g. using a proprietary positive stuffing mapping.
0034An alternative to <figref idref="f0004">Figure 5</figref> backpanel frame could be to define a frame with a time slot capacity of C=8000x25x16 bit/s = 3.2 Mb/s (the same as for the frame in <figref idref="f0003">Figure 3</figref>), but inserting in the frame a higher number of timeslots, for instance 800. In this case the mapping of one ODU1 can be achieved using 16x50=800 time slots, the mapping of one ODU2 using 16x200=3200 time slots, and the mapping of an ODU3 using 16x800=12800 time slots. As the ODUx tributary cannot be synchronized to the 8KHz backpanel frame, a convenient plesiochronous mapping method must be defined for this case, e.g. using a proprietary positive stuffing mapping.The port according to the present invention, according to the tributary capacity and the number of parallel elementary matrices, manages the mapping of one tributary in the time slots inside each link. The elementary matrix itself has not to know the payload content of the frames received as input flows and it is thus agnostic.
0035In <figref idref="f0005">Figure 6</figref> the operation of a port (PORT) according to one embodiment of the present invention is shown. In particular, the slicing step is shown for the case of a 16xSTM 16/ OC48 receiving port. The port receives sixteen input flows (L0, L1, L2, ..., L15) with STM16/OC48 frame format. For each AU-3 tributary, eight bytes are collected and stored in a memory. The number of AU-3 tributaries inside an STM 16 is 48 (0 ...47); t=0 stands for the first arrived byte of a tributary and, analogously, t+1 stands for the second arrived byte, and so on up to the last arrived byte (t+7). It is supposed that the port of <figref idref="f0005">Figure 6</figref> is connected to four switching matrices (A, B, C, D, not shown), through four backpanel connections for each matrix, numbered 0 to 3.
0036As it is shown in <figref idref="f0005">Figure 6</figref>, the eight bytes of each tributary received at each input link are sliced so that four equal structures are fed to the four switching matrices. For instance, the tributaries of the first input link L0 are sliced and arranged in four different frames. The first frame (A0, sent to matrix A) comprises L0[0<sup>0</sup>,0<sup>1</sup>)(1<sup>0</sup>,1<sup>1</sup>)...(47<sup>0</sup>,47<sup>1</sup>)], wherein: <ul id="ul0003" list-style="none" compact="compact"><li>0<sup>0</sup> : first received byte of AU3 number 0;</li><li>0<sup>1</sup> : second received byte of AU3number 0;</li><li>1<sup>0</sup> : first received byte of AU3 number 1;</li><li>1<sup>1</sup> : second received byte of AU3 number 1;</li><li>47<sup>0</sup> first received byte of AU3 number 47;</li><li>47<sup>1</sup>: second received byte of AU3 number 47; and, more in general,</li><li>j<sup>i</sup> : (i+1)-th received byte of j-th AU3</li></ul>
0037The second frame (B0, sent to matrix B) comprises L0[0<sup>2</sup>,0<sup>3</sup>)(1<sup>2</sup>,1<sup>3</sup>)... (47<sup>2</sup>,47<sup>3</sup>)], wherein: <ul id="ul0004" list-style="none" compact="compact"><li>0<sup>2</sup> : third received byte of AU3 number 0;</li><li>0<sup>3</sup> : fourth received byte of AU3 number 0; and so on.</li></ul>
0038The third frame (C0, sent to matrix C) comprises L0[0<sup>4</sup>,0<sup>5</sup>)(1<sup>4</sup>,1<sup>5</sup>)...(47<sup>4</sup>,47<sup>5</sup>)], wherein: <ul id="ul0005" list-style="none" compact="compact"><li>0<sup>4</sup> : fifth received byte of AU3 number 0;</li><li>0<sup>5</sup> : sixth received byte of AU3 number 0; and so on.</li></ul>
0039And, finally, the fourth frame (D0, sent to matrix D) comprises L0[0<sup>6</sup>,0<sup>7</sup>)(1<sup>6</sup>,1<sup>7</sup>)... (47<sup>6</sup>,47<sup>7</sup>)], wherein: <ul id="ul0006" list-style="none" compact="compact"><li>0<sup>6</sup> : seventh received byte of AU3 number 0;</li><li>0<sup>7</sup> : eighth received byte of AU3 number 0; and so on.</li></ul>
0040The same criteria is adopted for the other fifteen input links L1 to L15).
0041It is possible to avoid storing eight bytes for each tributary before starting the transmission of payload towards the four matrices: as soon as two bytes are stored, they are transmitted towards one of the four matrices, in round robin fashion; this results in having the four links towards the four matrices which are slightly delayed from matrix number 1 (the first served) to matrix number four (the last served). The matrices operate with this relative delay, and the delay is absorbed in the de-slice process (the one which reconstructs the original AU3 after the cross-connection).
0042It will be realized that the present invention fundamentally consists in organizing received data in a proper frame format (comprising payload and overhead) coming from the line framer to the Matrix switches. At least the following objectives are reached by the present invention:
0043It is obtained an agnostic architecture having the capability to cross-connect both High Order SONET/ SDH tributaries and ODUx tributaries (and possibly any payload that can be accommodated in a number of time slots).
0044It is allowed a scalable "word slice" approach maximizing Matrix capacity and minimizing complexity and power dissipation for Matrix switch.
0045Finally, the link between Port and Matrix becomes protected by a FEC in order to enable the use of a large number of High Speed links with very dense boards layout. The FEC algorithm and frame structure are studied in order to provide an adequate coding gain and minimize the complexity of FEC encoder and decoder.
0046The solution according to the present invention is extremely flexible. In fact, the matrix is payload agnostic, and it simply switches time slots. Furthermore, it is very easy adding specific ports to the system in order to obtain an equipment able to cross-connect at the same time every type of TDM traffic (e.g. SDH, SONET, OTH...).
0047Moreover the system is easily scalable thanks to the word-slice approach.
0048The backpanel links provide built-in communication channels between ports and matrix (useful for system maintenance and traffic overhead handling).
0049Profitably, the port and the matrix are ASIC implemented.
0050Whilst only input ports have been described, it is clear that output ports will operate fundamentally in a mirrored manner.
5 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| WO0215489A | Cites | World Intellectual Property Organization (WIPO) |
| WO02052788A | Cites | World Intellectual Property Organization (WIPO) |
| GB2364470A | Cites | United Kingdom |
| US6693904B1 | Cites | United States of America |
10 members in 5 offices
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 04290904 | European Patent Office (EPO) | A | |
| EP20040290904 | – | – | – |
Members10
| Document | Office | Kind | |
|---|---|---|---|
| CN1681356A | China | A | |
| EP1585358A1 | European Patent Office (EPO) | A1 | |
| US2005232310A1 | United States of America | A1 | |
| EP1585358B1This record | European Patent Office (EPO) | B1 | |
| AT387828T | Austria | T | |
| ATE387828T1 | Austria | T1 | |
| DE602004012066D1 | Germany | D1 | |
| DE602004012066T2 | Germany | T2 | |
| US7602776B2 | United States of America | B2 | |
| CN1681356B | China | B |
62 legal events, as 6 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Change of addressCA | CA | FR | |
| Change of addressCA | CA | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Lien (pledge) constitutedGC | GC | FR | |
| Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)REGISTERED BETWEEN 20130926 AND 20131002732E | 732E | GB | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fr: translation filedET | ET | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents actLapsedNLV1 | NLV1 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Corresponds to:REF | REF | EP | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Designation fees paidAKX | AKX | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1585358
- Publication, DOCDB
- 1585358
- Publication, EPODOC
- EP1585358
- Application
- 4290904
- Application, DOCDB
- 04290904
- Application, EPODOC
- EP20040290904
Titles3
- German
- Zeitmultiplexstreckenverbindungen zwischen einer Koppelmatrix und einem Port in einem Netzelement
- English
- Time division multiplexed link connections between a switching matrix and a port in a network element
- French
- Connexions à multiplexage temporel entre une matrice de commutation et un port dans un élément de réseau
Classification
- CPC, 13
- H04Q11/04
- H04J3/1611
- H04Q2213/13003
- H04Q2213/1302
- H04Q2213/1304
- H04Q2213/13076
- H04Q2213/13103
- H04Q2213/13166
- H04Q2213/13167
- H04Q2213/13174
- H04Q2213/13292
- H04Q2213/13322
- H04Q2213/13367
- IPC, 7
- H04Q11 04
- H04L12 56
- H04J3 16
- H05K7 14
- H04J3 02
- H04L12 28
- H04Q11 00
Designated states1
- Contracting states, 1
- Türkiye
