EP0348328A3
Method of selecting least weight routes in a communications network
Abstract
A least weight route computation algorithm for use in computing routes through a data communications network is improved by recording the number of equally weighted paths to a particular node through different predecessor nodes. If a route must be selected to the particular node, the relative numbers of equally weighted routes through different predecessor nodes determines the probability with which a route will be selected through the particular predecessor node.
Term
Term ended
Projected expiry passed 23 May 2009, 17.3 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
1 sheet
Sheet 1
Every citation, both ways
| Reference | Relation | Cited during |
|---|---|---|
| MILICOM'87, CONFERENCE RECORD, Washington, DC, 19th - 22nd October 1987, vol. 2, pages 578-584, IEEE, New York, US; J.B. CAIN et al.: "A "near-optimum" multiple path routing algorithm for space-based SDI networks" | Non-patent | Search report |
| IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, vol. SE-13, no. 3, March 1987, pages 398-405, IEEE, New York, US; Y.K. DALAL et al.: "A distributed algorithm for constructing minimal spanning trees" | Non-patent | Search report |
8 members in 4 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 210471 | United States of America | – | |
| 21047188 | United States of America | A | |
| 21047188 | United States of America | A | |
| US19880210471 | – | – | – |
Members8
| Document | Office | Kind | |
|---|---|---|---|
| EP0348328A2 | European Patent Office (EPO) | A2 | |
| JPH0241054A | Japan | A | |
| US4967345A | United States of America | A | |
| EP0348328A3This record | European Patent Office (EPO) | A3 | |
| JPH0693681B2 | Japan | B2 | |
| EP0348328B1 | European Patent Office (EPO) | B1 | |
| DE68920490D1 | Germany | D1 | |
| DE68920490T2 | Germany | T2 |
21 legal events, as 2 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Notification of lapseLapsedST | ST | FR | |
| 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 | |
| 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 | |
| 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 | |
| No opposition filedOpposition26N | 26N | 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 | |
| Fr: translation filedET | ET | EP | |
| Corresponds to:REF | REF | EP | |
| Designated contracting statesAK | AK | EP | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Designated contracting statesAK | AK | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | 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
- 0348328
- Publication, DOCDB
- 0348328
- Publication, EPODOC
- EP0348328
- Application
- 480078
- Application, DOCDB
- 89480078
- Application, EPODOC
- EP19890480078
Titles3
- German
- Verfahren zur Auswahl des geringstwertigen Weges in einem Kommunikationsnetz
- English
- Method of selecting least weight routes in a communications network
- French
- Méthode de sélection du chemin de moindre poids dans un réseau de communications
Classification
- CPC, 3
- H04L45/24
- H04L45/00
- H04L45/22
- IPC, 1
- H04L12 56
Designated states1
- Contracting states, 1
- United Kingdom