会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 56. 发明申请
    • Maximum transmission unit tuning mechanism for a real-time transport protocol stream
    • 用于实时传输协议流的最大传输单元调谐机制
    • US20070115963A1
    • 2007-05-24
    • US11284483
    • 2005-11-22
    • Sravan VadlakondaSon NguyenManjunath BangaloreVikram Khurana
    • Sravan VadlakondaSon NguyenManjunath BangaloreVikram Khurana
    • H04L12/56H04J3/24
    • H04L29/06027H04L47/2416H04L47/26H04L65/608H04L65/80
    • A Real-Time Protocol (RTP) source node of a network operates to send a first data packet of a first size to a destination node over a path of the network that includes a plurality of intermediate nodes, at least one of the intermediate nodes having a maximum transmission unit (MTU) size smaller than the first size such that fragmentation of the first data packet occurs. The destination node sends back to the source node a RTCP report that includes a number of fragments received and a largest minimum data packet size. In response, the source node sends subsequent data packets having a second size less than or equal to the largest data packet size of the fragments. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. 37 CFR 1.72(b).
    • 网络的实时协议(RTP)源节点操作以通过包括多个中间节点的网络的路径向目的地节点发送第一大小的第一数据分组,至少一个中间节点具有 最小传输单元(MTU)的大小小于第一大小,使得第一数据分组的碎片发生。 目的地节点向源节点发送包含接收到的片段数和最大最小数据包大小的RTCP报告。 作为响应,源节点发送具有小于或等于片段的最大数据分组大小的第二大小的后续数据分组。 要强调的是,该摘要被提供以符合要求抽象的规则,允许搜索者或其他读者快速确定技术公开内容的主题。 提交它的理解是,它不会用于解释或限制权利要求的范围或含义。 37 CFR 1.72(b)。
    • 57. 发明申请
    • System and method for automatic path generation in a computer network
    • 计算机网络中自动路径生成的系统和方法
    • US20060036762A1
    • 2006-02-16
    • US10917184
    • 2004-08-10
    • Sravan VadlakondaNaomi Ben-AyounKhanh Hoang
    • Sravan VadlakondaNaomi Ben-AyounKhanh Hoang
    • G06F15/173
    • H04L45/02H04L45/122H04L45/46
    • A method and a system optimize the performance of an automatic path generation algorithm on a computer network. The system may include routers in the computer network configured into regions according to geographical locations, with some routers being designated inter-region routers in each region. The inter-region routers may be organized to be interconnected in a highly redundant manner (e.g., a full mesh) to ensure connectivity among the regions. Within such a network, when a path is required between routers in different regions, a processor applies the automatic path generation algorithm to: (a) the network segment in the region of the source router to generate a first set of paths, (b) the network segment of the inter-region routers to generate a second set of paths; and (c) the network segment of the destination router to generate a third set of paths, These set of paths are then combined to provide a set of paths between the source and destination routers. In addition, each router within each region may be further assigned a numerical rank indicative of a distance between the router and an inter-region router within the same region. In such a system, when a path is required between routers of the same region, the automatic path generation algorithm may be applied on a network segment pruned to include only routers with within a certain range of ranks.
    • 一种方法和系统优化计算机网络上的自动路径生成算法的性能。 该系统可以包括计算机网络中根据地理位置被配置成区域的路由器,一些路由器是每个区域中指定的区域间路由器。 区域间路由器可以被组织为以非常冗余的方式(例如,全网格)互连,以确保区域之间的连接。 在这样的网络中,当在不同区域中的路由器之间需要路径时,处理器将自动路径生成算法应用于:(a)源路由器区域中的网段以生成第一组路径,(b) 所述区域间路由器的网段生成第二组路径; 并且(c)目的地路由器的网段以生成第三组路径,然后将这些路径组合以在源路由器和目的地路由器之间提供一组路径。 此外,每个区域内的每个路由器还可以分配指示路由器与同一区域内的区域间路由器之间的距离的数值。 在这样的系统中,当在相同区域的路由器之间需要路径时,可以将自动路径生成算法应用于修剪为只包括一定范围内的路由器的网段。