MESSAGE ROUTING FOR PARTNER CARRIER SUBSCRIBERS

    公开(公告)号:US20230144632A1

    公开(公告)日:2023-05-11

    申请号:US17522719

    申请日:2021-11-09

    Inventor: Timothy Yao

    CPC classification number: H04W40/36 H04W40/248 H04W40/38

    Abstract: The disclosed technology is directed towards routing, by a mobile network operator, a message to a messaging hub associated with a partner carrier or to the partner carrier itself. In response to receiving a message to reroute, a data store (e.g., an ENUM database) is queried to attempt to obtain information corresponding to the routing. For example, when the query response includes a regular expression that specifies a domain, the domain is evaluated against a data structure of respective messaging hubs associated with respective domains. If the returned domain is matched such that an associated messaging hub is identified, the message is routed to the identified messaging hub; otherwise a mobile network partner carrier is determined based on the telephone number of the message recipient, and the message is routed to the determined partner carrier.

    DYNAMIC CROSSBAND LINK METHOD AND WIRELESS EXTENDER

    公开(公告)号:US20180184354A1

    公开(公告)日:2018-06-28

    申请号:US15903045

    申请日:2018-02-23

    CPC classification number: H04W40/14 H04W24/08 H04W40/06 H04W40/16 H04W40/38

    Abstract: A dynamic crossband link method is provided, which includes utilizing a local forwarding module to transmit and receive packet data to and from a client device via a first frequency band; obtaining a plurality of communication quality indicators corresponding to a plurality of uplink forwarding modules; and determining to transmit the packet data to a wireless access device and receive the packet data from the wireless access device via one of the plurality of uplink forwarding modules according to the plurality of communication quality indicators.

    Local path repair in a wireless deterministic network
    7.
    发明授权
    Local path repair in a wireless deterministic network 有权
    无线确定性网络中的本地路径修复

    公开(公告)号:US09319962B2

    公开(公告)日:2016-04-19

    申请号:US14043974

    申请日:2013-10-02

    Abstract: In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.

    Abstract translation: 在一个实施例中,通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径,所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地(例如,不接触路径计算引擎)被重新配置为绕过创建新路径的至少一个中间节点,新路径满足度量的要求。 注意,“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体(例如,网络管理系统,操作支持系统))确定替换路径时确定替换路径。 在一个实施例中,不在初始路径上的网络节点替换初始路径上的节点,同时使用在初始路径中使用的相同的接收和发送时隙。

    ROUTE OPTIMIZATION FOR ON-DEMAND ROUTING PROTOCOLS FOR MESH NETWORKS
    9.
    发明申请
    ROUTE OPTIMIZATION FOR ON-DEMAND ROUTING PROTOCOLS FOR MESH NETWORKS 有权
    网路网络路由优化路由优化

    公开(公告)号:US20150103813A1

    公开(公告)日:2015-04-16

    申请号:US14286461

    申请日:2014-05-23

    Applicant: Firetide, Inc.

    Abstract: Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

    Abstract translation: 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积,以便在更好的路径变得可用时发现,即使协议当前使用的路径没有被破坏。 换句话说,机制(或“路由优化”)可以改善路由,即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息,以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中,在没有任何明确的控制分组交换的情况下,执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息,其中改进路由从较不接近最优路由发散。

Patent Agency Ranking