会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Enhancement of explicit congestion notification (ECN) for wireless network applications
    • 增强无线网络应用的显式拥塞通知(ECN)
    • US06741555B1
    • 2004-05-25
    • US09594463
    • 2000-06-14
    • Xiang LiJing WuShiduan ChengJian Ma
    • Xiang LiJing WuShiduan ChengJian Ma
    • H04L1226
    • H04W80/06H04L47/10H04L47/263H04L47/27H04L47/31H04L69/16H04L69/161H04L69/163
    • An Explicit Congestion Notification (ECN) method is disclosed for wireless applications to avoid network congestion in a TCP/IP packet-switched network. Such method comprises transmitting, at a source node, data packets to a destination node, via at least an intermediate node; determining, at the intermediate node, if an incipient congestion is encountered, setting a Congestion Experienced (CE) flag in each data packet to notify congestion; sending, at the destination node, an ECN-Echo acknowledgment packet back to the source node to inform congestion; reducing, at the source node, a congestion window and a transmission rate to avoid congestion; if the packet loss is due to congestion, re-transmitting, at the source node, only a lost packet to the destination node; alternatively, if the packet loss is due to transmission error, re-transmitting, the lost packet to the destination node, while increasing a round-trip timeout but maintaining the same congestion window.
    • 针对无线应用公开了一种显式拥塞通知(ECN)方法,以避免TCP / IP分组交换网络中的网络拥塞。 这种方法包括经由至少中间节点在源节点将数据分组发送到目的地节点; 在中间节点处确定是否遇到初始拥塞,在每个数据分组中设置拥塞经验(CE)标志以通知拥塞; 在目的地节点处将ECN-Echo确认分组发送回源节点以通知拥塞; 在源节点减少拥塞窗口和传输速率以避免拥塞; 如果分组丢失是由于拥塞,则在源节点处仅将丢失的分组重新发送到目的地节点; 或者,如果分组丢失是由于传输错误,则将丢失分组重新发送到目的地节点,同时增加往返超时但保持相同的拥塞窗口。
    • 6. 发明授权
    • Congestion control method for a packet-switched network
    • 分组交换网络的拥塞控制方法
    • US07369498B1
    • 2008-05-06
    • US10168009
    • 1999-12-13
    • Jian MaFei PengJing Wu
    • Jian MaFei PengJing Wu
    • G01R31/08H04L12/66G06F15/16
    • H04L69/16H04L47/10H04L47/193H04L47/26H04L47/29H04L47/30H04L67/28H04L67/2828H04L69/163
    • The present invention relates to a method and network for controlling congestion in a packet-switched network, comprising traffic sources, traffic destinations and network nodes, wherein a packet queue length in a network node is determined and a congestion notification is transmitted back towards the source address of an incoming data packet received at the network node, if the detected packet queue length exceeds a predetermined threshold. Then, congestion control is performed at a predetermined intermediate network node in response to the receipt of the congestion notification. Thereby, burts of source traffic can be constrained and unnecessary packet losses can be avoided already at an intermediate access node and within the network. The congestion notification message generated due to an incipient congestion is immediately routed back according to its source address. As a result, control delay time is shortened, such that buffer size requirements and number of congestion notification messages are reduced.
    • 本发明涉及一种用于控制分组交换网络中的拥塞的方法和网络,包括流量源,流量目的地和网络节点,其中,确定网络节点中的分组队列长度,并向源发送拥塞通知 如果检测到的分组队列长度超过预定阈值,则在网络节点处接收的输入数据分组的地址。 然后,响应于接收到拥塞通知,在预定的中间网络节点执行拥塞控制。 因此,可以限制源业务的激活,并且可以在中间接入节点和网络内避免不必要的分组丢失。 由于初始拥塞而产生的拥塞通知消息根据其源地址立即被路由回来。 结果,控制延迟时间缩短,使得缓冲器大小要求和拥堵通知消息数量减少。
    • 9. 发明申请
    • METHOD AND APPARATUS FOR DISTRIBUTING PUBLISHED MESSAGES
    • 分发出版信息的方法和装置
    • US20130198308A1
    • 2013-08-01
    • US13878789
    • 2010-10-29
    • Xiaogang YangJian MaCanfeng Chen
    • Xiaogang YangJian MaCanfeng Chen
    • H04L12/58
    • H04L51/14H04L45/306
    • A method for delivering published messages to subscribers comprises: —storing a set of subscriptions (F1_top1, F2_top3, F3_top4) in a routing table (RTO) of a first broker (BRO), —sending a set of messages (e1, e2, e3) from the first broker (BRO) to a second broker (BR1) according to at least one subscription (F1_top1) stored in the routing table (RTO)1—receiving a subsequent message (ek), —determining a search term (topi) based on a data element of the subsequent message (ek), —comparing the search term (topi) with a set of data elements stored in a relation repository (CRR), and—controlling sending of the subsequent message (ek) to the second broker (BR1) according to a result of said comparison, wherein the set of data elements stored in the relation repository (CRR) comprises data elements of the messages (e1, e2, e3) previously sent to the second broker (BR1), and wherein said set of subscriptions (F1_top1, F2_top3, F3_top4) contains at least one subscription (F3_top4), which specifies a topic (top4), which is not contained in the set of data elements stored in the relation repository (CRR).
    • 用于将已发布的消息递送给订户的方法包括: - 在第一代理(BRO)的路由表(RTO)中驻留一组订阅(F1_top1,F2_top3,F3_top4),发送一组消息(e1,e2,e3 )根据存储在路由表(RTO)1中的至少一个订阅(F1_top1)1从第一经纪人(BRO)到第二代理(BR1) - 接收后续消息(ek), - 确定搜索项(topi) 基于后续消息(ek)的数据元素, - 将搜索项(topi)与存储在关系库(CRR)中的一组数据元素进行比较,并且控制后续消息(ek)发送到第二个 代理(BR1),其中存储在关系库(CRR)中的数据元素组包括先前发送到第二代理(BR1)的消息(e1,e2,e3)的数据元素,以及 其中所述订阅集(F1_top1,F2_top3,F3_top4)包含至少一个订阅(F3_top4),该规范 ifies是一个主题(top4),它不包含在存储在关系库(CRR)中的数据元素集合中。