Method of applying service instance to mpls network (versions) and mpls network
FIELD: radio engineering, communication.
SUBSTANCE: domain-wide unique node identifiers and unique service identifiers are distributed within a MPLS domain using a routing system LSA. Nodes on the MPLS network compute shortest path trees for each destination and install unicast forwarding state based on the calculated trees. Nodes also install multicast connectivity between nodes advertising common interest in a common service instance identifier. Instead of distributing labels to be used in connection with unicast and multicast connectivity, the nodes deterministically calculate the labels. Any number of label contexts may be calculated. The labels may either be domain-wide unique per unicast path or may be locally unique and deterministically calculated to provide forwarding context for the associated path. Multicast and unicast paths may be congruent, although this is not a requirement.
EFFECT: improved communication.
16 cl, 7 dwg
CROSS-REFERENCE TO RELATED APPLICATIONS
This application has a priority of provisional patent application U.S. No. 61/114,558, filed on November 14, 2008, and the application for a utility model No. 12/412,589, registered in the U.S. on March 27, 2009, each of which is incorporated herein by reference.
The technical FIELD
The present invention relates to communication networks, and more particularly to a method and apparatus that can apply a service instance to MPLS networks.
BACKGROUND of INVENTION
The network data may include various switches, routers, hubs, and other devices configured to transmit and receive data over the network. These devices will hereinafter be referred to here as "network elements". The network element, in the main, is not a consumer of data, but rather, is used to transmit and receive data over the network. Data is transmitted via the network by sending elements of network Protocol data units in the form of frames, packets, cells or segments, each other via communication channels. The particular Protocol data unit may be handled by multiple network elements and passing through many communication channels as it moves between source and destination in the network.
Various network elements in a communication network communicate with each other according to predefined rules, swetnam as protocols. Different protocols are used to control various aspects of communication, such as a method of generating signals for transmission between network elements, different definitions of what should be similar Protocol data blocks, as Protocol data units to be processed or sent through a network of network elements, and how to share information, for example data on the route between network elements.
In the architecture of Ethernet devices connected to the network, compete for the opportunity of sharing telecommunication channels at any time. Where there are multiple bridges or nodes to interconnect network segments, there are often different potential paths to the same destination. The advantage of this architecture is that it provides redundant paths between bridges and allows you to increase the performance of the network in the form of additional channels. To prevent the formation of loops, mostly spanning tree is used to limit the method by which traffic is transmitted in the network. Since the routes are studied by broadcast frames and waiting for a response, and because the request and response will follow the spanning tree, most of the traffic will pass through the channels that were what actu spanning tree. This often led to use channels that were on the spanning tree and inadequate use of channels that were not part of the spanning tree.
To overcome some of the limitations inherent in Ethernet networks, the network of Education of the bridge in the application No.11/537,775, registered on 2 October 2006 was proposed bridge backbone network provider (plsb are) (one example is the Protocol identifying routes on the state of communication in the Ethernet network, called the content of which is incorporated herein by reference. Plsb are additionally described in U.S. patent application No.11/702,263, registered on 5 February 2007 with the title "basic network multicast Protocol identifying routes on the state of communication in the Ethernet network, the content of which is incorporated herein by reference.
Plsb are using a Protocol identifying routes on the state of the communication channel, such as intermediate system - intermediate system (ISTS) to allow network elements to exchange routing information on the status of the link. The nodes use the routing information about the link state to compute the shortest path through the network. Because you are using the shortest path routing shortest path tree can be computed from each of the source host, to avoid the use of the Protocol is as spanning tree with the to increase the link utilization in the network.
An MPLS network can be based on Ethernet or other communication networks. In an MPLS network communications Protocol signals is used to set the path-switched labels through the network so that traffic could be sent over the network in any desirable way. In the process, the input node (edge router label or LER for brevity) receives a packet and determines which path the packet should take through the network. LER will apply an external label to the package and sends it to the communication path with the label (LSP). Routers switch the labels on the LSR will accept the package, remove the outer label, the external label to determine the next hop for the packet, apply new external label to the packet and forwards the packet to the next transit station. Thus, the outer tag is replaced at each hop, when a packet passes through the network until the packet reaches its destination.
MPLS sets up a unicast connection, setting path switched labels between pairs of nodes in an MPLS network. The installation paths are switched labels requires that the marks were distributed to each node on the communication path, so that the nodes can agree on what label will be used to allow the package to follow the given path is via the network. The Protocol that is typically used to set the path-switched labels over an MPLS network, usually referred to as allocation Protocol label (LDP), although we have also developed other protocols of exchange of signals. Using the mechanism of the exchange of signals, the labels are placed along the paths switched labels so that the routers switch labels can be considered as a label, to determine the output for the packet based on the label and apply a new label to forward the packet along the path through the network. Protocol of exchange of signals is used to set the label and other relevant state forward traffic along the way. Path-switched labels define unicast communication in an MPLS network, which is mainly set in advance without making a selection.
MPLS also has several different types of labels that are commonly used when transferring data. Basically, the outer tag is used to define the transfer context for a specific package. This label is often replaced by a sequential routing as you move the service in the network. Once the packet reaches the area where the transfer context is implicit, this exterior label can be removed from the package, which is usually called preganacy transit area. Context passing is usually considered to be implicit, at least one transit the second section from the end of the destination of the packet, and, therefore, the term preganacy was used to denote this process. However, the outer label may be removed at any point along the network path where the route becomes implicit. External marks characteristic of the node, which means that they belong to a particular node in the network. External labels are not globally unique values, but rather can be used in different parts of the network.
MPLS allows multiple labels to be formed in the package. As mentioned above, often the outer tag is used to define multicast context for the package. Internal label (pseudowire label) is often used to allow nodes to demultiplex the packet to the exit path switched labels. To do this, the destination node sets pseudowire label of each instance of the service handled this destination node. The destination node then also gives other nodes command to apply a network pseudowire label to the packets when they enter the network, so that the output node can use the internal pseudowire MPLS label to determine how to transmit the packet. Thus, output node assigns a pseudo-wire label their service instance and coordinates with the input nodes to apply these pseudo-wire label to the traffic entering the network. As EXT is their label, internal pseudowire labels are not unique to the network, but rather, unique only for a particular output node. The use of internal labels allows you to multiplex many different data streams for transmission over this announcement LSP in an MPLS network.
When working LER uses as internal pseudowire label and the outer label for a packet at the input of an MPLS network. The outer label is used to forward the packet through the network, and the inner label may be used by the destination node for a packet from the MPLS network. This allows the input LER to execute a single search, allows you to use a switching label to forward the packet through the MPLS network and allows the destination node to transmit from an MPLS network, for example, in the client network.
After it was installed unicast communication through the establishment of a complete set of LSPs through the network, multicast communication can be created in the upper part of an MPLS network. Unfortunately, the creation of multicast communication requires the use of different protocols of exchange of signals, which makes the multicast transmission is slower and more error-prone. For example, the nodes use the Protocol type of group management Protocol Internet (IGMP) to enter and leave group multicast, what causes add and remove the nodes of the multicast tree. When nodes enter and leave the group multicast, multicast communication based on the MPLS nodes. Destination hosts who would like to subscribe to multicast-send a notification of the connection, and intermediate nodes use the notification of the connection to determine whether to set the state for the multicast. The creation of multicast trees using one of these methods is time consuming and requires substantial computation. Accordingly, it would be advantageous to provide a new method of implementing multicast in an MPLS network.
BRIEF description of the INVENTION
Unique identifier of the node in the domain-wide unique IDs services are distributed in an MPLS domain, using the routing system LSA. Nodes in an MPLS network calculates the shortest path tree for each of the nodes and set the state to unicast for each node based on the unique ID of the node in the scale domain. Nodes also establish a multicast connection between nodes, in announcing the General interest in the service ID. Instead of distributing labels used for unicast and multicast links, nodes create labels by deterministic calculations. Labels can either be unique across the domain for unicast or multicast p is t, or may be locally unique and deterministic calculation to provide the context for the respective paths. You can use any number of labels, although in one example embodiment uses at least two labels - one for service and one in the source for the multicast transmission, and one for service and one for the destination for the multicast transmission. In the framework of deterministic calculations can be used a large number of labels.
When the packet received by the MPLS network, the edge router label will determine the destination of the packet in an MPLS network and attaches the label to the package. Where the label is unique in the scale domain, the nodes in an MPLS network will transmit the packet to the destination, without swapping label at each hop in the network. Where the label is not unique in the scale domain, the nodes can perform label swapping for a packet network. Path multicast unicast can be congruent, although this is not required.
BRIEF DESCRIPTION of DRAWINGS
The purpose of the present invention, in particular, indicated in the attached claims. The present invention disclosed in the examples of its implementation and illustrated by the drawings in which the same numeric position indicate similar elements. The attached drawings reveal the discrepancies between the examples of embodiment of the present invention only for the purpose of illustration and are not intended to limit the scope of the invention. For clarity, not all elements in the drawings have a digital position.
Figure 1 - functional block diagram of an example communication network MPLS, illustrating the unique identification of the node in the scale domain for example, node L MPLS network;
Figure 2 - functional block diagram of an example communication network MPLS figure 1, illustrating the example of the unicast connection is established to one of the nodes MPLS to allow all nodes in an MPLS network to send unicast traffic to this node of an MPLS network;
Figure 3 - functional block diagram of an example communication network MPLS figure 1, illustrating the example of a shared service instance for multiple nodes MPLS;
Figure 4 - functional block diagram of an example communication network MPLS figure 1, illustrating an example of a multicast communication established between nodes of an MPLS network and an interest in General service instance;
Figure 5 - block diagram of a process that can be used for establishing a unicast communication in an MPLS network, such as an exemplary MPLS network shown in figures 1-4;
Figure 6 - block diagram of a process that can be used to establish a multicast connection in an MPLS network, such as an exemplary MPLS network shown in figures 1-4;
Figure 7 is a functional block diagram of an exemplary node MPLS, which can be used to implement example embodiments of the invention.
In the figure until 1 is an example communication network MPLS, which will be used for explanation of an example embodiment of the invention. In the example embodiment shown in figure 1, the communication network 10 MPLS has many nodes 12 that are connected by channels 14. MPLS network typically perform a routing Protocol based on the status of the channels, such as the routing Protocol to select the shortest route (OSPF) or intermediate system to intermediate system (is-is). The routing system allows the nodes to send ads routing to notify other nodes about the status of the channels with which they are connected. These ads routing will be called here the ads on the status of the channels (LSA), which describe the local state of a router or network, including the status of the interfaces and the adjacent routers. Basically, the LSA identifies not only the site but also its neighboring nodes. The node responds to the advertisement LSA and uses the information contained in the LSA to create a common view of the topology of the MPLS network, which is stored in the database of the communication channel status (LSDB). The nodes can then use the database status of the communication channel to compute routes through the MPLS network as required.
In one example embodiment, the nodes use the LSA, to transmit the unique identifier of the node in the scale domain, referred to here as the "node ID" or "TD site. The node ID is Nikulin and determined within the domain. The node ID is used to identify the source and destination. In one example embodiment the node ID is the label of the MPLS, which can be used by any other node in the network to send unicast traffic to the node associated with this node ID. For unicast traffic, the label identifies the destination network and may, for example, to identify the destination node. In contrast, for multicast, the label is determined by the node source and uniquely identifies an instance of a service in MPLS networks MPLS. Can be used any number of labels, although in one example embodiment uses at least two context labels - one for service and one for the destination multicasting. You can use a larger number of labels, as they are calculated in a deterministic way.
The nodes in the network distribute unique examples of the service instance that is used to calculate and set the state of the transmission. The status of the unicast based on the example of a service instance, which ends at the destination node, while the state of the multicast transmission based on the example of a service instance, which occurs in the node source. The status of the unicast transmission is set to the unicast service instance from each node to name the military destination node along the shortest path trees to the destination node. The state of the multicast is set from the source host to any other host, spreading a common interest in the service instance. Based on the unique values of the service instance in the scale domain, unicast and multicast communication can be established nodes in the same way. In addition, because the interest in the service instance can be extended using the routing system, to establish a unicast or multicast over the communications network MPLS does not require a separate Protocol signals. The transfer status can also be computed by a deterministic to avoid using label distribution protocols. Thus, multicast, and unicast connection for communication can be established based on the service instance, and the necessary transmission status for a service instance can be computed, and not determined through the exchange of signals. This allows you to use a routing Protocol and eliminates the need to use several other protocols that are typically used in MPLS networks.
In one example embodiment the node ID can be used as an external label to ensure traffic to the destination node in an MPLS network. Since the node ID in the scale domain is unique, in this example embodiment, the nodes in an MPLS network can have is tanovich the state of the transmission, that any packet, the ID of the node label will be transmitted along the tree shortest path to the destination. In this example embodiment, the nodes do not need to switch labels when crossing the network service; rather, at each hop can be used the same label so that it is not necessary coordination between nodes on the paths to send traffic through the MPLS network.
In another example embodiment, instead of using the label values are unique across the domain for the unicast traffic to the destination, the nodes in the network can create labels deterministic, and these labels will be used for data transmission to each destination in the network. As noted above, each node in the network is synchronized view of the network topology and computes the shortest path tree for each node in the network. As part of this calculation, the node can calculate the label that should be used for traffic on the shortest path tree. Similarly, the node can calculate what the label will use its neighbours to forward traffic through the tree to the destination. Nodes can set the status of transmission for these labels so that the label space could be reused in the network. However, since the labels are computed, and are not notified, the nodes may not use LDP or the other Protocol is the signaling tag to set the labels of LSPs in the network.
For example, the node in the figure 1 L transmits the status notification channels 16 that contains the MPLS label, which will serve as the ID of the node L in an MPLS network. As shown in figure 2, the nodes in an MPLS network will use the network topology of the routing system to determine a shortest path tree 18 to each node in the network. The shortest path tree marked on figure 2 darker lines. When nodes receive the notification about the status of the channels containing the ID of the node, the nodes in an MPLS network will use the routing system to calculate the shortest path tree to the node that has transmitted the notification. The nodes in the network also compute the labels that will be used to forward traffic along the tree to the node that relays the status of the installation in its database, ensuring packet transmission calculated with MPLS labels to another node. In one example embodiment the node ID can be the label that may be used by all nodes in the network for transmitting MPLS traffic to the site. In this example embodiment, the nodes do not need to perform label swapping, and they may simply pass the traffic is tagged with an identifier of the MPLS label node, the destination node. This requires that the label of the MPLS-scale domain would be unique. In another example embodiment, if a unique MPLS label in the scale domain is not used, the nodes can calc the drain label, which will be used for traffic and the prescribed communication state based on the computed labels. In any example embodiment does not require the exchange of signals for the exchange of labels in the network.
In figure 1 the node L sends notification of communication status containing node ID = L. the node ID is the label of the MPLS. Each node determines whether it is on the shortest path tree to the node L and, if so, sets the transmission status to send traffic to node L. the Label may be unique across the domain and constant across the network, or nodes can be calculated with different labels, which are then loaded as traffic to the destination.
In operation, when a packet reaches the edge of the network, the edge router label can search and decide which packet should be transmitted to the node L in the network. Edge router label then appends the label for a node L (node L is the node ID) to the packet and transmit the packet to the MPLS network. Each node in an MPLS network has a transmission status, which allows the node to transmit a packet to node L in the shortest path tree.
For example, if node a receives the packet 20, it performs a search to determine how to transmit a packet in the network. In this example, the node a determines that the packet should be passed to node L. the Node And append a label 22 MPLS package, which identify the range of node L, and will transmit the packet in the network. The node E receives the packet, it reads the label 22 and transmits the packet to the node N. Note that in this example, node E does not replace the label, but rather, uses the same label. Each MPLS node in the network performs the same process of reading the label 22 with subsequent re-use the same labels to allow the package to use this label at each hop in the network. Additionally, the label 22 may be removed in the last node N or elsewhere in the network, where transmission is implicit, in a manner analogous to the sample data to the transit station. This example embodiment provides a relatively simple operation from the point of view of computation labels because each node uses the same label to send traffic to the destination. The invention is not limited to this method, since it can also be used in other computations labels that will allow the nodes to compute the labels for traffic on the MPLS paths.
Transmitting the unique ID of the node in the scale domain in the form of MPLS labels and use a routing system for establishing a communication status for the ligament tags/site allow you to set unicast communication in an MPLS network, without requiring the sending of messages in the network on a separate path label switching. Typically, the node L must establish separate ways commutes and labels with each of the other nodes in the network. When using a routing system for establishing a unicast connection to the traditional exchange of signals LSP can be excluded.
Multicast communication can also be carried out by introducing the notion of a service instance in the MPLS network. As used here, the term "service instance" refers to the group of interest multicast or unicast. The nodes in the network can inform about the interest in the instance of the service for status notification channels, router, or network, including adjacent routers. An example of a service instance, such a node ID, a label MPLS, which is a unique value across the domain. The nodes in the service instance is notified its interest to the service instance using is-is notice LSA. Although the node identifier identifies the destination node in the multicast context service instance ID identifies the destination multicast.
When a node in an MPLS network is notified LSA containing the service instance, it determines whether it is the shortest path between the node distribution of the interest in the service ID and the node source associated with the service instance. Any node that is on a shortest path between the destination multicast and another node that distributes a common interest in the same instance of the service, will set the status of the transfer service instance in its database for data transmission. Because the service instance is the label of the MPLS, set the status of the transfer service instance will allow the site to transmit any packet tagged with the label of the service instance, on the shortest path through the MPLS network. Thus, MPLS multicast communication can be created, simply by initiating sites for notification of interest to the service instance. The MPLS nodes in the network can then create a route to the multicast tree without requiring a separate message in the network of the multicast tree. Thus, multicast MPLS can be installed as a unicast transmission, using the same mechanisms, without using LDP or other Protocol on the exchange of marks and without requiring the use of a separate control Protocol multicast groups, such as the IGMP group.
For example, in figure 3 it is assumed that the service instance 100 is a multicast traffic stream generated in the node l Node L distributes interest to the service instance = 100, so that all the nodes in the network knew that the node L is the destination of multicast transmission service instance ID = 100. The service instance ID is a multicast label that node L will be used to transmit multicast is Rafiq in an MPLS network.
In the example shown in figure 3, assume that node a and node D would like to receive multicast traffic associated with the service instance = 100. Each of these nodes transmits a notification about the status of the router or the network containing the ID of the service instance multicast that is interested in joining. Accordingly, the nodes a and D will give notice LSA containing a service ID = 100. The status message router or network be flooded by MPLS. Each node that receives the notification about the status of the router or network, will see whether this is the shortest route between the place nominating multicast and end the top of the tree describing a common interest in the same service instance. Node E, for example, determines that it is on the shortest path between node a and node L and install the transmission status for multicast label associated with the service instance in its forwarding table. Similarly, the node N determines that it is on the shortest path between node a and node L, and that he is on a shortest path between node D and node L. Accordingly, the node N will set the status of the transmission to duplicate traffic is passed from node L, and generates two ports - one port to D and one port to A. In the example shown mnogogranno the tree, marked with bold lines in figure 4.
Each node in the network computes label service for multicast and accordingly sets the transmission status for multicast. Multicast can use a unique MPLS label in the scale domain, which uniquely identifies multicast in an MPLS network. In this example embodiment the node must not perform label swapping, but, rather, they can set the transmission status for the unique MPLS label in the scale domain. Alternatively, nodes can compute the labels that will be used for multicast and install the transmission condition for the computed labels.
When a node L receives the packet that is associated with the multicast transmission, it attaches the label 24 to the packet to identify the packet as part of a service instance 100. In addition, a node can also attach a second tag that identifies the node is the source (using the node ID of the source) and use it as an external label. After joining the label of the node L sends a multicast packet in the network. When a node N receives a packet, it reads the label and performs a search to determine which port or ports it should send the packet. The node N determines that it must send a packet to node E and node D, replicates the packet and outputs the packet is and ports to these nodes. If the service instance is used globally unique label, node N will apply the same label to the package, as it was attached to the package upon arrival, so that the service would use the same label at each hop in the network. On the other hand, if the labels were computed in a deterministic way, the node swaps the original label to the new label before passing the packet to the network. Where the transmission status implicitly, for example in the line between node N and node D, the label can be removed. The transfer may be made on the basis of only one service marks or based on a combination of tags and original tags, if you use the source tag.
According to one example embodiment of the invention the label of the services used to create multicast and unicast are calculated deterministic. This allows you to create the MPLS path, without requiring messages about the ways individual exchange Protocol signal - to establish and removal path can be used by the routing Protocol. In one example embodiment multicast MPLS uses label space for each root of the tree. This uses the label that defines the upward flow. The source must be marked with a unique identifier that is placed in the space label MPLS, ISP is lsua not more than 20 bits. The label space is identified by the context, which can be an external label. The node can calculate the external space tag on site from space platforms. Each node computes the node ID to the node ID was created for all destinations.
Multicast operation multicast packets include two labels: the outer label from the space platform, which is the same on all nodes, and the internal label, which provides the source of the "node ID". The inner label is the label in the scale domain. Internal label based on the source and is only installed on the nodes in the domain that support this multicast tree. Unique internal label in the scale domain based on the "service ID".
All nodes compute shortest paths for all pairs, creating a tree from each source. When the node is on the shortest path between two destinations, determining interest in a specific service instance, the node sets the label space for the source host and each service ID, which passes through the node.
The transfer operation includes reading the multicast context of MPLS and the search space of the label of the source based on the node ID. External label can be removed, and the second inner) label defines a set of output ports. External label can be re-entered, and the packet is replicated for each outgoing port.
Unicast: unicast packets also include the same two labels. The outer tag is a unique tag in the scale domain, based on the destination "node ID". Alternatively, the labels on the unicast path can be computed deterministic. Internal label based on the destination and checks only at the output.
All internal and external labels and/or contexts labels are distributed through IS-TS. All nodes compute shortest paths for all pairs, creating a tree from each source. When the node is on the shortest path between two destinations, the node sets the destination tag for the destination node, if the service ID is shared. Service IDs can be identified as the destination, or enter the control plane and, therefore, can create one-way traffic. Service can combine multiple service IDs. Service IDs may be associated with unique identifiers topology.
In addition, in one example embodiment, the unicast path will be congruent with respect to the multicast transmission, if all calculations are uniquely determined. The invention is not limited to the scarfing this way, and can be used by different processes determine paths through the network for unicast transmission, in contrast to their use for multicast. Although we used the shortest path trees, it works on all types of trees, which is deterministic. Thus, instead of shortest path trees can be used in other types of deterministic trees. In addition, the available multipath principle, if some of the bits of the label "node ID" is used to identify different ways, creating identifiers for equal trees.
Designed for traffic MPLS network can use labels, such labels for multicast, which define the label from point to point or point to multiple points. Space labels should be separated to ensure the designed service traffic. Label service can be defined as the source and receiver, as well as projected traffic or not designed for the traffic. More information about bandwidth and paths should be included in the status notification channels, designed to route traffic could be used in this network.
Organization of the service ID, which is used for multicast and unicast, and follow the displayed services along the edge of these groups provide a topology multicast from the start, and not later.
The creation of service instances is used to describe the multicast service as a simplified exchange of signals (i.e., using the local state of a router or network, including the status of the interfaces and the adjacent routers is-is). Move all notification service groups in the state of connection allows the model to move from the current model of the exchange of signals to the model calculations, providing rapid convergence without an exchange of signals. Now MPLS uses label distribution protocols to create a path-switched labels. When using service instances, you can fix the exchange of signals for the allocation of labels to provide a service model that is similar to the Ethernet model, adapted for multicast and unicast, and to ensure proper communication over Ethernet Protocol (RVV with MPLS core.
The figure 5 shows the block diagram of the process of establishing a unicast communication in an MPLS network according to one example embodiment of the invention. As shown in figure 5, the nodes in the MPLS networks (100) exchange notifications on the status of the router or network, allowing each node to have a synchronized view of the network topology. Each node in the network is assigned a node ID in the scale domain (MPLS label) that will be used to transfer advoates the CSOs traffic to this node (102). Nodes propagate a node ID using message describing the local state of a router or network (104), and the nodes in the network calculate the shortest path tree to each node (106). Then the node sets the transmission status on the shortest path tree to provide unicast traffic that contains the ID of the destination node as a label that is transmitted via the shortest path tree to the destination (108). The node ID can be used on the label transfer, or the node may deterministic calculate the label transfer, which will be used ascending node on the tree and deterministic to compute the label of the transfer, which he must use to send traffic to the destination. When a packet is received at the entrance to the MPLS network, the label assignment will be attached to the package (110). This mark will be based on the identifier of the destination node. Then input node transmits the packet to the MPLS network, and the nodes on the shortest path tree will transmit the packet through the MPLS network to the output node (112).
The figure 6 shows the block diagram of the process of establishing multicast communication in an MPLS network according to another example embodiment of the invention. As shown in figure 6, the service ID in the scale of the domain is assigned to each multicast transmission, which will be performed in an MPLS network (120). Each node that Ho is et to participate in the multicast transmission, distributes the service ID using the status notification router (122). Sites pre-compute the shortest path trees to determine whether they are the shortest paths between the multicast source and one or more nodes, declaring interest multicast (124). Any node on the shortest path between two nodes, announcing the General interest in the same service instance, sets the transmission status for this service instance (126). When traffic destined for forwarding multicast tree, the input node will attach the label to the multicast service to each packet and passes the packet to the MPLS network (128). Nodes in an MPLS network will use the state transfer for multicast transmission to selectively transmit the multicast traffic across an MPLS network from the source host to other hosts interested in receiving this traffic (130).
The figure 7 shows the functional block diagram of exemplary element of an MPLS network. As shown in figure 7, the network element includes MPLS routing feature 70 that receives the status notification channels, describing the local state of a router or network communication from other nodes and uses the notification about the status of the router or the network to indicate that the creation of a database of link state 72. Databases the data link state contains information about the network topology and is used by the network element for calculating shortest path trees rooted at each node of the network.
According to another example embodiment of the invention the routing function also receives information on the label of the status messages of communication and uses the information on the label for programming the transfer function 74. Information on the label includes the identifiers of the nodes, which are the labels that identify the nodes in the network, and service IDs, which are examples of the instances of the service tag identification in the network.
When the routing function is notified about the status of the router or the network containing the node ID, it sets the state of the transmission in the transmission function to transmit the traffic marked with a node identifier corresponding to the output port so that traffic followed in the shortest path tree to the destination node in the network. During this operation, the transfer function reads the label to determine the next hop for traffic and forwards the traffic function Queuing 76 for the respective port, which is connected with the following transit area. The label can be transferred to the transfer function or features-Queuing before the packet is sent.
When the routing function is notified about the status of the router or network that contains the service ID, it updates its database of link state, the button to enable communication between the service identifier and the node, issuing the notification on the status of the router or network. The routing function will also search its database about the status of communications with other nodes, which also expressed interest in this service ID. Then the node sets the transmission status for the service instance in transmitting function whenever the node is on the shortest path tree between two nodes, promoting a common interest in the same service instance.
Where the network element 12 is an edge router of a label, the routing function can also maintain a database of labels 78, which will be used by the function encapsulation 80 to mark the traffic as it travels on the network. When the packet reaches the network element 12 outside of the MPLS network, the packet will be classified and it will be attached label. Where the packet is a unicast packet, a unicast packet is received label assignment and the added feature of encapsulation. Where the packet is a multicast packet, the label assignment is received for a multicast packet and the added feature of encapsulation. In addition, the encapsulation may also add one or more internal label to the package. The encapsulated packet is then sent to the transmitting function that will be passed to the appropriate p is RT in the MPLS network.
The above Functions can be implemented as a series of program commands that are stored in considered the computer memory and executed on one or more processors of a computer motherboard. However, for qualified specialist clear that all logic described here can be implemented using discrete components, integrated circuit, such as a specialized integrated circuit (ASIC), programmable logic used in the kit with programmable logic device such as a valve matrix, user-programmable (FPGA) or microprocessor, a state machine or any other device including any combination thereof. Programmable logic can be installed temporarily or permanently in a tangible medium, such as a chip constant memory, computer memory, disk, or other media. All such examples of embodiments are included in the scope of the present invention.
It should be understood that it can be made various changes and modifications of the examples of embodiment shown in the drawings and described in the description of the invention, without leaving the spirit and scope of the present invention. Accordingly, all signs contained in the above description and shown in the accompanying drawings shall be interpreted in an illustrative and not in the exhaust gas is uniqueuse sense.
1. Method of application service instance to an MPLS network that contains the following stages:
exchanging messages about routing between network elements in the MPLS network so that the network elements were synchronized view of the network topology MPLS;
the distribution of the first element of an MPLS network in an MPLS network unique identifier for the service in the scale domain in one of the messages about routing; and
calculating the second element of an MPLS network from the second network element MPLS synchronized view of the network topology MPLS to establish an MPLS label, to realize the transmission status for the service identifier, determining whether the second network element MPLS on the shortest path tree with roots in the first MPLS network element.
2. The method according to p. 1, in which the unique identifier of the service in the scale domain is a unique node identifier of the network element in the scale domain.
3. The method according to p. 2, in which the node ID is a unique MPLS label in the scale domain.
4. The method according to p. 3, in which a unique MPLS label in the scale domain can be used to send unicast traffic to the first network element in an MPLS network.
5. The method according to p. 4, in which, if the second element of an MPLS network sets the transmission status for the service ID, the second element of an MPLS network sets the transmission status for icalneu label of an MPLS network across the domain with the to any package, adopted by the second element of an MPLS network, contains a unique MPLS label in the scale of the domain will be transferred to the first network element of an MPLS network.
6. The method according to p. 1, additionally containing the calculation of at least one MPLS label with the second element of an MPLS network, with at least one MPLS label is used to forward traffic associated with the service instance.
7. The method according to p. 3, in which stage of the calculation, at least one MPLS label includes determining a unique MPLS label in the scale domain, which can be used for traffic associated with the service instance.
8. The method according to p. 3, in which a unique MPLS label in the scale domain is unicast label associated with the destination node in an MPLS network.
9. The method according to p. 6, in which stage of the calculation, at least one MPLS label includes calculating at least one label, which will be used for traffic associated with the service instance in a deterministic way.
10. The method according to p. 1, in which stage of calculating the second element of an MPLS network from the second network element MPLS synchronized view of the network topology MPLS, includes determining whether the same service ID common third element of the MPLS network, and, if so, determining whether the second network element MPLS transmission path between the first element of an MPLS network and the third network element, MPLS.
11. The method according to p. 10, in which the third network element is a multicast source associated with the service ID, and in which the first network element is a multicast subscriber associated with the service ID.
12. The method according to p. 11, in which the transmission path is the shortest path between the first element of an MPLS network and the third network element, MPLS.
13. Method of application service instance to an MPLS network that contains the following stages:
the distribution of the subset of network MPLS network MPLS interest in the multicast service instance, while multicast service instance is a unique value across the domain;
selective organization of each of the other network elements in the MPLS network information transmission for a multicast service instance, if every other element of the network is on a shortest path between two network elements, with the notice of General interest in the same multicast service instance
and stage announcements implemented through the system of state routing channel when used in an MPLS network.
14. The method according to p. 13, in which the transmitted information is a unique label in the scale domain associated with the service instance, so you do not have to enter a label in the MPLS network to transmit information, which will be set by the network elements in the set is MPLS.
15. The method according to p. 13, in which the transmitted information is not unique across the domain, but is calculated in a deterministic way by each of the nodes in an MPLS network, so you do not have to enter a label in the MPLS network to transmit information, which will be set by the network elements in the MPLS network.
16. The MPLS network, comprising:
many MPLS nodes configured to perform a routing Protocol based on the status of the channels, to allow each MPLS node to create a synchronized view of an MPLS network, the MPLS nodes are configured to declaring interest in the service instance via the routing Protocol based on the status of the channels and the establishment of the state of transmission between pairs of nodes, distributing the announcement of General interest in a particular service instances, and the MPLS nodes is additionally configured to calculate marks for use in connection with transmission status instead of transmitting signals of labels for use in connection with transmission status.
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to communication technologies, and namely to a conference call management method, device and system. The result is achieved due to the conference call management method that includes: receiving a request of a right to speak from the first place. The said request contains the first node and the first place identifiers. The node, corresponding to the first node identifier, contains multiple places and belongs to the first conference. The first place identifier is the one, requesting the right to speak at the node, corresponding to the first node identifier. If the place is granted to the node requesting the right, then a video stream is played to the terminal of at least one node, except for the node, corresponding to the first node identifier in the first conference.
EFFECT: reduced network bandwidth load.
16 cl, 13 dwg
FIELD: radio engineering, communication.
SUBSTANCE: method comprises receiving a voice and video call initiated by a multimedia terminal of a first user and including a voice part and a video part; establishing a voice carrier between the multimedia terminal and a voice terminal of a second user to whom the voice and video call is forwarded; establishing a web session with a web browser of the second user, in which the desire of the second user to access the video part of the voice and video call is specified; identifying the voice and video call to be accessed; receiving first communication information sufficient to deliver first video content for the video part of the voice and video call to a media player associated with the web browser, and delivering the first communication information to the multimedia terminal, wherein the multimedia terminal or an agent thereof delivers first video content to the media player of the web browser using the first communication information.
EFFECT: enabling sharing of video content from mobile devices with users who either do not have compatible telephones or are not subscribers of the call sharing service.
37 cl, 13 dwg
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to a system of identifying and accessing network for a home gateway (HG). The method includes: an optical network unit (ONU) receiving a HG Media Access Control (MAC) identification code and a management virtual local area network (VLAN) number sent by a network manager; the ONU automatically identifying the HG which is connected to the ONU and corresponds to the HG MAC identification code and the management VLAN number, and reporting the MAC address and the service attribute of the HG to the network manager; after making the HG accessing network message confirmed by the resource system, the network manager configuring the HG accessing network identifier of the ONU as having accessed network and sending service VLAN number conversion rules to the ONU; according to the service VLAN number conversion rules, the ONU converting the service VLAN number on the HG to the service VLAN number which can be identified by the ONU.
EFFECT: automatic identification and accessing network of a home gateway.
11 cl, 6 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to a mobile communication method and a switching centre of mobile communication. A method involves the following steps: transmission from a mobile station of a service request signal in the specified zone at identification of a communication channel in a reference network of the first mobile communication system that provides no communication to channel switching; performance of the first operation to ensure a possibility of a mobile station to start communication to channel switching in the second mobile communication system if the switching centre of mobile communication of the first system detects that service request signal contains the first identification information; and performance of the second operation to identify a communication channel of the mobile station in the radio access network of the first system if the switching centre of mobile communication of the first system detects that service request signal contains the second identification information; with that, if possible communication of the mobile station with channel switching in the second system in the specified zone is restricted, then, the switching centre of mobile communication of the first system does not perform the first operation even if the switching centre of mobile communication of the first system detects that service request signal contains the first identification information.
EFFECT: technical result consists in provision of possible restriction of possible communication of a mobile station with channel switching.
6 cl, 10 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to wireless communication methods. The technical result of the invention is improving coverage and throughput at the edge of a cell in a communication system for a mobile user using fixed transponders which are part of the infrastructure without an intermediate wire link. The transponders transmit or "relay" downlink messages between a base station (BS) and mobile terminals (MS) through a multi-interval link.
EFFECT: invention provides a method and a system for supporting a multi-user mobile broadband communication network which includes relay equipment suitable for user equipment during downlink transmission to the user equipment.
24 cl, 12 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to a method and a system for providing an internetwork roaming service. A communication network system which provides an inter-network roaming service comprises a packet service network which provides a packet-based service, and a circuit-switched network providing a circuit-switched service. The disclosed system also includes a roaming gateway acquiring and authenticating a service profile of a first terminal from the packet service network when the first terminal requests registration to the circuit-switched network, and converting and providing the service profile into a protocol of the circuit-switched network such that the circuit-switched network registers the updated location of the first terminal. The packet service network and the circuit-switched network are physically different networks.
EFFECT: high quality of service for network subscribers.
10 cl, 5 dwg
FIELD: physics; control.
SUBSTANCE: invention relates to video monitoring systems and a control method therefor. The video monitoring system comprises a signal interface gateway which receives, respectively, control signals from a digital video monitoring system and/or a matrix video system in an analogue video monitoring system and accordingly converts the control signals from the digital video monitoring system and/or control signals from the matrix video system. Said conversion includes creating a relationship table in the signal interface gateway which represents relationships between channels of the digital video monitoring system and channels of the matrix video system, and performs conversion of the control signals according to the relationship table.
EFFECT: providing mutual control of an analogue video monitoring system and a digital video monitoring system.
6 cl, 10 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to multimedia streaming systems. The technical result is adaptation to taking advantage of the content reception capture process and preparing files with improved quality of block-request streaming when interacting with a user, as well as high bandwidth efficiency. The capture system receives content and prepares said content in form of files or data elements for use by a file server. The files or data elements are organised in form of blocks which are transmitted and decoded as a certain unit, and the system is configured to provide and consume scalable blocks, such that the quality of presentation improves when a large part of a block is loaded.
EFFECT: encoding and decoding blocks with multiple independent scalability levels.
18 cl, 29 dwg
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to computer engineering. The method of managing conversation access rights comprises steps of: receiving a request for creating a conversation access rights based restriction for a communication session at a rights management server; providing a license to a requesting first client application; receiving another request from a second client application for the license, the second client application being invited to participate in the communication session with the first client application; providing the license to the second client application in response to confirming communication session access rights. The communication system implements said method and a machine-readable medium contains instructions for implementing the method.
EFFECT: safer communication session owing to verification of access rights of a client.
15 cl, 7 dwg
FIELD: information technology.
SUBSTANCE: method involves receiving packets from an external network; creating a table of connections; determining the total number of currently established connections; determining the load level of the firewall by comparing the number of established connections with a threshold; determining new and established connections based on two-way exchange of packets between a client and a server; determining connection termination based on processing ICMP messages on errors or flags in the TCP header; dynamically determining current connection timeout values based on the type of the network protocol, the connection status and load level of the firewall; changing the timestamp of processing the last packet if any packet is transmitted within a given connection or within a group of connections; terminating a connection if the timestamp of processing the last packet differs from the current time more than the timeout of said connection.
EFFECT: high reliability of established connections and providing maximum throughput with a high load.
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to connection processing systems and methods using a temporary port. The technical result is achieved using a proxy server which imitates a status from the server through changes in the states of the temporary port. The connection processing system using a temporary port comprises an application, an interception means, a connection establishing means and a remote server. The application initiates connection establishment with the remote server by sending network requests. The interception means intercepts network requests from the application to the remote server and initiates creation of a temporary port. The connection establishing means establishes a connection with the remote server after interception, creates a temporary port and imitates the status from the server by changing the state of the created temporary port. The remote server establishes a connection in response to the network requests.
EFFECT: enabling establishment or termination of a connection between an application and a remote server.
8 cl, 5 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to methods and apparatus for selecting a gateway in a wireless communication system. A method of selecting a gateway (GW) in a mobility management entity (MME) in a wireless communication system comprising steps of receiving a connection request message from a home evolved Node B (HeNB); determining if the connection request message includes a local gateway (L-GW) address; and if the connection request message includes a L-GW address, selecting a GW using the L-GW address.
EFFECT: efficient gateway search using core network equipment.
24 cl, 12 dwg
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to automatic integration of a device into a network system so that a user does not have to tune or configure a new device. The method includes the following stages: a new device is detected for integration into a network system; a reference device of the network system is determined, and functional capabilities of the reference device are copied to the new device; at the same time the stage of detection of the new device for integration into the network system includes determination of new device capabilities, and the stage of determination of the reference device of the network system includes determination of the reference device of the network system with capabilities that are close to capabilities of the new device.
EFFECT: possibility to integrate a new device into a network system, without necessity for a user to interact with this system, due to procedure of automatic copying of functional capabilities of a device to a new device integrated into a network system.
9 cl, 5 dwg
FIELD: radio engineering, communication.
SUBSTANCE: private base station comprises: a processing unit configured to scan data of overlaying macro cells of a public radio network in order to report the location of the private base station; a communication device configured to request a connectivity service from the public radio network by using identification data of the private base station and the location of the private base station; and a communication device configured to receive grant to use the requested connectivity service once the identification data have been verified by the public radio network.
EFFECT: facilitating automatic configuration of private base stations in a public bearer network.
34 cl, 5 dwg
FIELD: information technology.
SUBSTANCE: apparatus comprises: devices which are connected to the same network and are allocated for the same limited space. A transmitting device is configured to transmit access information for devices in said limited space over a limited-range transmission channel different from the transmission channel(s) of the network control system. In this manner, which substantially limits reception of access information within said limited space, wherein said access information contains an access identifier for obtaining access for controlling one or more devices in said limited space. The transmitting device frequently changes the access identifier contained in the transmitted access information such that only receiving devices receiving an access identifier in the limited space may obtain access to devices in the limited space.
EFFECT: faster transmission of information within a network.
12 cl, 3 dwg
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to management of documents, particularly to applications for creating and managing persistent document collections. The technical result is achieved owing to a data storage which is used to store one or more persistent document collections, a content management application which is used for managing documents for users, for creating one or more persistent document collections of a sub-set of the documents upon user request, and for storing the one or more persistent document collections in the data storage, wherein users can create one or more persistent document collections from a sub-set of the documents and also modify the one or more persistent document collections; a requested portion of one or more persistent document collections can be output upon request from an external application so that the external application can download one or more of the documents that are represented by the persistent document collection for further modification by the user.
EFFECT: providing automated access to a plurality of persistent document collections by assigning a persistent document collection an attribute which indicates one or more external applications with which the persistent document collection shares its documents.
15 cl, 13 dwg
FIELD: physics, control.
SUBSTANCE: invention relates to method of controlling transmissions of a batteryless device (1) operating in a wireless network. The method comprises steps of: the batteryless device (1) transmitting a frame including elements for controlling operation of a remote device (2a) or controlled device, the batteryless device being configured with a predetermined number of planned retransmissions of the control frame; the batteryless device sensing a change in the physical phenomenon induced by operation of the controlled device (2a); the batteryless device determining, based on the sensing step, the success or failure of the frame transmission; if the transmission has succeeded, the batteryless device omitting further retransmissions of the control frame.
EFFECT: high efficiency of saving power.
14 cl, 1 dwg
FIELD: physics, computer engineering.
SUBSTANCE: invention relates to means of executing a function of a DNS resolution agent. The method comprises receiving a DNS request from a DNS requester and determining whether the DNS request is a repeated request; when the DNS request is not a repeated request, sending a DNS request message to DNS servers in a DNS server list in turn according to a fixed time interval and waiting to receive a request response returned by the DNS server in a waiting time not greater than the fixed time interval; delivering a valid request response to the request received in the waiting time to the DNS requester; when no request response is received from a DNS server in the waiting time, reducing the priority of the DNS server in the DNS server list to the lowest level.
EFFECT: reducing response time for a DNS request from a device.
8 cl, 4 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to network communication, particularly a method and an apparatus for creating a peer-to-peer group and a method of using a peer-to-peer group. Said method includes the following steps: at the first step a user terminal obtains one or more primary nodes from a peer-to-peer (P2P) network server; the P2P network server returns said one or more primary nodes in accordance with an adjusted policy; the user terminal creates a primary P2P group from said primary nodes; nodes of the primary P2P group interact with each other to obtain information about other nodes of other P2P groups and create a new P2P group based on the information about said other nodes. Therefore, said new P2P group facilitates a stable interconnection between nodes and the nodes can properly serve if network resources are needed. Furthermore, node control is carried out in the user terminal, thereby reducing the operating load and costs on the server, wherein the nodes can be better utilised and user satisfaction with network performance is improved.
EFFECT: lower operating load on the server when performing control.
8 cl, 4 dwg
FIELD: radio engineering, communication.
SUBSTANCE: invention relates to wireless communication engineering and can be used to grant reverse direction transmission. The method of scheduling with reverse direction transmission grant comprises receiving, in a receiver from a transmitter, a multi-poll frame that schedules transmissions for a number of time periods associated with transmission opportunities; transmitting data in a first direction from the receiver to said transmitter according to the multi-poll frame, wherein data transmission is terminated before the end of a specific period from the scheduled time periods; transmitting a reverse direction transmission grant from the receiver to said transmitter, wherein the reverse direction transmission grant allows the transmitter to transmit data in a second direction to the receiver using a specific period from the scheduled time periods associated with a specific transmission opportunity; and receiving, in the receiver, data transmitted in a second direction from said transmitter, which schedules transmissions during a specific time period from the scheduled time periods associated with a specific transmission opportunity.
EFFECT: high efficiency of using communication channel bandwidth when communicating with scheduled time periods which grant specific stations access to the channel.
20 cl, 13 dwg
FIELD: wireless interface technology.
SUBSTANCE: one protocol of network messaging is a control protocol for NDIS device. Also, multiple software products for operation in circuit-based, i.e. bus-connected, network, can also be used for any wireless Bluetooth network.
EFFECT: broader functional capabilities.
3 cl, 3 dwg, 1 tbl