会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Message based packet switch based on a common, generic bus medium for transport
    • 基于消息的分组交换机,基于通用的通用总线介质进行传输
    • US06643285B1
    • 2003-11-04
    • US09024243
    • 1998-02-17
    • John Edward VincentGeorge F. IrwinGary M. DepelteauTony HuangDavid A. FisherJames L. WatchornMelhem I. Chaar
    • John Edward VincentGeorge F. IrwinGary M. DepelteauTony HuangDavid A. FisherJames L. WatchornMelhem I. Chaar
    • H04L1256
    • H04L49/255H04L49/15H04L49/1553H04L49/30H04L49/503
    • A packet switch has a switching unit (SU) for switching packets between network links and a computing unit (CU) connected to the SU through a network link for implementing software control functions over the SU. The SU is formed of different functional components interconnected by generic buses. The components communicate with one another using program data units (PDUs) that are formatted and transmitted according to a shared device protocol. The communication between the components occurs by placing PDUs in bus frames that are passed from component to component. Information is exchanged between the components by adding information to or dropping information from the fields of the PDUs, or by concatenating new fields to the PDUs, as the frames pass from component to component. By using a generic bus to implement PDU-based interconnections within the SU, all the components are forced to support a common interface. Changes to the implementations of any component's interface can thus be accommodated by changing the PDU format as opposed to changing the interfaces of connected components. The new packet switch architecture decouples the components on the switch so that they can be upgraded or otherwise modified independently of one another.
    • 分组交换机具有用于在网络链路之间切换分组的交换单元(SU)和通过网络链路连接到SU的计算单元(CU),用于在SU上实现软件控制功能。 SU由通用总线互连的不同功能部件组成。 组件使用根据共享设备协议格式化和传输的程序数据单元(PDU)彼此通信。 通过将PDU放置在从组件传递到组件的总线框架中,可以实现组件之间的通信。 通过向PDU中的信息添加信息或从PDU的字段中删除信息,或者通过将新的字段连接到PDU来在组件之间交换信息,因为帧从组件传递到组件。 通过使用通用总线来实现SU内的基于PDU的互连,所有组件都被迫支持通用接口。 因此,可以通过改变PDU格式来改变任何组件接口的实现,而不是改变连接的组件的接口。 新的分组交换架构使交换机上的组件脱钩,以便它们可以彼此独立升级或以其他方式进行修改。
    • 2. 发明授权
    • Scheduling technique for delayed queue service
    • 延迟队列服务的调度技术
    • US06574230B1
    • 2003-06-03
    • US09215377
    • 1998-12-18
    • Abdulaziz S. AlmulhemJohn E. VincentGary M. Depelteau
    • Abdulaziz S. AlmulhemJohn E. VincentGary M. Depelteau
    • H04L1256
    • H04L47/50
    • A scheduling apparatus, that can be used within a supertrunking capable Internet Protocol (IP) Forwarding (IPF) node, allows for efficient scheduling of packets for servicing after the packets are sorted into their proper order. The scheduling apparatus has a point and serve mechanism, a round-robin mechanism, and a starvation mechanism, and is to be used in situations where an IPF node is sorting and outputting multiple numbers of data streams. The point and serve mechanism directs two supertrunk pointers to the front packets of the particular data streams that the incoming packet segments correspond. The round-robin mechanism rotates a round-robin pointer between the front packets corresponding to all the different data streams. The starvation mechanism flags a data stream as starving if no packets have been scheduled after a predetermined number of times in which the round-robin pointer has been directed at the particular stream. Since only a limited number of packets can be scheduled for servicing at a time and each packet is not necessarily ready to be scheduled, the scheduling apparatus prioritizes the scheduling of the packets. First attempting to schedule the front packets selected by the point and serve mechanism, then the starvation mechanism, and finally the round-robin mechanism.
    • 可以在具有超级能力的因特网协议(IP)转发(IPF)节点中使用的调度设备允许在分组被分类到其正确顺序之后对用于服务的分组的有效调度。 调度装置具有点和服务机制,循环机制和饥饿机制,并且在IPF节点排序并输出多个数据流的情况下使用。 点和服务机制将两个supertrunk指针指向进入的分组段对应的特定数据流的前端分组。 循环机制在对应于所有不同数据流的前端分组之间旋转循环指针。 如果循环指针已经被指向特定流的预定次数之后没有调度分组,则饥饿机制将数据流标记为饥饿。 由于只能一次调度有限数量的分组进行服务,并且每个分组不一定准备好被调度,所以调度装置优先处理分组的调度。 首先尝试安排由点和服务机制选择的前端包,然后是饥饿机制,最后是循环机制。