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

1. 发明授权

US06198725B1 Network element delay allocation for efficient use of network resources 失效
标题翻译：网元延迟分配，有效利用网络资源
公开(公告)号：US06198725B1
公开(公告)日：2001-03-06
申请号：US09270574
申请日：1999-03-16
申请人： Robert Constantin , David E. Hammond , David N. Peck , Salma Abu-Ayyash , Stephen R. Veit , Thomas A. Manning
发明人： Robert Constantin , David E. Hammond , David N. Peck , Salma Abu-Ayyash , Stephen R. Veit , Thomas A. Manning
IPC分类号： H04L1228
CPC分类号： H04L47/822 , H04L47/70 , H04L47/724 , H04L47/805 , H04L2012/5628 , H04L2012/5632 , H04L2012/5649 , H04Q11/0478
摘要： A system for allocating resources at network elements along a path through a communications network. Resources are allocated at a network element along the path in response to a connection request message. The delay budget is the minimum of a calculated cell transfer delay and a calculated cell delay variation. The calculated cell transfer delay is determined by finding a difference between a target end to end cell delay and an accumulated cell delay, and then dividing that difference by a number of network elements remaining in the path between the network element and the end of the path. To determine the calculated cell delay variation, the network element first finds a difference between the Max CDV QoS parameter and the sum of the accumulated cell delay variation and the switching delay for the network element. The calculated cell delay variation is then equal to that difference divided by the number of network elements remaining in the path between the network element and the end of the path. The target end to end cell delay is for example determined by the first network element in the path as equal to the Max CTD QoS parameter minus the end to end link propagation delay for the path and the link propagation delay for the incoming link to the first network element over which the message was received. The first network element generates and forwards a modified connection request message including the determined target end to end cell delay value, as well as a designated transit list indicating each network element in the prospective path, and including a current network element pointer.
摘要翻译：一种用于沿着通过通信网络的路径在网络元件处分配资源的系统。响应于连接请求消息，沿着路径的网元分配资源。延迟预算是计算的单元传输延迟和计算的单元延迟变化的最小值。通过找出目标端到端小区延迟与累积小区延迟之间的差异来确定计算的小区传输延迟，然后将该差除以剩余在网元和路径末端之间的路径中的网络元素数。为了确定计算的信元延迟变化，网络元件首先找到最大CDV QoS参数与累积的信元延迟变化和网络元件的切换延迟的总和之间的差。所计算的单元延迟变化然后等于该差值除以网络元件与路径末端之间的路径中剩余的网络元件的数量。目标端到端信元延迟例如由路径中的第一网络元素确定为等于Max CTD QoS参数减去路径的端到端链路传播延迟，以及到第一个到达第一个信元的传入链路的链路传播延迟接收消息的网络元素。第一网元生成并转发包括确定的目标端到端小区延迟值的修改的连接请求消息，以及指示预期路径中的每个网络元件的指定的转接列表，并且包括当前网络元素指针。

2. 发明授权

US06483807B1 Distributed control of service category request mapping 失效
标题翻译：分布式控制服务类别请求映射
公开(公告)号：US06483807B1
公开(公告)日：2002-11-19
申请号：US09270580
申请日：1999-03-16
申请人： Thomas A. Manning , David N. Peck , Robert Constantin , David E. Hammond , Andrew Michal , Stephen R. Veit
发明人： Thomas A. Manning , David N. Peck , Robert Constantin , David E. Hammond , Andrew Michal , Stephen R. Veit
IPC分类号： G01R3108
CPC分类号： H04L12/5602 , H04L12/5601 , H04L49/205 , H04L2012/5634 , H04L2012/5635 , H04L2012/5636 , H04Q11/0478
摘要： Each switch along a call setup path in a network decides whether the call request should be upgraded from a non-flow-controlled service type to a flow-controlled service type. Each switch bases the decision on whether a boolean variable for the calling subscriber that appears in a management information base (MIB) is set to a value indicating that the subscriber is entitled to the upgrade. In addition, the upgrade is performed only if an interface on the route to the called party on which the call setup request is to be forwarded supports flow-controlled connections. When the call is to be upgraded, the switch replaces the service type indicator in the setup message with a value indicating a flow-controlled service type, and forwards the setup message toward the called subscriber. If the MIB variable is set to a value indicating that the upgrade is not to be performed, it is still possible for a subscriber to request flow-controlled service directly, by indicating this service type in the original call setup message. Each switch also makes a call downgrade decision. When a call setup message is received requesting flow-controlled service but destined for an interface that does not support flow-controlled operation, the switch replaces the service type indicator in the outgoing setup message with a value indicating a non-flow-controlled service type.
摘要翻译：沿着网络中的呼叫建立路径的每个交换机决定呼叫请求是否应该从非流控制的服务类型升级到流控服务类型。每个交换机基于出现在管理信息库（MIB）中的主叫用户的布尔变量是否被设置为指示用户有权升级的值的决定。另外，只有当呼叫建立请求被转发到被叫方的路由上的接口支持流量控制连接时才执行升级。当呼叫要升级时，交换机将使用指示流控服务类型的值替换设置消息中的业务类型指示符，并将该建立消息转发给被叫用户。如果MIB变量被设置为指示不执行升级的值，则用户可以通过在原始呼叫建立消息中指示该服务类型来直接请求流控服务。每个开关也会调用降级决定。当接收到呼叫建立消息请求流控制服务但发往不支持流控制操作的接口时，交换机用输出建立消息中的服务类型指示符替换指示非流控服务类型的值。

3. 发明授权

US06628668B1 Crosspoint switch bandwidth allocation management 失效
标题翻译：交叉点交换机带宽分配管理
公开(公告)号：US06628668B1
公开(公告)日：2003-09-30
申请号：US09270950
申请日：1999-03-16
申请人： Peter Hutzli , David N. Peck , Thomas A. Manning
发明人： Peter Hutzli , David N. Peck , Thomas A. Manning
IPC分类号： H04J316
CPC分类号： H04L47/805 , H04L47/15 , H04L47/2408 , H04L47/2416 , H04L47/70 , H04L47/724 , H04L47/801
摘要： A system for allocating bandwidth in a network element. The system determines whether a bandwidth allocation request is associated with a delay sensitive connection type. If so, the system selects a bandwidth allocation algorithm from a first set of bandwidth allocation algorithms. Otherwise, the system selects a bandwidth allocation algorithm from a second set of bandwidth allocation algorithms. The size of the bandwidth allocation request may be examined when selecting which bandwidth allocation algorithm to use. The system may round up the size of the bandwidth allocation request to a predetermined value. The selected bandwidth allocation algorithm may reserve slots in a bandwidth allocation table. Reserved slots that are equally spaced in the bandwidth allocation table avoid undue delays in servicing an associated connection. A binary tree representation of the table is described, wherein leaves of the binary tree correspond to individual table slots. Specific bandwidth allocation algorithms are described which are advantageously applicable when allocating bandwidth to delay sensitive or relatively delay insensitive connection types.
摘要翻译：用于在网元中分配带宽的系统。系统确定带宽分配请求是否与延迟敏感连接类型相关联。如果是，则系统从第一组带宽分配算法中选择带宽分配算法。否则，系统从第二组带宽分配算法中选择带宽分配算法。当选择要使用的带宽分配算法时，可以检查带宽分配请求的大小。系统可以将带宽分配请求的大小加倍到预定值。所选择的带宽分配算法可以在带宽分配表中预留时隙。在带宽分配表中等间隔的保留时隙可以避免在维护相关联的连接中造成不必要的延迟。描述了表的二叉树表示，其中二叉树的叶对应于各个表时隙。描述了当分配带宽以延迟敏感或相对延迟不敏感的连接类型时有利地适用的特定带宽分配算法。

4. 发明授权

US06452903B1 Network switch supporting rate-based and credit-based flow control mechanisms on a link-by-link basis 失效
标题翻译：网络交换机支持基于速率和基于信用的流量控制机制
公开(公告)号：US06452903B1
公开(公告)日：2002-09-17
申请号：US09583608
申请日：2000-05-31
申请人： David N. Peck , Thomas A. Manning
发明人： David N. Peck , Thomas A. Manning
IPC分类号： H04L1228
CPC分类号： H04L49/3081 , H04L12/56 , H04L2012/5635 , H04L2012/5681 , H04Q11/0478
摘要： Network interface logic includes first logic executing a credit-based flow-control protocol (e.g., Quantum Flow Control or QFC) and second logic executing a rate-based flow control protocol (e.g. Explicit Rate or ER). The second logic transfers data cells between a network link and the first logic and inserts and extracts forward (FRM) and backward (BRM) flow-control/resource management (RM) cells. The second logic further (i) obtains cell buffer utilization information from the first logic, (ii) supplies transmission credits to the first logic based on rate information in BRM cells, (iii) induces the first logic to emit “dummy” RM cells when an RM cell is to be transmitted, and (iv) converts the dummy cells to either FRM or DRM cells for forwarding on the link. Rate information in the transmitted RM cells is calculated from the buffer utilization information and rate information in extracted BRM cells.
摘要翻译：网络接口逻辑包括执行基于信用的流量控制协议（例如，量子流控制或QFC）的第一逻辑和执行基于速率的流控制协议（例如显式速率或ER）的第二逻辑。第二个逻辑在网络链路和第一个逻辑之间传输数据信元，并插入和提取前向（FRM）和后向（BRM）流控制/资源管理（RM）单元。第二逻辑进一步（i）从第一逻辑获得信元缓冲器利用信息，（ii）基于BRM单元中的速率信息向第一逻辑提供传输信用，（iii）诱导第一逻辑在“ 要发送RM信元，（iv）将虚拟信元转换为FRM或DRM信元以在链路上转发。从提取的BRM单元中的缓冲器利用信息和速率信息计算发送的RM单元中的速率信息。

5. 发明授权

US5822540A Method and apparatus for discarding frames in a communications device 失效
标题翻译：用于在通信设备中丢弃帧的方法和装置
公开(公告)号：US5822540A
公开(公告)日：1998-10-13
申请号：US683791
申请日：1996-07-18
申请人： Stephen A. Caldara , Stephen A. Hauser , Thomas A. Manning , David N. Peck
发明人： Stephen A. Caldara , Stephen A. Hauser , Thomas A. Manning , David N. Peck
IPC分类号： G06F12/02 , G06F9/46 , G06F15/173 , H04J3/06 , H04L1/22 , H04L7/04 , H04L12/18 , H04L12/24 , H04L12/46 , H04L12/56 , H04L12/64 , H04L13/08 , H04L29/06 , H04L29/08 , H04M3/00 , H04M3/08 , H04M3/22 , H04Q3/00 , H04Q3/545 , H04Q11/04 , G06F13/00
CPC分类号： H04L47/18 , G06F15/17375 , H04L12/24 , H04L12/4608 , H04L12/5601 , H04L12/5602 , H04L12/5693 , H04L12/5695 , H04L12/64 , H04L12/6402 , H04L41/00 , H04L41/0896 , H04L47/10 , H04L47/11 , H04L47/15 , H04L47/16 , H04L47/26 , H04L47/266 , H04L47/29 , H04L47/30 , H04L47/52 , H04L47/521 , H04L47/522 , H04L47/525 , H04L47/56 , H04L47/621 , H04L47/6215 , H04L47/6225 , H04L47/627 , H04L47/722 , H04L47/743 , H04L47/745 , H04L47/762 , H04L47/782 , H04L47/805 , H04L47/822 , H04L49/101 , H04L49/103 , H04L49/106 , H04L49/107 , H04L49/108 , H04L49/153 , H04L49/1553 , H04L49/1576 , H04L49/20 , H04L49/203 , H04L49/205 , H04L49/253 , H04L49/254 , H04L49/255 , H04L49/256 , H04L49/30 , H04L49/3009 , H04L49/3081 , H04L49/309 , H04L49/455 , H04L49/503 , H04L49/505 , H04L49/506 , H04L49/552 , H04L49/90 , H04L49/901 , H04L49/9047 , H04L49/9078 , H04L69/32 , H04L69/324 , H04Q11/0478 , H04W28/14 , H04J3/0682 , H04J3/0685 , H04L2012/5614 , H04L2012/5616 , H04L2012/5627 , H04L2012/5628 , H04L2012/5629 , H04L2012/5631 , H04L2012/5632 , H04L2012/5634 , H04L2012/5635 , H04L2012/5642 , H04L2012/5643 , H04L2012/5647 , H04L2012/5648 , H04L2012/5649 , H04L2012/565 , H04L2012/5651 , H04L2012/5652 , H04L2012/5672 , H04L2012/5679 , H04L2012/5681 , H04L2012/5682 , H04L2012/5683 , H04L2012/5684 , H04L2012/5685 , H04L49/201 , H04L49/25 , H04L49/508 , H04L49/55 , H04L49/555 , H04L7/046 , Y10S370/902 , Y10S370/905
摘要： The invention comprises a method and apparatus for discarding frames in a communications device. In accordance with the method of the invention, a plurality of cells are received representing a plurality of frames wherein each cell comprises a data portion and a header portion including a cell loss priority indicator. At least some of the cells are stored in a buffer. It is determined if the number of cells in the buffer exceeds a first threshold when a first cell including an end of file marker is received. A series of cells received between the first cell and a second cell are discarded if the first threshold was exceeded in the determining step and if the cell loss priority indicator for a cell in the series of cells is set to a first state. The second cell comprises a cell including an end of file marker.
摘要翻译：本发明包括一种用于在通信设备中丢弃帧的方法和装置。根据本发明的方法，接收表示多个帧的多个小区，其中每个小区包括数据部分和包括小区丢失优先级指示符的报头部分。至少一些单元格存储在缓冲器中。当接收到包括文件标记结束的第一个单元时，确定缓冲器中的单元数目是否超过第一阈值。如果在确定步骤中超过了第一阈值，并且该单元格系列中的单元的单元丢失优先级指示符被设置为第一状态，则在第一单元和第二单元之间接收的一系列单元被丢弃。第二单元包括包括文件标记的末端的单元。

6. 发明授权

US06466541B1 Cell pacing on a network link employing a rate-based flow control protocol with underlying credit-based flow control mechanisms 失效
标题翻译：使用基于信用流量控制机制的基于速率的流量控制协议的网络链路上的小区起搏
公开(公告)号：US06466541B1
公开(公告)日：2002-10-15
申请号：US09584125
申请日：2000-05-31
申请人： David N. Peck
发明人： David N. Peck
IPC分类号： H04J116
CPC分类号： H04Q11/0478 , H04L12/56 , H04L2012/5635 , H04L2012/5649 , H04L2012/568
摘要： A network device operates to control the clumping of cells on a connection using a rate-based flow-control protocol. In each of successive intervals, a number N is calculated representing the maximum number of cells permitted to be transmitted consecutively. N is calculated as the quotient from dividing a cell delay variation tolerance (CDVT) by the difference between the reciprocal of an allowed cell rate (ACR) and the reciprocal of a link cell rate (LCR). If the calculated quotient is greater than a number NRM for the connection indicating the maximum number of data cells allowed between forward flow-control cells, then N is set equal to NRM. A value C is calculated as the largest integer factor of NRM that is no greater than N, and the interval is then divided into NRM/C sub-intervals. No more than C cells are allowed to be transmitted on the connection in each of the sub-intervals. This limit is enforced using a credit mechanism in which no more than C credits are extended to a cell transmitter in each sub-interval.
摘要翻译：网络设备操作以使用基于速率的流控制协议来控制连接上的小区的聚集。在每个连续间隔中，计算代表允许连续发送的单元的最大数目的数量N。 N被计算为商细胞延迟变异公差（CDVT）除以允许细胞率（ACR）的倒数与链节细胞率（LCR）的倒数之间的差。如果所计算的商大于指示在前向流控制小区之间允许的数据单元的最大数量的连接的数量NRM，则将N设置为等于NRM。计算值C作为不大于N的NRM的最大整数因子，然后将间隔分成NRM / C子间隔。在每个子间隔中，连接上允许不超过C个小区被传送。使用信用机制强制实施该限制，其中在每个子时间间隔内不超过C个信用额度被扩展到小区发送机。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式