会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Protocol for neighborhood-established transmission scheduling
    • 邻里建立的传输调度协议
    • US06788702B1
    • 2004-09-07
    • US09418899
    • 1999-10-15
    • J. Joaquin Garcia-Luna-AcevesDavid A. BeyerChane L. Fullmer
    • J. Joaquin Garcia-Luna-AcevesDavid A. BeyerChane L. Fullmer
    • H04L1243
    • H04W74/04H04L45/02H04L45/44
    • Scheduling packets are exchanged among neighboring nodes of a computer network. These scheduling packets include descriptions of a transmitting node's 2-hop neighborhood within the computer network, and nodes are able to determine transmission schedules from information received via said scheduling packets. Preferably, the computer network is a synchronized network in which time is dived into a number of frames, each of which are made up of a plurality of slots. In such cases, the exchange of scheduling packets should occur within a first number of the slots of each frame, preferably in a common communication channel. Transmission schedules may be determined, at least in part, because nodes advertise their availability using the scheduling packets. The above-mentioned descriptions may include an identification of received communication times and/or channels, an identification of requested communication times and/or channels and an identification of available communication times and/or channels. The requested communication times and/or channels should correspond to available times and/or channels advertised by one or more nodes of the computer network. In this scheme, the identification of reserved communication times and/or channels should be made after eliminating any conflicting scheduled transmissions for those communication times and/or channels.
    • 计算分组在计算机网络的相邻节点之间交换。 这些调度分组包括计算机网络内的发射节点的2跳邻域的描述,并且节点能够根据经由所述调度分组接收到的信息来确定传输调度。 优选地,计算机网络是同步网络,其中时间被划分成多个帧,每个帧由多个时隙组成。 在这种情况下,调度分组的交换应当出现在每个帧的第一数量的时隙内,优选地在公共通信信道中。 至少部分地可以确定传输调度,因为节点使用调度分组来通告其可用性。 上述描述可以包括接收到的通信时间和/或信道的标识,所请求的通信时间和/或信道的标识以及可用的通信时间和/或信道的标识。 所请求的通信时间和/或频道应对应于计算机网络的一个或多个节点所通告的可用时间和/或频道。 在该方案中,在消除用于那些通信时间和/或频道的任何冲突的调度传输之后,应该进行保留的通信时间和/或频道的识别。
    • 3. 发明授权
    • Adaptive communication protocol for wireless networks
    • 无线网络的自适应通信协议
    • US07184413B2
    • 2007-02-27
    • US09248738
    • 1999-02-10
    • David A. BeyerJ. Joaquin Garcia-Luna-AcevesChane L. Fullmer
    • David A. BeyerJ. Joaquin Garcia-Luna-AcevesChane L. Fullmer
    • H04L12/28H04J3/02H04J3/06H04Q7/24
    • H04W72/1278H04J3/0667H04W72/1247H04W84/18
    • A communication protocol that provides link-level and media access control (MAC) level functions for wireless (e.g., ad-hoc) networks and is robust to mobility or other dynamics, and for scaling to dense networks. In a mobile or otherwise dynamic network, any control-packet collisions will be only temporary and fair. In a dense network, the network performance degrades gracefully, ensuring that only a certain percentage of the common channel is consumed with control packets. The integrated protocol allows packets (e.g., data scheduling control packets) to be scheduled in a collision-free and predictable manner (known to all neighbors), multicast packets can be reliably scheduled, as well as streams of delay- or delay-jitter-sensitive traffic. Further, using an optional network code, the scheduling of control packets can appear to observers to be randomized.
    • 提供无线(例如,ad-hoc)网络的链路级和媒体访问控制(MAC)级功能的通信协议,并且对于移动性或其他动态性以及对于缩放到密集网络是鲁棒的。 在移动或其他动态网络中,任何控制包冲突将是暂时的和公平的。 在一个密集的网络中,网络性能正常降级,确保只有一定百分比的公共信道与控制数据包一起消耗。 集成协议允许以无碰撞和可预测的方式(所有邻居都知道)调度分组(例如,数据调度控制分组),可以可靠地调度多播分组,以及延迟或延迟抖动流, 敏感的流量。 此外,使用可选的网络代码,控制分组的调度对观察者来说可以随机化。
    • 4. 发明授权
    • System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
    • 用于通信标记的路由树以在无线计算机网络中建立具有本地标识符的首选路径和源路由的系统
    • US06836463B2
    • 2004-12-28
    • US09418700
    • 1999-10-15
    • J. Joaquin Garcia-Luna-AcevesMarcelo SpohnDavid A. Beyer
    • J. Joaquin Garcia-Luna-AcevesMarcelo SpohnDavid A. Beyer
    • G01R3108
    • H04L45/02H04L45/48H04W8/24H04W8/26H04W28/18H04W76/10
    • One or more labeled routing trees (LRTS) are produced at a router of a computer network according to a shortest path determination made over a partial topology graph of the network, which graph is produced according to knowledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to which the identifiers pertain, and node parameters of a tail of the link to which the local link identifiers pertain. The routing state update messages may be transmitted within the network: (i) in response to a new destination node being detected by an existing node within the network, (ii) in response to a destination becoming unreachable by a collection of the existing nodes, (iii) in response to the change in the cost of a path to at least one destination exceeding a threshold and/or (iv) in situations where a routing loop may be encountered among two or more of the nodes of the network (e.g., at times when a path implied in the LRT of the router leads to a loop).
    • 根据对网络的部分拓扑图做出的最短路径确定,在计算机网络的路由器处产生一个或多个标记的路由树(LRTS),该路由树根据路由器的相邻链路的知识产生该图, 相邻路由器的更多LRT。 可以响应于路由状态更新消息的接收而更新路由器的LRT,并且这样的消息可以包括由标识符所属的链路的头部分配的本地链路标识符,以及链路的尾部的节点参数 本地链路标识符属于。 路由状态更新消息可以在网络内传输:(i)响应于由网络内的现有节点检测到的新的目的地节点,(ii)响应于目标变得不能通过现有节点的集合, (iii)响应于至少一个目的地超过阈值的路径的成本变化和/或(iv)在网络的两个或多个节点之间可能遇到路由环路的情况下(例如, 在路由器的LRT中隐含的路径导致循环的时候)。
    • 5. 发明授权
    • Unified routing scheme for ad-hoc internetworking
    • 用于特网互联的统一路由方案
    • US07159035B2
    • 2007-01-02
    • US10256168
    • 2002-09-25
    • J Joaquin Garcia-Luna-AcevesDavid A. BeyerThane J. Frivold
    • J Joaquin Garcia-Luna-AcevesDavid A. BeyerThane J. Frivold
    • G06F15/16
    • H04W40/02H04L45/02H04L45/12H04L45/54H04W40/08H04W40/12H04W40/248H04W40/28Y02D70/142Y02D70/22Y02D70/30Y02D70/324Y02D70/34
    • Routing table update messages that include both network-level and link-level addresses of nodes of a computer network are exchanged among the nodes of the computer network. Further, a routing table maintained by a first one of the nodes of the computer network may be updated in response to receiving one or more of the update messages. The routing table is preferably updated by selecting a next node to a destination node of the computer network only if every intermediate node in a path from the next node to the destination node satisfies a set of nodal conditions required by the first node for its path to the destination node and the next node offers the shortest distance to the destination node and to every intermediate node along the path from the next node to the destination node. The shortest distance to the destination node may be determined according to one or more link-state and/or node-state metrics regarding communication links and nodes along the path to the destination node. Also, the nodal characteristics of the nodes of the computer system may be exchanged between neighbor nodes, prior to updating the routing table. Preferred paths to one or more destination nodes may be computed according to these nodal characteristics, for example using a Dijkstra shortest-path algorithm.
    • 包括计算机网络节点的网络级和链路级地址的路由表更新消息在计算机网络的节点之间交换。 此外,响应于接收到一个或多个更新消息,可以更新由计算机网络的第一个节点维护的路由表。 优选地,通过仅当从下一个节点到目的地节点的路径中的每个中间节点满足第一节点所需的节点条件以使其路由到达时,才通过选择到计算机网络的目的地节点的下一个节点来更新路由表 目的地节点和下一个节点提供到目的地节点和沿着从下一个节点到目的地节点的路径的每个中间节点的最短距离。 可以根据关于沿着到目的地节点的路径的通信链路和节点的一个或多个链路状态和/或节点状态度量来确定到目的地节点的最短距离。 此外,在更新路由表之前,可以在相邻节点之间交换计算机系统的节点的节点特征。 可以根据这些节点特征来计算到一个或多个目的地节点的优选路径,例如使用Dijkstra最短路径算法。
    • 6. 发明授权
    • System for routing and switching in computer networks
    • 用于计算机网络中路由和切换的系统
    • US06683865B1
    • 2004-01-27
    • US09418898
    • 1999-10-15
    • J. Joaquin Garcia-Luna-AcevesDavid A. BeyerThane J. Frivold
    • J. Joaquin Garcia-Luna-AcevesDavid A. BeyerThane J. Frivold
    • H04L1256
    • H04L45/00H04L45/566
    • A protocol for a computer network in which routing operation codes (ROCs) in headers of packets transmitted within the network specify to a receiving router which of a number of routing or switching methods to apply to forward associated packets. The packets may be forwarded in any of the following modes: (a) a broadcast mode, (b) a hop-by-hop mode based on receiving node address information, (c) a label swapping mode, (d) a source-switching mode, (e) a flow switching mode, or (f) a hop-by-hop mode based on sending mode address information. In the label swapping mode, packets are accepted by the receiving router if the packets include a media access control address of the receiving router, and packets are forwarded from the receiving router according to a switching table indexed by a media access control address of a transmitting router. In the source switching mode, the headers include source routes specified in terms of local link identifiers used by routers in the network. Also, receiving routers are identified using local link identifiers associated with communication links between a transmitting router and an intended receiving router.
    • 一种用于计算机网络的协议,其中在网络中发送的分组的报头中的路由操作码(ROC)向接收路由器指定用于转发相关分组的若干路由或切换方法中的哪一个。 可以以以下任何一种模式转发报文:(a)广播模式,(b)基于接收节点地址信息的逐跳模式,(c)标签交换模式,(d)源 - 切换模式,(e)流切换模式,或(f)基于发送模式地址信息的逐跳模式。 在标签交换模式中,如果分组包括接收路由器的媒体访问控制地址,则分组被接收路由器接受,并且分组根据由发送的媒体访问控制地址索引的切换表从接收路由器转发 路由器。 在源切换模式中,报头包括根据网络中的路由器使用的本地链路标识符指定的源路由。 此外,使用与发送路由器和预期接收路由器之间的通信链路相关联的本地链路标识符来识别接收路由器。