Abstract: In one embodiment, a gateway label edge router (G-LER) receives a packet destined for a mobile domain that comprises a vehicle label edge router. The G-LER identifies, from among a plurality of primary domains, a particular primary domain that currently has a label switched connection with the mobile domain. The label switched connection connects the vehicle label edge router of the mobile domain and a cluster label edge router of the particular primary domain. The G-LER sends the packet to the cluster label edge router of the particular primary domain for transmission to the vehicle label edge router via the label switched connection. The G-LER tracks when the vehicle label edge router of the mobile domain establishes a new label switched connection with a second cluster label edge router of a different primary domain in the plurality of primary domains than that of the particular primary domain.

Abstract: A system for continuously monitoring and searching social networking media allowing at least one client to access the system through a respective connection link and for connecting to at least one social networking media through a connection link. The system further comprises a connecting module comprising at least one connecting unit to connect to the at least one social network media for receiving continuously for a time selected by the activity data shared in real time and/or posted by users of the social network media; and a processing module comprising a processing unit, configured to process continuously for the time selected by the client the received activity data based on at least one pre-determined monitoring criterion selected by the client from a number of predetermined criteria, and a notification unit configured to send a notification to the client when the received activity data meet the selected monitoring criteria.

Abstract: Method of detour path determination for data packets re-routing in a mesh network comprising a plurality of N nodes, arranged according to a network topology, each node has a K-hops neighborhood knowledge of the network topology, with 1?K<N, primary paths are predefined for routing data packets within the mesh network. Detour paths are automatically discovered and set up while expending relatively few resources in terms of processing complexity, signaling and information spreading. The method is particularly advantageous when used in a wireless mesh network wherein the available bandwidth and the node resources and capabilities are much more limited than in wired networks.