专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06831893B1 Apparatus and method for wire-speed classification and pre-processing of data packets in a full duplex network 有权
标题翻译：全双工网络数据包线速分类和预处理的装置和方法
公开(公告)号：US06831893B1
公开(公告)日：2004-12-14
申请号：US09541598
申请日：2000-04-03
申请人： Michael Ben Nun , Sagi Ravid , Ofer Weil
发明人： Michael Ben Nun , Sagi Ravid , Ofer Weil
IPC分类号： G08C1500
CPC分类号： H04L45/583 , H04L29/06 , H04L69/22
摘要： A network interface that processes data packets transmitted on a network is provided. The network interface includes a first data path, a second data path, a header processor, a classifier unit, and a plurality of packet processors. The first data path unit inputs downstream data packets transmitted downstream on the network, and the second data path unit inputs upstream data packets transmitted upstream on the network. The header processor inputs data packet headers of the downstream and upstream data packets from the first and second data path units and classifies the downstream and upstream data packets by comparing the headers with predetermined rules. The classifier unit also inputs the data packet headers from the first and second data path units and evaluates the headers determine flows corresponding to the downstream and upstream data packets. The classifier unit selects a first packet processor to process both the downstream and upstream data packets corresponding to a first flow and instructs the first and second data path units to output the data packets, which correspond to the first flow, to the first packet processor. Similarly, the classifier unit selects a second packet processor to process both the downstream and upstream data packets corresponding to a second flow and instructs the first and second data path units to output the data packets, which correspond to the second flow, to the second packet processor. The classifier is further capable of balancing loads between the packet processors based on the effective load on each such packet processor.
摘要翻译：提供了处理在网络上发送的数据分组的网络接口。网络接口包括第一数据路径，第二数据路径，报头处理器，分类单元和多个分组处理器。第一数据路径单元输入在网络上向下游发送的下行数据分组，第二数据路径单元输入在网络上向上游发送的上行数据分组。标题处理器输入来自第一和第二数据路径单元的下游和上游数据分组的数据分组报头，并通过将报头与预定规则进行比较来对下游和上游数据分组进行分类。分类器单元还从第一和第二数据路径单元输入数据分组报头，并且评估报头确定与下游和上游数据分组相对应的流。分类器单元选择第一分组处理器来处理对应于第一流的下游和上游数据分组，并且指示第一和第二数据路径单元将与第一流对应的数据分组输出到第一分组处理器。类似地，分类器单元选择第二分组处理器来处理与第二流对应的下游和上游数据分组，并且指示第一和第二数据路径单元将与第二流对应的数据分组输出到第二分组处理器。分类器还能够基于每个这样的分组处理器上的有效负载平衡分组处理器之间的负载。

2. 发明授权

US06744376B1 Remote input/output (RIO) smart sensor analog-digital chip 失效
标题翻译：远程输入/输出（RIO）智能传感器模拟数字芯片
公开(公告)号：US06744376B1
公开(公告)日：2004-06-01
申请号：US09383911
申请日：1999-08-26
申请人： Nikolaos P. Pascalidis
发明人： Nikolaos P. Pascalidis
IPC分类号： G08C1500
CPC分类号： G08C15/00
摘要： An analog-digital, radiation-hardened, low-power Smart Sensor Data Acquisition and Control chip, specifically designed and developed for Spacecraft/Instrument Housekeeping and Controls. Sensor data (Temperatures, Voltages, Currents, Pressure, Digitals) are continuously measured, digitized, stored, and transmitted, and Control Actions (DACS, Timers, Digitals) are activated, through a standard bi-directional, digital serial bus (I2C). The chip also offers a Custom or Standard (like PCI) parallel bus interface for parallel readout internally communicating to the serial bus. The chip essentially eliminates spacecraft harness, and greatly simplifies system design.
摘要翻译：模拟数字，辐射硬化，低功耗智能传感器数据采集和控制芯片，专为航天器/仪器管家和控制设计和开发。传感器数据（温度，电压，电流，压力，数字）被连续测量，数字化，存储和传输，通过标准的双向数字串行总线（I < 2> C）。该芯片还提供定制或标准（如PCI）并行总线接口，用于并行读取，内部与串行总线进行通信。该芯片基本上消除了航天器线束，大大简化了系统设计。

3. 依法登记的发明

USH2103H1 Packet scheduling based on message length 有权
公开(公告)号：USH2103H1
公开(公告)日：2004-05-04
申请号：US09389744
申请日：1999-09-07
申请人： Eytan Modiano
发明人： Eytan Modiano
IPC分类号： G08C1500
摘要： A system using two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message to which the package belongs. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to the First-Come-First-Serve scheduling.

4. 发明授权

US06646989B1 Hop-by-hop routing with node-dependent topology information 有权
标题翻译：具有节点依赖拓扑信息的逐跳路由
公开(公告)号：US06646989B1
公开(公告)日：2003-11-11
申请号：US09273434
申请日：1999-03-20
申请人： Dennis Andreyevich Khotimsky , Vincent Georges Pierre Fayet , Antoni Bronislaw Przygienda
发明人： Dennis Andreyevich Khotimsky , Vincent Georges Pierre Fayet , Antoni Bronislaw Przygienda
IPC分类号： G08C1500
CPC分类号： H04L45/12
摘要： This invention relates to a method to effect hop-by-hop routing in a network segment where different nodes have different views of the network topology. In particular, the methods of this invention are applicable when each node in a network or network segment may be aware of only a subset of the communication links in the network, without perceiving other communication links. Based on each node's individual view of the network, the method introduces the concept of a visibility set that includes all visible communication links. More specifically, an efficient algorithm is disclosed for searching for a family of one-to-all optimal feasible paths in communication network where different nodes may have different views of the network topology. The algorithm comprises (a) restricting the set of available paths to a destination node to the set of feasible paths from the source node to the destination node; and choosing as the optimal route the feasible path which has the lowest cost, wherein a path is a feasible path if (i) the path does not contain a cycle, and (ii) for each intermediate node visited by the path, the subpath from that intermediate node to the destination node is visible from the intermediate node.
摘要翻译：本发明涉及一种在不同节点具有不同网络拓扑视图的网段中实现逐跳路由的方法。特别地，本发明的方法适用于网络或网段中的每个节点只能知道网络中的通信链路的子集，而不会感知到其他通信链路。基于每个节点对网络的单独视图，该方法引入了包括所有可见通信链路的可见性集合的概念。更具体地，公开了一种用于在通信网络中搜索一对一最佳可行路径的系列的有效算法，其中不同节点可以具有不同的网络拓扑的视图。该算法包括（a）将来自目的地节点的可用路径集合限制到从源节点到目的地节点的可行路径集合; 并且选择具有最低成本的可行路径作为最佳路径，其中如果（i）路径不包含循环，则路径是可行路径，并且（ii）对于由路径访问的每个中间节点，子路径从中间节点到目标节点的中间节点是可见的。

5. 发明授权

US06813243B1 High-speed hardware implementation of red congestion control algorithm 有权
标题翻译：高速硬件实现红拥塞控制算法
公开(公告)号：US06813243B1
公开(公告)日：2004-11-02
申请号：US09504479
申请日：2000-02-14
申请人： Garry P. Epps , Michael Laor
发明人： Garry P. Epps , Michael Laor
IPC分类号： G08C1500
CPC分类号： H04L47/10 , H04L47/326 , H04L49/205 , H04L49/30 , H04L49/9078
摘要： A pipelined linecard architecture for receiving, modifying, switching, buffering, queuing and dequeuing packets for transmission in a communications network. The linecard has two paths: the receive path, which carries packets into the switch device from the network, and the transmit path, which carries packets from the switch to the network. In the receive path, received packets are processed and switched in an asynchronous, multi-stage pipeline utilizing programmable data structures for fast table lookup and linked list traversal. The pipelined switch operates on several packets in parallel while determining each packet's routing destination. Once that determination is made, each packet is modified to contain new routing information as well as additional header data to help speed it through the switch. Each packet is then buffered and enqueued for transmission over the switching fabric to the linecard attached to the proper destination port. The destination linecard may be the same physical linecard as that receiving the inbound packet or a different physical linecard. The transmit path consists of a buffer/queuing circuit similar to that used in the receive path. Both enqueuing and dequeuing of packets is accomplished using CoS-based decision making apparatus and congestion avoidance and dequeue management hardware. The architecture of the present invention has the advantages of high throughput and the ability to rapidly implement new features and capabilities.
摘要翻译：用于接收，修改，切换，缓冲，排队和排队数据包以在通信网络中传输的流水线线卡架构。线路卡具有两条路径：从网络将数据包传送到交换机设备的接收路径，以及将交换机传送到网络的数据包的发送路径。在接收路径中，使用可编程数据结构在快速表查找和链表遍历中，在异步多级流水线中处理和切换接收的分组。流水线交换机在确定每个数据包的路由目的地时并行操作多个数据包。一旦进行了确定，每个数据包被修改为包含新的路由信息以及额外的标题数据，以帮助通过交换机加速速度。然后每个数据包被缓冲并排入队列，以便通过交换结构传输到连接到正确目标端口的线卡。目的线路卡可能与接收入站分组或不同物理线卡一样的物理线卡。发送路径由与接收路径中使用的类似的缓冲器/排队电路组成。使用基于CoS的决策设备和拥塞避免和出队管理硬件来实现分组的入队和出队。本发明的架构具有高吞吐量和快速实现新特征和能力的能力的优点。

6. 发明授权

US06801502B1 Method and apparatus for load-sensitive routing of long-lived packet flows 有权
标题翻译：长寿命包流的负载敏感路由方法和装置
公开(公告)号：US06801502B1
公开(公告)日：2004-10-05
申请号：US09566561
申请日：2000-05-08
申请人： Jennifer Lynn Rexford , Anees Shaikh
发明人： Jennifer Lynn Rexford , Anees Shaikh
IPC分类号： G08C1500
CPC分类号： H04L45/28 , H04L45/00 , H04L45/22 , H04L45/302 , H04L45/38 , H04L45/50
摘要： The present invention builds on the implications of variability in flow durations on the stability of load-sensitive routing. In accordance with an embodiment of the present invention, long-lived flows of packets are routed dynamically while short-lived flows are forwarded on pre-provisioned static paths. This hybrid approach can exploit flow-classification hardware at the edge of backbone networks and known techniques for flow-pinning, as well as basic insights from earlier work on QoS routing. This approach of separating short-lived and long-lived flows can dramatically improve the stability of dynamic routing.
摘要翻译：本发明基于对流量持续时间的变化对负载敏感路由的稳定性的影响。根据本发明的实施例，长时间流分组被动态路由，而短期流在预先设置的静态路径上转发。这种混合方法可以利用骨干网边缘的流分类硬件，以及用于流钉的已知技术，以及早期QoS路由工作的基本见解。分离短寿命和长寿命流的这种方法可以显着提高动态路由的稳定性。

7. 发明授权

US06735170B1 Method and system for establishing content-flexible connections in a communications network 失效
标题翻译：在通信网络中建立内容灵活连接的方法和系统
公开(公告)号：US06735170B1
公开(公告)日：2004-05-11
申请号：US09539707
申请日：2000-03-31
申请人： Kim B. Roberts
发明人： Kim B. Roberts
IPC分类号： G08C1500
CPC分类号： H04Q11/0478 , H04J3/1611 , H04J2203/0066 , H04J2203/0067
摘要： A method for establishing connections along a network route, including determining a capacity and a set of concatenation constraints, and allocating selected resources along the route to allow the delivery of any combination of signals satisfying the set of concatenation constraints and having a total capacity not exceeding the determined capacity. Also disclosed is a method of establishing at least one higher layer connection (HLC) within a lower layer connection (LLC), including determining a first capacity and a first set of concatenation constraints associated with the LLC; establishing the LLC by allocating selected resources along the route to allow the delivery of any combination of signals satisfying the first set of concatenation constraints and having a total capacity not exceeding the first capacity; and, for each HLC, using a respective subset of the allocated resources to carry a respective combination of signals satisfying a respective set of second concatenation constraints which is a subset of the first set of concatenation constraints.
摘要翻译：一种用于沿着网络路由建立连接的方法，包括确定容量和一组级联约束，以及沿着所述路由分配所选择的资源，以允许传送满足所述级联约束集合的任何信号组合，并且总容量不超过确定的能力。还公开了一种在下层连接（LLC）内建立至少一个较高层连接（HLC）的方法，包括确定与LLC相关联的第一容量和第一组级联约束; 通过沿路由分配选择的资源来建立LLC，以允许传递满足第一组级联约束的信号的任何组合，并且具有不超过第一容量的总容量; 并且对于每个HLC，使用分配的资源的相应子集来承载满足作为第一组级联约束集合的子集的相应组的第二级联约束的信号的相应组合。

8. 发明授权

US06680908B1 Network switch including bandwidth allocation controller 失效
标题翻译：网络交换机包括带宽分配控制器
公开(公告)号：US06680908B1
公开(公告)日：2004-01-20
申请号：US09416939
申请日：1999-10-13
申请人： Patrick Gibson , Kam Choi , Christopher Hay , Gareth E Allwright
发明人： Patrick Gibson , Kam Choi , Christopher Hay , Gareth E Allwright
IPC分类号： G08C1500
CPC分类号： H04L47/10 , H04L47/20 , H04L47/2441 , H04L47/30 , H04L47/32 , H04L49/205 , H04L49/3027 , H04L49/351
摘要： A network switch includes a plurality of receive ports for receiving addressed data packets and a plurality of transmit ports for forwarding the addressed data packets and structure responsive to data in said the packets for directing received packets to the transmit ports. In respect of at least one of the transmit ports the switch includes an output buffer for storing data packets before they are forwarded from the port and an allocation controller. The allocation controller allocates each packet destined for the buffer and each packet leaving the buffer for the port into at least one of a plurality of categories, which may be based on priority or protocol data and may define traffic types such as video or audio. For each of the categories there is an allocation register for defining a respective selected proportion of the memory space of the output buffer and structure for accumulating a running total of packet sizes, the total being reduced by the size of each packet in the respective category and leaving the buffer for the port. A packet is discarded when the running total of packet sizes for packets of the same category exceeds the respective proportion of the memory space defined in the respective allocation register. The organization of the switch allows the allocation of a minimum bandwidth for each of the categories.
摘要翻译：网络交换机包括用于接收寻址数据分组的多个接收端口和用于响应于所述分组中的数据转发所寻址的数据分组和结构的多个发送端口，用于将接收的分组引导到发送端口。关于发送端口中的至少一个，交换机包括用于在从端口转发它们之前存储数据分组的输出缓冲器和分配控制器。分配控制器分配目的地为缓冲区的每个分组和离开该端口的缓冲区的每个分组到多个类别中的至少一个，其可以基于优先级或协议数据，并且可以定义诸如视频或音频的业务类型。对于每个类别，存在用于定义输出缓冲器的存储器空间的相应选择比例的分配寄存器和用于累积运行的分组大小的总和的结构，总共减少相应类别中的每个分组的大小，为该端口留下缓冲区。当相同类别的分组的分组大小的运行总计超过在相应分配寄存器中定义的存储器空间的相应比例时，丢弃分组。交换机的组织允许为每个类别分配最小带宽。

9. 发明授权

US06657963B1 Method and apparatus for controlling data congestion in a frame relay/ATM internetworking system 有权
标题翻译：用于控制帧中继/ ATM互联系统中的数据拥塞的方法和装置
公开(公告)号：US06657963B1
公开(公告)日：2003-12-02
申请号：US09364158
申请日：1999-07-30
申请人： Andre′ Paquette , Anthony J. Dilliott , Alexander S. Bruce
发明人： Andre′ Paquette , Anthony J. Dilliott , Alexander S. Bruce
IPC分类号： G08C1500
CPC分类号： H04L12/5601 , H04L2012/5618 , H04L2012/5635 , H04L2012/5636 , H04L2012/567
摘要： A method and apparatus for controlling data congestion in a frame relay/ATM internetworking system is presented. In one embodiment, received frame relay frames are monitored in an internetworking switch to detect an indication, of congestion. When an indication of congestion is detected, the egress traffic provided to the source of the congestion indication is reduced, which may lead to local congestion in the internetworking switch. When congestion within the internetworking switch has arisen and a resource management cell is received along an ATM ingress path, an ATM, backward resource management cell is generated having a set congestion indication bit that informs additional ATM nodes of the congestion. In another embodiment, ATM cells are received in an internetworking switch and monitored to detect an indication of congestion. When an indication of congestion is detected, egress traffic is reduced to the source of the indication, and when local congestion results in the internetworking switch as a result, a subsequent frame relay frame is generated that includes a backward explicit congestion notification (BECN) indication. The set BECN indication informs additional frame relay portions of the network of the congestion indication relayed by the ATM cells.
摘要翻译：提出了一种用于控制帧中继/ ATM网络间系统中的数据拥塞的方法和装置。在一个实施例中，在互联交换机中监视接收到的帧中继帧以检测拥塞的指示。当检测到拥塞的指示时，提供给拥塞指示源的出口业务被减少，这可能导致网际交换机中的局部拥塞。当网络互联交换机中出现拥塞并且沿着ATM入口路径接收资源管理小区时，生成具有通知附加ATM节点拥塞的设置拥塞指示比特的ATM后向资源管理小区。在另一个实施例中，ATM信元被接收在网际互联交换机中并被监控以检测拥塞的指示。当检测到拥塞的指示时，出口流量减少到指示的来源，并且当局部拥塞导致网际互联切换结果时，产生后续帧中继帧，其包括反向显式拥塞通知（BECN）指示。设置的BECN指示通知ATM信元中继的拥塞指示的网络的附加帧中继部分。

10. 发明授权

US06392994B1 ATM adaption layer traffic scheduling 有权
公开(公告)号：US06392994B1
公开(公告)日：2002-05-21
申请号：US09208982
申请日：1998-12-11
申请人： Ken Dubuc
发明人： Ken Dubuc
IPC分类号： G08C1500
CPC分类号： H04L12/5602 , H04L2012/5653 , H04L2012/5679 , H04Q11/0478
摘要： The ATM transmitting apparatus for transmitting messages, such as frame relay packets, associated with a plurality of connections comprises ATM layer transmission equipment for receiving multiple messages, segmenting each received message into a plurality of smaller data units, such as 48 byte AAL SAR protocol data units, and multiplexing such data units into a single stream for transport over a physical interface. A scheduler receives messages from each of the connections and transfers the messages to the transmission equipment. The scheduler can dynamically set a transmission rate for any connection, and allocates each connection whose message is transferred to the transmission equipment a substantially maximal amount of bandwidth at any given time during the transmission of the message, to thereby minimize interleaving of data units from the various connections and reduce the average latency (per unit of message) in transmitting the messages across a network.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式