公开(公告)号：US5537446A

公开(公告)日：1996-07-16

申请号：US153538

申请日：1993-11-15

申请人： Tirunell V. Lakshman ,  Teunis J. Ott ,  Mohammed A. J. Tabatabai-Yazdi

发明人： Tirunell V. Lakshman ,  Teunis J. Ott ,  Mohammed A. J. Tabatabai-Yazdi

IPC分类号： H04L12/56 ,  H04N21/236 ,  H04N21/434 ,  H04Q11/04 ,  H04L7/00

CPC分类号： H04N21/434 ,  H04N21/236 ,  H04Q11/0478 ,  H04L2012/5616 ,  H04L2012/5636 ,  H04L2012/5649

摘要： A methodology and concomitant circuitry for smoothing delay sensitive traffic utilizes short term traffic forecasts and guarantees meeting a prespecified delay constraint. The pattern of incoming traffic is used to forecast estimates of future incoming data from the present and past incoming data. Corresponding to the estimate is a data rate for propagating stored data to produce a smoothed outgoing data rate, and the interval of time over which such a rate is used so as to satisfy the delay constraint. The estimation procedure is then re-invoked at the end to the time interval, which takes into account data arriving during the time interval, so as to determine the next succeeding data rate and a new time interval for propagating stored data.

摘要翻译： 用于平滑延迟敏感业务的方法和并发电路利用短期业务量预测和保证满足预先指定的延迟约束。 传入流量的模式用于预测来自当前和过去传入数据的未来传入数据的估计。 与估计相对应的是用于传播存储的数据以产生平滑的输出数据速率的数据速率，以及使用这种速率以满足延迟约束的时间间隔。 然后在时间间隔结束时重新调用估计过程，该时间间隔考虑了在时间间隔期间到达的数据，以便确定下一个后续数据速率和用于传播存储的数据的新的时间间隔。

公开(公告)号：US06560198B1

公开(公告)日：2003-05-06

申请号：US09186241

申请日：1998-11-05

申请人： Teunis J. Ott ,  Tirunell V. Lakshman

发明人： Teunis J. Ott ,  Tirunell V. Lakshman

IPC分类号： H04L1226

CPC分类号： H04L47/32 ,  H04L47/10 ,  H04L47/11 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L49/505 ,  H04L2012/5648

摘要： Methods and systems for estimating the number of active connections in a node in a communications network are described. The node estimates the number of active connections, without maintaining state information on each connection in the node, by sampling one or more packets in a buffer in the node when the node receives a packet, determining the number of sampled packets that are associated with the same connection as the received packet, and estimating the number of active connections in the node based on the determined number of the sampled packets. The node stabilizes the number of packets in the buffer by estimating the number of active connections in the node based on a sampling of the packets in the buffer when the node receives a packet, determining a probability for discarding the received packet based on the estimated number of the active connections and the recent buffer occupancy, and discarding the received packet according to the determined probability.

摘要翻译： 描述用于估计通信网络中的节点中的活动连接数目的方法和系统。 节点通过在节点接收到分组时对节点中的缓冲器中的一个或多个分组进行采样来确定活动连接的数量，而不维护节点中的每个连接的状态信息，确定与该节点相关联的采样分组的数量 与接收到的分组相同的连接，以及基于所确定的采样分组数来估计节点中的活动连接数。 节点通过基于当节点接收分组时基于缓冲器中的分组的采样来估计节点中的活动连接数来稳定缓冲器中的分组数量，基于估计的数量确定丢弃所接收的分组的概率 的活动连接和最近的缓冲器占用，并且根据确定的概率丢弃接收到的分组。

公开(公告)号：US06449253B1

公开(公告)日：2002-09-10

申请号：US09141253

申请日：1998-08-27

申请人： Teunis J. Ott

发明人： Teunis J. Ott

IPC分类号： H04L1226

CPC分类号： H04L12/5602 ,  H04L2012/5635 ,  H04Q11/0478

摘要： A method and system for dynamically adjusting the total bandwidth that an asynchronous transfer mode (ATM) switching system can make available to Available Bit Rate (ABR) virtual circuits comprise the steps of by determining a set of weighted “cutoffs” for the ABR virtual circuits, respectively, determining a first total expected rate (Exp_Rate) for recently active virtual circuits that are bottlenecked elsewhere based on the weighted cutoffs, setting a second total expected rate for active virtual circuits that are bottlenecked elsewhere to the first total expected rate, determining a total bandwidth available in the switching system for active virtual circuits that are bottlenecked in the switching system based on the first total expected rate, and setting to zero the first total expected rate. Furthermore, the method and system dynamically adjust the total bandwidth that the switching system can make available to ABR virtual circuits by recomputing, at fixed time intervals, the total bandwidth that is available to the active ABR virtual circuits that are bottlenecked at the switching system.

摘要翻译： 用于动态调整异步传输模式（ATM）交换系统可用于可用比特率（ABR）虚拟电路的总带宽的方法和系统包括以下步骤：通过确定ABR虚拟电路的一组加权“截止值” 分别确定基于加权截止值在其他地方瓶颈的最近活动的虚拟电路的第一总预期速率（Exp_Rate），将在其他地方瓶颈的主动虚拟电路的第二总预期速率设置为第一总预期速率， 基于第一总预期速率在交换系统中瓶颈的主动虚拟电路的交换系统中可用的总带宽，并将第一总预期速率设置为零。 此外，该方法和系统通过以固定的时间间隔重新计算在交换系统处于瓶颈的活动ABR虚拟电路可用的总带宽，动态地调整交换系统可用于ABR虚拟电路的总带宽。

公开(公告)号：US4788721A

公开(公告)日：1988-11-29

申请号：US130423

申请日：1987-12-09

申请人： Komandur R. Krishnan ,  Teunis J. Ott

发明人： Komandur R. Krishnan ,  Teunis J. Ott

IPC分类号： H04M3/36 ,  H04M3/00 ,  H04M7/00 ,  H04Q3/66 ,  H04M7/06

CPC分类号： H04Q3/66 ,  H04Q2213/13141 ,  H04Q2213/13164 ,  H04Q2213/13166 ,  H04Q2213/13213 ,  H04Q2213/13332

摘要： A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. These occupancy factors are proportional to unassociated occupancy factors and allocation factors associated with calls of the various node-pairs; each of these latter factors is derived from a nominal routing scheme in which a call of the corresponding node-pair is treated as lost only if it is blocked on all of its permitted routes. Upon a request for service, the occupany factors corresponding to the busy-idle status of the links are used to compute an occupancy value associated with each of the end routes. Each route is converted to a candidate route based on traffic load at the initiation of the service request. The minimum occupancy value for each set of routes is selected as the candidate route for bridging a given node pair. If this minimum value is less than a preselected threshold, the traffic is routed over this candidate route, thereby satisfying the service request. Otherwise, the request is denied.

摘要翻译： 公开了一种用于通过包括与链路互连的节点的网络来路由服务请求的过程。 网络也被布置成使得每个节点可以与每个其他节点进行通信。 在预选的时间间隔内，响应于网络配置和流量信息生成通过网络的路由。 此外，在预定时间间隔，根据网络配置和响应于交通信息来计算占用因子。 这些占用因素与不相关的占用因素和与各种节点对的呼叫相关联的分配因子成比例; 这些后一个因素中的每一个来自标称路由方案，其中对应的节点对的呼叫仅在其所有允许路由被阻塞时被视为丢失。 在请求服务时，使用与链路的忙碌状态相对应的占用因素来计算与每个终端路由相关联的占用值。 在启动服务请求时，根据流量负载将每个路由转换为候选路由。 选择每组路由的最小占用值作为桥接给定节点对的候选路由。 如果该最小值小于预选阈值，则在该候选路由上路由业务，从而满足服务请求。 否则，请求被拒绝。

公开(公告)号：US06434116B1

公开(公告)日：2002-08-13

申请号：US09187576

申请日：1998-11-05

申请人： Teunis J. Ott

发明人： Teunis J. Ott

IPC分类号： H04L1226

CPC分类号： H04L47/32 ,  H04L43/00 ,  H04L43/0894 ,  H04L43/16 ,  H04L47/11 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L49/505 ,  H04L2012/5648

摘要： Methods and systems for determining the number of active connections in a node in a communications network are described. The node determines the number of active connections by sampling a list of recently active connections in the node when the node receives a packet, and estimating the number of active connections based on whether the packet is associated with a sampled entry in the list. Each entry in the list includes a connection identifier and a count. The node stabilizes the buffer occupancy by estimating the number of active connections in the node based on a sampling of the list of recently active connections when the node receives a packet, determining a probability for discarding the packet based on the estimated number of active connections and the recent buffer occupancy, and discarding the packet according to the determined probability. Finally, the node monitors the connection associated with the received packet when the connection is associated with the connection identifier in a sampled entry, the count of the sampled entry exceeds a first predetermined threshold, and/or a total occurrences of the connection identifier in the list exceeds a second predetermined threshold.

摘要翻译： 描述用于确定通信网络中的节点中的活动连接的数量的方法和系统。 节点通过在节点接收分组时对节点中最近活动的连接的列表进行采样来确定活动连接的数量，并且基于分组是否与列表中的采样条目相关联来估计活动连接的数量。 列表中的每个条目包括连接标识符和计数。 节点通过基于当节点接收到分组时最近活动连接的列表的采样来估计节点中的活动连接的数量来稳定缓冲器占用，基于估计的活动连接数确定丢弃分组的概率，以及 最近的缓冲器占用，并根据确定的概率丢弃该分组。 最后，当连接与采样条目中的连接标识符相关联时，节点监视与接收到的分组相关联的连接，采样条目的计数超过第一预定阈值，和/或连接标识符的总出现次数 列表超过第二预定阈值。

公开(公告)号：US4704724A

公开(公告)日：1987-11-03

申请号：US805302

申请日：1985-12-05

申请人： Komandur R. Krishnan ,  Teunis J. Ott

发明人： Komandur R. Krishnan ,  Teunis J. Ott

IPC分类号： H04M3/00 ,  H04M3/36 ,  H04M7/00 ,  H04Q3/66

CPC分类号： H04Q3/66 ,  H04M3/36 ,  H04Q2213/13103 ,  H04Q2213/13141 ,  H04Q2213/13164 ,  H04Q2213/13166 ,  H04Q2213/13213 ,  H04Q2213/13332

摘要： A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. Upon a request for service, the occupancy factors corresponding to the busy-idle status of the links are used to compute an occupancy value associated with each of the routes. Each route is converted to a candidate route based on traffic load at the initiation of the service request. The minimum occupancy value for each set of routes is selected as the candidate route for bridging a given node pair. If this minimum value is less than a preselected threshold, the traffic is routed over this candidate route, thereby satisfying the service request. Otherwise, the request is denied.

摘要翻译： 公开了一种用于通过包括与链路互连的节点的网络来路由服务请求的过程。 网络也被布置成使得每个节点可以与每个其他节点进行通信。 在预选的时间间隔内，响应于网络配置和流量信息生成通过网络的路由。 此外，在预定时间间隔，根据网络配置和响应于交通信息来计算占用因子。 在请求服务时，使用与链路的忙碌状态相对应的占用因素来计算与每个路由相关联的占用值。 在启动服务请求时，根据流量负载将每个路由转换为候选路由。 选择每组路由的最小占用值作为桥接给定节点对的候选路由。 如果该最小值小于预选阈值，则在该候选路由上路由业务，从而满足服务请求。 否则，请求被拒绝。