Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Patent
1996-03-06
1998-08-11
Kizou, Hassan
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
370401, H04L 1228
Patent
active
057937656
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
The invention relates to a method for determining, in a transport network, a link between a source and a destination, and to networks which are designed for implementing such a method.
The term "network" will here in particular be taken to refer to a transport network for transporting goods and/or information. A (transport) network may in this context, for example, be a telephone network, consisting of an infrastructure having links, nodes and exchanges, but also a goods transport network, consisting of a number of transport links (such as rail links) and transshipment stations. Below, some terms will be expounded with reference to examples from communications technology.
In networks for the transport of information (communication networks), links may in principle be set up in two ways: from a central point which has an overview of the entire network (central or centralized network control), or from points situated on the transport link (distributed network control). In the case of a central control (central control system), in principle all sublinks from source to destination can be determined and created from the central control. Since there is available, to the central control, information concerning the entire network, an efficient link can be selected.
In the case of a distributed control (distributed control system), control and thus the information required therefor is distributed over the network. Since in this case certain information, such as topological information, must be present simultaneously at different points, this involves duplication of information. In each case, a local control unit selects a sublink on the basis of the information available to it. The entire link is built up, step by step, from sublinks which are selected in each case between a switching point and a next switching point. In this context, the control units can be relatively simple. Owing to the control units lacking information relating to the entire network, in general less efficient links, however, may be chosen in the case of a distributed control.
Although more efficient links are possible with a central control, determining links in relatively large centrally controlled networks in practice proves to require a complicated and therefore expensive control. Another important drawback of the prior art is the fact that, in networks with different types of controls (centralized control and distributed control) different types of control information are required for determining links, which complicates the coupling of networks with different types of controls. Some examples of Prior Art techniques are disclosed in the following references: switched systems, as well as a fast packet switching communications system. The network has a distributed control structure. The processing units which evaluate a global cost function control only part of the links involved. This reference does not deal with networks having a centralized control. algorithm for multi-domain networks, each network consisting of several individually controlled domains. A so-called Integrated Network Control Center manages overall network performance based on a limited amount of information about the entire network. The disclosed algorithm is only applicable to networks having the above-mentioned type of control. networks. In the algorithm, a large-scale network is decomposed into several smaller networks, which in turn are organized into several levels containing independent subnetworks. This so-called textured algorithm is not suitable for networks having a centralized control.
SUMMARY OF THE INVENTION
The object of the invention is to avoid the abovementioned and other drawbacks of the prior art and to provide a method for determining links in a network, which: simple control can be used, control and networks having a distributed control, and
A further object of the invention is to provide a network in which the method according to the invention is embodied and which therefore offers the abovementioned advantages. Such a
REFERENCES:
patent: 5491690 (1996-02-01), Alfonsi et al.
patent: 5495479 (1996-02-01), Galaand et al.
patent: 5598532 (1997-01-01), Liron
patent: 5652751 (1997-07-01), Sharony
D.D. Dimitrijevic et al., "Routing In Multi-Domain Networks ", Proceeding of IEEE, Apr. 1991, vol. 1, pp. 257-264.
G.M. Huang et al., "A Parallel Textured Algorithm for Optimal Routing In Data Networks", Proceeding of IEEE Globecon, Dec. 1991, vol. 3, pp. 1701-1705.
Draft Recommendation G.803, "Architectures of transport networks based on the synchronous digital hierarchy (SDH)", CCITT Study Group XVIII/7, Geneva, 9-19 Jun. 1991, pp. 1-65.
Definition of the MTN Network Level View, CCITT SGXV Experts, Apr. 25, 1993, pp. 1-27.
Boer Cornelis
De Kruif Johannes Cornelis
Hom Shick
Kizou Hassan
Koninklijke PTT Nederland N.V.
Michaelson Peter L.
Pokotylo John C.
LandOfFree
Method for selecting links in networks does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for selecting links in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for selecting links in networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-397130