Abstract: A method for managing an Unmanned Aerial Vehicle (UAV) is described. The method includes receiving a flight plan that describes a proposed flight mission of the UAV in an airspace; adding one or more predefined points to the flight plan to create an enhanced flight plan, wherein each of the predefined points is associated with a set of conditions and a set of locations; and transmitting the enhanced flight plan to the UAV for storage of the predefined points on the UAV while the UAV carries out the proposed flight mission.

Abstract: Broadcasting geolocation information of an Unmanned Aerial Vehicle (UAV) from the UAV by determining current geolocation of the UAV by communicating with a geolocation service and utilizing the geolocation service to geolocate the UAV. Then the UAV prepares a radio frame that includes geolocation information identifying the current geolocation of the UAV and other information associated with the UAV using a radio protocol of one of a 3rd Generation Partnership Project (3GPP) radio protocol, a WiFi radio protocol, a wireless personal area network protocol and a low-power wide-area network protocol and transmits the radio frame to broadcast the current geolocation of the UAV.

Abstract: A method of routing packets between nodes of a packet switched network, the method comprising receiving a packet at a first node, the packet comprising routing information and payload data, sending said routing information to a second node in the routing path via a first transmission medium having a relatively high transmission speed, and sending said payload data to said second node via a second transmission medium having a relatively low transmission speed. Upon receipt of said routing information, said second node is able to prepare or begin preparation for onward routing of the packet in advance of receipt of said payload.

Abstract: A system and method of automatically configuring a Service Instance Identifier (I-SID) in a Generalized Multiprotocol Label Switching (GMPLS) controlled network. The method begins by identifying a specific I-SID for a specific service in the GMPLS controlled network. Next, the identified I-SID is automatically configured within a Backbone Edge Bridge (BEB) with a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) extension. The automatic configuration may be implemented by several different embodiments. In one embodiment, the I-SID may be carried in a SESSION_ATTRIBUTE object. In another embodiment, the I-SID may be mapped to a Short Call ID field in a Session object. Alternatively, the I-SID may be carried in an Endpoint ID Type-Length-Value (TLV). The I-SID may also be carried in a new TLV in a LSP_ATTRIBUTES or CALL_ATTRIBUTES object.

Abstract: A system for managing congestion within a network domain includes an ingress node, an interior node, and an egress node. The ingress node receives and routes data units entering the network domain. The interior node detects whether a load exceeds one or more load thresholds and generates congestion marked data units. The egress node detects the presence of congestion marked data units and reacts to the detection of the presence of congestion marked data units by invoking a congestion control process.

Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.

Abstract: A system and method for in-service migration for a Virtual Local Area Network, VLAN, service if a Provider Bridge Metro Ethernet Network, PB MEN, is upgraded to a Provider Backbone Bridge, PBB, MEN or an Internet Protocol/Multi Protocol Label Switching, IP/MPLS, MEN. After the deployment of the new PBB or IP/MPLS technology, a sequence of management actions are performed to configure PBB or IP/MPLS edge nodes to use the new technology as well as the old PB-based technology to support the VLAN service. Both old and new connectivity structures are maintained in the edge nodes during the entire migration process. Customer traffic is then redirected per edge node to the new technology. When each edge node entirely provides the VLAN service under the new technology, the migration is complete.

Abstract: An example method transmits a path message to an egress node, via intermediate nodes, that configures OAM monitoring of an entire connection between an ingress node and the egress node and also configures OAM monitoring of at least one segment of the connection shorter than the entire connection by at least one intermediate node. The path message comprises a LSP attributes object and an ERO. The LSP object comprises technology-specific attributes defining descriptors for configuring the egress node in accordance with a communication protocol utilized for the connection; and technology-independent OAM parameters that, irrespective of the communication protocol, define an OAM type to be used by the egress node, and define desired monitoring actions for the egress node to perform. The ERO comprises a respective HOP Attributes sub-object for configuring each of the at least one intermediate nodes.

Abstract: A system and method of automatically configuring a Service Instance Identifier (I-SID) in a Generalized Multiprotocol Label Switching (GMPLS) controlled network. The method begins by identifying a specific I-SID for a specific service in the GMPLS controlled network. Next, the identified I-SID is automatically configured within a Backbone Edge Bridge (BEB) with a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) extension. The automatic configuration may be implemented by several different embodiments. In one embodiment, the I-SID may be carried in a SESSION_ATTRIBUTE object. In another embodiment, the I-SID may be mapped to a Short Call ID field in a Session object. Alternatively, the I-SID may be carried in an Endpoint ID Type-Length-Value (TLV). The I-SID may also be carried in a new TLV in a LSP_ATTRIBUTES or CALL_ATTRIBUTES object.

Abstract: A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.

Abstract: A system and method of automatically configuring a Service Instance Identifier (I-SID) in a Generalized Multiprotocol Label Switching (GMPLS) controlled network. The method begins by identifying a specific I-SID for a specific service in the GMPLS controlled network. Next, the identified I-SID is automatically configured within a Backbone Edge Bridge (BEB) with a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) extension. The automatic configuration may be implemented by several different embodiments. In one embodiment, the I-SID may be carried in a SESSION_ATTRIBUTE object. In another embodiment, the I-SID may be mapped to a Short Call ID field in a Session object. Alternatively, the I-SID may be carried in an Endpoint ID Type-Length-Value (TLV). The I-SID may also be carried in a new TLV in a LSP_ATTRIBUTES or CALL— ATTRIBUTES object.

Abstract: There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use.

Abstract: A system and method of demultiplexing Provider Backbone Bridging Traffic Engineering (PBB-TE) service instances. The method is used when monitoring service instances between a first bridge port and a second bridge port by exchanging CFM frames over each service instance. The CFM frame is received by the second bridge port where the complete ESP—3-tuple is demultiplexed. The CCM frames may be demultiplexed by a Full Traffic Engineering Service Instance Multiplex Entity which demultiplexes both the source address value and destination address value of the CCM frames.

Abstract: A system and a method are described herein which provide for congestion handling in a packet switched network domain. In case of congestion overload is measured by a core node, the data packets in proportion to the overload are marked and the signaled overload is stored. At least one egress node receives marked and not marked packets, decodes and counts the overload from the marked packets in a counting interval. Congestion report messages are sent to ingress nodes where flows are terminated.

Abstract: A system, method, and Ethernet bridge utilizing forced MAC learning to set up a path from an originating node, PON (23) to one or more terminating nodes, PTN (12) through intermediate bridge nodes (14, 21). In the point-to-point case, a Previous Hop Bridge (PHB) list defines the links in the path. Each link includes a destination address, source address, port number, and VID. A path learning frame (13, 19, 22) containing the list is sent in reverse order from the PTN through the intermediate bridge nodes to the PON. Each node in the path saves the received frame's header information as learned path information using standard MAC learning functionality, removes the node's own information from the list, and forwards the frame with the remainder of the list to the next node using the port specified by the port number for that link. When the frame arrives at the PON, all nodes have saved the learned path information.

Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.

Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.

Abstract: The present invention relates to an ingress node (102, 700) and methods therein for Operation Administration arid Maintenance, OAM related to Resource Reservation Protocol-Traffic Engineering, RSVP-TE5 for obtaining attributes for timer values being assigned to a connection from the ingress node (102) via intermediate nodes (104, 106, 108, 110) to an egress node (112), during configuration of die connection. An interval of suitable tinier values for the intermediate nodes is specified. Configuration attributes are obtained for a timer value within an interval that is acceptable by the intermediate nodes and the egress node, based on the specified interval of suitable timer values. The obtained configuration attributes are applied during configuration of the connection from the ingress node via the intermediate nodes to the egress node, if the obtained configuration attributes are appropriate to the ingress node.

Abstract: A system for managing congestion within a network domain includes an ingress node, an interior node, and an egress node. The ingress node receives and routes data units entering the network domain. The interior node detects whether a load exceeds one or more load thresholds and generates congestion marked data units. The egress node detects the presence of congestion marked data units and reacts to the detection of the presence of congestion marked data units by invoking a congestion control process.

Abstract: An egress node is proposed for a network domain that comprises at least one ingress node for receiving and routing data units belonging to a plurality of flows into said network domain, a plurality of interior routers for routing said data units through said network domain, and said egress node(s). One or more of the interior routers is arranged to detect whether it is subject to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that comprises a part for detecting the presence of congestion marked data units arriving at said edge node, and a part for reacting to the detection of the presence of congestion marked data units by invoking a congestion control process.