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

41. 发明申请

US20070297441A1 Method and Apparatus for Preventing Starvation in a Slotted Ring Data Communications Network 失效
标题翻译：用于在开槽环数据通信网络中预防饥饿的方法和装置
公开(公告)号：US20070297441A1
公开(公告)日：2007-12-27
申请号：US11426746
申请日：2006-06-27
申请人： Timothy Hume Heil , Michael Steven Siegel , Jeffrey R. Summers , Steven Paul VanderWiel
发明人： Timothy Hume Heil , Michael Steven Siegel , Jeffrey R. Summers , Steven Paul VanderWiel
IPC分类号： H04L12/43
CPC分类号： H04L12/4035 , H04L12/423
摘要： In a slotted ring network, a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.
摘要翻译：在时隙环网络中，节点可以用任何未预留的时隙发送不可更新的时隙预留。该预约限制其他节点在时隙中发送新的分组。当插槽返回环到保留节点时，插槽将可用。优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰预订。

42. 发明申请

US20070269482A1 Implants for the treatment of dopamine associated states 有权
标题翻译：用于治疗多巴胺相关状态的植入物
公开(公告)号：US20070269482A1
公开(公告)日：2007-11-22
申请号：US11784526
申请日：2007-04-06
申请人： Terri Sebree , Steven Siegel
发明人： Terri Sebree , Steven Siegel
IPC分类号： A61K31/498 , A61K31/48 , A61K31/473 , A61K31/404 , A61K31/137
CPC分类号： A61K9/0024 , A61K9/204 , A61K31/403 , A61K31/4045 , A61L27/18 , A61L27/34 , A61L27/54 , A61L31/06 , A61L31/10 , A61L31/148 , A61L31/16 , A61L2300/40 , C08L67/04
摘要： Biodegradable implants comprising dopamine modulating compounds are described.
摘要翻译：描述了包含多巴胺调节化合物的可生物降解植入物。

43. 发明申请

US20060153895A1 Drug-containing implants and methods of use thereof 有权
公开(公告)号：US20060153895A1
公开(公告)日：2006-07-13
申请号：US11183232
申请日：2005-07-18
申请人： Steven Siegel , Karen Winey
发明人： Steven Siegel , Karen Winey
IPC分类号： A61K31/60 , A61K31/573 , A61K31/549 , A61K31/519 , A61K31/445 , A61K31/192 , A61F2/00
CPC分类号： A61K47/34 , A61K9/0024 , A61K9/1647 , A61K9/204 , A61K9/7007 , A61K31/192 , A61K31/445 , A61K31/451 , A61K31/4515 , A61K31/517 , A61K31/519 , A61K31/549 , A61K31/573 , A61K31/60 , A61L27/58
摘要： The present invention provides implants comprising a therapeutic drug and a polymer containing polylactic acid (PLA) and optionally polyglycolic acid (PGA). The present invention also provides methods of maintaining a therapeutic level of a drug in a subject, releasing a therapeutic drug at a substantially linear rate, and treating schizophrenia and other diseases and disorders, utilizing implants of the present invention.

44. 发明授权

US06952424B1 Method and system for network processor scheduling outputs using queueing 失效
标题翻译：使用排队的网络处理器调度输出的方法和系统
公开(公告)号：US06952424B1
公开(公告)日：2005-10-04
申请号：US09548912
申请日：2000-04-13
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： H04L12/28 , H04L12/56 , H04L29/06
CPC分类号： H04L49/90
摘要： A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to stored priorities associated with the various sources of the information units. The priorities in the preferred embodiment include a low latency service, a minimum bandwidth, a weighted fair queueing and a system for preventing a user from continuing to exceed his service levels over an extended period. The present invention includes a weighted fair queueing system where the position of the next service in a best efforts system for using bandwidth which is not used by committed bandwidth is determined based on the length of the frame and the weight of the particular flow. A “back pressure” system keeps a flow from being selected if its output cannot accept an additional frame because the current level of that port queue exceeds a threshold.
摘要翻译：一种将信息单元从网络处理器移动到数据传输网络的系统和方法，其以容纳几个不同级别的服务的优先顺序排列。本发明包括一种方法和系统，用于根据存储的与信息单元的各种源相关联的优先级来调度来自网络处理单元的处理的信息单元（或帧）的出口。优选实施例中的优先级包括低延迟服务，最小带宽，加权公平排队以及用于在较长时间内防止用户继续超过其服务水平的系统。本发明包括一个加权公平排队系统，其中基于帧的长度和特定流的权重确定用于使用未被承诺带宽使用的带宽的最佳努力系统中的下一个服务的位置。如果该端口队列的当前级别超过阈值，则“背压”系统的输出不能接受额外的帧，从而保持流量的选择。

45. 发明授权

US06947931B1 Longest prefix match (LPM) algorithm implementation for a network processor 失效
标题翻译：用于网络处理器的最长前缀匹配（LPM）算法实现
公开(公告)号：US06947931B1
公开(公告)日：2005-09-20
申请号：US09544992
申请日：2000-04-06
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Antonios Maragkos , Piyush Chunilal Patel , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Antonios Maragkos , Piyush Chunilal Patel , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30985 , H04L45/7457 , Y10S707/99931 , Y10S707/99933 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.
摘要翻译：当搜索具有可变长度模式或前缀的表时，用于查找最长前缀的新型数据结构，方法和装置匹配搜索。要找到完全匹配或最匹配的前缀，模式必须一次比较一下，直到发现确切或第一个匹配。这需要“n”个比较或存储器访问来识别最接近的匹配模式。树的建立方式使得匹配结果保证是最佳匹配，无论是完全匹配还是最长匹配前缀。使用所有鸟的踪迹和相关的前缀长度可以确定路线中正确的前缀结果。通过构建，搜索树在步道或树的步行期间在第一次比较之前或之后提供最佳的匹配前缀。

46. 发明授权

US06868082B1 Network processor interface for building scalable switching systems 失效
标题翻译：用于构建可扩展交换系统的网络处理器接口
公开(公告)号：US06868082B1
公开(公告)日：2005-03-15
申请号：US09385603
申请日：1999-08-30
申请人： James Johnson Allen, Jr. , Brian Mitchell Bass , Jean Louis Calvignac , Santosh Prasad Gaur , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： James Johnson Allen, Jr. , Brian Mitchell Bass , Jean Louis Calvignac , Santosh Prasad Gaur , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： G06F13/28 , G06F13/40 , H04L12/28
CPC分类号： G06F13/4022
摘要： A network apparatus comprising storage units storing configuration information about the network apparatus, an input network interface to at least one network physical line, at least one processor receiving network data from said network interface, processing said data, storing information about said network data in said storage units, storing said data as formatted data units in said storage units, a first bus interface to two bus connections, a first hardware component reading said configuration information and said information about data stored in said storing units and steering said formatted data units stored in said storage units to at least one of the two bus connections of said first bus interface, a second bus interface to two bus connections, an output network interface to at least one network physical line, a second hardware component reading formatted data units arriving on at least one of the two bus connections of said second bus interface and storing said formatted data units in said storage units, said at least one processor reading said formatted data units from said storage units, processing them and sending them as network data to at least one network physical line through said output network interface. On the basis of this network processor, it is possible to build switching systems by adding one network processor and at least one switch; it is also possible to build double density blades attached to two redundant switch fabrics which can also be accessed concurrently.
摘要翻译：一种网络装置，包括存储关于网络装置的配置信息的存储单元，至少一个网络物理线路的输入网络接口，至少一个处理器，从所述网络接口接收网络数据，处理所述数据，将关于所述网络数据的信息存储在所述存储单元，将所述数据作为格式化数据单元存储在所述存储单元中，到两个总线连接的第一总线接口，读取所述配置信息的第一硬件组件和关于存储在所述存储单元中的数据的所述信息，以及控制所存储的所述格式化数据单元所述存储单元到所述第一总线接口的两个总线连接中的至少一个，到两个总线连接的第二总线接口，到至少一个网络物理线的输出网络接口，第二硬件组件读取到达所述第二总线接口的两个总线连接中的至少一个，并存储所述格式化的数据所述至少一个处理器从所述存储单元读取所述格式化的数据单元，处理它们并通过所述输出网络接口将它们作为网络数据发送到至少一个网络物理线路。在该网络处理器的基础上，可以通过添加一个网络处理器和至少一个交换机构建交换系统; 也可以构建连接到两个冗余交换结构的双密度刀片，这两个冗余交换机也可以同时访问。

47. 发明授权

US06842443B2 Network switch using network processor and methods 失效
标题翻译：网络交换机采用网络处理器和方法
公开(公告)号：US06842443B2
公开(公告)日：2005-01-11
申请号：US10002932
申请日：2001-10-23
申请人： James Johnson Allen, Jr. , Brian Mitchell Bass , Jean Louis Calvignac , Santosh Prasad Gaur , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： James Johnson Allen, Jr. , Brian Mitchell Bass , Jean Louis Calvignac , Santosh Prasad Gaur , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： G06F15/16 , G06F15/177 , H04L12/56 , H04Q3/00 , H04Q3/545 , H04L12/28 , H04B7/216
CPC分类号： H04Q3/002 , H04L45/742 , H04L49/254 , H04L49/351 , H04L49/354 , H04L49/602 , H04L2212/00 , H04Q3/5455 , H04Q2213/1302 , H04Q2213/13034 , H04Q2213/1304 , H04Q2213/13103 , H04Q2213/13104 , H04Q2213/13106 , H04Q2213/13107 , H04Q2213/13322
摘要： A network switch apparatus, components for such an apparatus, and methods of operating such an apparatus in which data flow handling and flexibility is enhanced by the cooperation among a plurality of interface processors and a suite of peripheral elements formed on a semiconductor substrate. The interface processors and peripherals together form a network processor capable of cooperating with other elements including an optional switching fabric device in executing instructions directing the flow of data in a network.
摘要翻译：一种网络交换设备，用于这种设备的部件，以及操作这样一种设备的方法，其中通过多个接口处理器和形成在半导体衬底上的一组外围元件之间的协作来增强数据流处理和灵活性。接口处理器和外围设备一起形成一个网络处理器，能够在执行指导网络中的数据流的指令的情况下与包括可选的交换结构设备在内的其他元件进行协作。

48. 发明授权

US06804249B1 Method and system for network processor scheduling based on calculation 失效
标题翻译：基于计算的网络处理器调度方法与系统
公开(公告)号：US06804249B1
公开(公告)日：2004-10-12
申请号：US09548911
申请日：2000-04-13
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： H04L1256
CPC分类号： H04L47/28 , H04L45/02 , H04L47/2441 , H04L47/50 , H04L2012/5681
摘要： A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to service based on minimum bandwidth specifications where position in the queue is adjusted after each service based on minimum bandwidth specificaiton and the length of frame, a process which is subject to rounding errors. To avoid the accumulation of rounding errors inequitably influencing the position of some in the queue, a system to adjust for the rounding errors adds an increased measure of fairness to the system.
摘要翻译：一种将信息单元从网络处理器移动到数据传输网络的系统和方法，其以容纳几个不同级别的服务的优先顺序排列。本发明包括一种方法和系统，用于基于最小带宽规范来调度来自网络处理单元的处理的信息单元（或帧）的处理的信息单元（或帧），其中基于最小带宽规定在每个服务之后调整队列中的位置，并且帧的长度，一个进行舍入误差的过程。为了避免累积误差不均衡地影响队列中某些队员的位置，调整舍入误差的系统增加了系统的公平性。

49. 发明授权

US06769033B1 Network processor processing complex and methods 失效
标题翻译：网络处理器处理复杂和方法
公开(公告)号：US06769033B1
公开(公告)日：2004-07-27
申请号：US09384691
申请日：1999-08-27
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Anthony Matteo Gallo , Marco C. Heddes , Ross Boyd Leavens , Piyush Chunilal Patel , Mark Anthony Rinaldi , Michael Steven Siegel , Fabrice Jean Verplanken
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Anthony Matteo Gallo , Marco C. Heddes , Ross Boyd Leavens , Piyush Chunilal Patel , Mark Anthony Rinaldi , Michael Steven Siegel , Fabrice Jean Verplanken
IPC分类号： G06F900
CPC分类号： H04L49/602 , G06F15/80 , H04L49/351
摘要： A network processor useful in network switch apparatus and methods of operating such a processor in which data flow handling and flexibility is enhanced by the cooperation of an embedded processor complex with a suite of peripherals, all formed on a common semiconductor substrate. The interface processors provide data paths for inbound and outbound data flow and operate under the control of instructions stored in an instruction store formed on the semiconductor substrate, while storage of transiting data flow portions is provided by memory peripherals and interfaces to external memory elements.
摘要翻译：可用于网络交换设备的网络处理器和操作这样的处理器的方法，其中通过嵌入式处理器复合体与一组外围设备的协作来增强数据流处理和灵活性，这些外围设备都形成在公共半导体衬底上。接口处理器提供用于入站和出站数据流的数据路径，并且在存储在形成于半导体衬底上的指令存储器中的指令的控制下操作，同时由存储器外围设备和与外部存储器元件的接口提供过渡数据流部分的存储。

50. 发明授权

US06728253B1 Mixed queue scheduler 失效
标题翻译：混合队列调度程序
公开(公告)号：US06728253B1
公开(公告)日：2004-04-27
申请号：US09405691
申请日：1999-09-24
申请人： Clark Debs Jeffries , Marco C. Heddes , Mark Anthony Rinaldi , Michael Steven Siegel
发明人： Clark Debs Jeffries , Marco C. Heddes , Mark Anthony Rinaldi , Michael Steven Siegel
IPC分类号： H04L1256
CPC分类号： H04L47/50 , H04L2012/5682
摘要： A method and system are disclosed for allocating data input bandwidth from a source link to a plurality of N data queues each having a variable occupancy value, Qi(t), and a constant decrement rate, Di, where i designated the ith queue among the N queues. First, a threshold occupancy value, T, is designated for the N queues. During each time step of a repeating time interval, &Dgr;t, the occupancy value, Qi, is compared with T. In response to each and every of said N data queues having occupancy values exceeding T, pausing data transmission from the source link to the N data queues, such that overflow within the data queues is minimized. In response to at least one of the N data queues having an occupancy value less than or equal to T, selecting one among the N data queues to be incremented, and incrementing the selected data queue, such that underflow of the selected queue is minimized. In the context of scheduling one cell per time step, the value of T is one. Furthermore, the method of the present invention guarantees that output port occupancy shall never, in that context, exceed two cells.
摘要翻译：公开了一种用于将数据输入带宽从源链路分配给多个N个数据队列的方法和系统，每个N个数据队列具有可变占用值Qi（t）和常数递减率Di，其中i指定i < 排队N队列。首先，为N个队列指定阈值占有率T。在重复时间间隔的每个时间步长，Deltat，占用值Qi与T进行比较。响应于具有超过T的占用值的所述N个数据队列中的每一个，暂停从源链路到N的数据传输数据队列，使数据队列中的溢出最小化。响应于具有小于或等于T的占用值的N个数据队列中的至少一个，选择要增加的N个数据队列中的一个，并增加所选择的数据队列，使得所选队列的下溢最小化。在每个时间步长调度一个单元格的上下文中，T的值为1。此外，本发明的方法保证输出端口占用在这方面永远不超过两个小区。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式