公开(公告)号：US6081843A

公开(公告)日：2000-06-27

申请号：US821238

申请日：1997-03-20

申请人： Matti Kalevi Kilkki ,  Sari Irene Saranka

发明人： Matti Kalevi Kilkki ,  Sari Irene Saranka

IPC分类号： H04L12/56 ,  H04Q11/04 ,  G06F15/16

CPC分类号： H04Q11/0478 ,  H04L2012/5632 ,  H04L2012/5681 ,  H04L2012/5682

摘要： A system and method for regulating the cell transfer rate over a network in response to priority level feedback. The feedback feature provides network connection availability information corresponding to a level of bandwidth available on the network connection to the cell source. The connection availability information is converted into a buffer occupancy level accessible at the cell source. The cell transfer rate is regulated at the network source unit in accordance with the buffer occupancy level, including decreasing the cell transfer rate when the buffer occupancy level rises above a high occupancy threshold of the buffer, and increasing the cell transfer rate when the buffer occupancy level drops below a low occupancy threshold of the buffer.

摘要翻译： 一种用于响应于优先级反馈来调节网络上的小区传输速率的系统和方法。 反馈功能提供对应于与单元源的网络连接上可用的带宽水平的网络连接可用性信息。 连接可用性信息被转换成在单元源可访问的缓冲器占用级别。 根据缓冲器占用等级，在网络源单元处调整单元传输速率，包括当缓冲器占用电平上升到高于缓冲器的高占用阈值时降低单元传输速率，并且当缓冲器占用率时增加单元传输速率 电平降低到缓冲器的低占用阈值以下。

公开(公告)号：US6047326A

公开(公告)日：2000-04-04

申请号：US822270

申请日：1997-03-20

申请人： Matti Kalevi Kilkki

发明人： Matti Kalevi Kilkki

IPC分类号： H04L12/56 ,  H04L29/06 ,  H04Q11/04 ,  G06F13/14 ,  H04L12/14 ,  H04L12/26

CPC分类号： H04Q11/0478 ,  H04L65/1069 ,  H04L65/80 ,  H04L69/24 ,  H04L2012/5651 ,  H04L29/06027

摘要： A system and method for charging for usage of a network service connection. The network includes access nodes which provide user access to core nodes of the network. At an access node, the traffic of connections associated with the access node is measured. A nominal bit rate (NBR) associated with the access node is used together with the traffic measurement to compute a priority level at the access node. The value of NBR represents an expected, but not guaranteed, bit rate associated with a particular user or connection. The connection may be a real-time or a non-real-time connection. Information elements, transmitted from the access node to a core network node, are each assigned one of several priority levels, and cells are either accepted or discarded based on priority level and the status of one or more buffers at the core node. A charging schedule, based on a maximum allowed NBR established for the user, accounts for both a fixed or non-fixed monthly fee and a time dependent fee portion. The charging scheme may take into account that the NBR may be different for upstream and downstream transmissions. A charging counter, which accounts for the cost of connection usage, may be updated on a periodic basis, such as once a second for example, or on a non-periodic basis.

摘要翻译： 一种用于对网络服务连接的使用进行计费的系统和方法。 该网络包括提供用户访问网络的核心节点的接入节点。 在接入节点，测量与接入节点相关联的连接的流量。 与访问节点相关联的标称比特率（NBR）与流量测量一起用于计算接入节点的优先级。 NBR的值表示与特定用户或连接相关联的期望但不保证的比特率。 该连接可以是实时或非实时连接。 从接入节点发送到核心网络节点的信息元素每个被分配为几个优先级中的一个，并且基于优先级级别和核心节点处的一个或多个缓冲器的状态来接受或丢弃小区。 基于为用户建立的最大允许NBR的收费计划，既包括固定的或非固定的每月费用，也包括时间相关费用部分。 计费方案可以考虑到上行和下行传输的NBR可能不同。 考虑到连接使用成本的计费计数器可以周期性地更新，例如每隔一秒，或者非周期性地更新。

公开(公告)号：US6023453A

公开(公告)日：2000-02-08

申请号：US927248

申请日：1997-09-11

申请人： Jussi Pekka Olavi Ruutu ,  Matti Kalevi Kilkki

发明人： Jussi Pekka Olavi Ruutu ,  Matti Kalevi Kilkki

IPC分类号： H04L12/56 ,  H04Q11/04 ,  H04L12/26 ,  H04J3/16

CPC分类号： H04L47/27 ,  H04L47/10 ,  H04L47/24 ,  H04Q11/0478 ,  H04L2012/5648 ,  H04L2012/5651

摘要： A system and method for determining the minimum and/or maximum values from a number of sample parameter values utilizes a table of last occurrence (TOLO-table), together with a sliding window or filter, to greatly enhance the speed and efficiency when determining the minimum and/or maximum value from a number of sample parameter values that fall within the sliding window. The TOLO-table typically includes a parameter column for storing entries for each one of a limited number of discrete parameter values, and also includes a time stamp column which provides entries for storing time of receipt data associated with each parameter value defined in the parameter column. Alternatively, an order number column may be employed for storing number order entries corresponding to the order in which the parameter values are received. Every time a parameter value is received, the time stamp or order number entry associated with the parameter value is updated to the current time or order number. The sliding window may be defined on the basis of time or by a selected number of sample parameter values. The parameter values falling within the sliding window are scanned to determine the minimum and/or maximum of the applicable parameter values.A minimum/maximum determination methodology that employs a TOLO-table and sliding window may be used in a wide variety of applications, and is particularly useful in ATM network applications, particularly in implementing the cell discarding strategy of a network node.

摘要翻译： 用于根据多个采样参数值确定最小值和/或最大值的系统和方法利用最后出现表（TOLO-table）以及滑动窗口或滤波器来大大提高速度和效率，当确定 来自滑动窗口内的多个样本参数值的最小值和/或最大值。 TOLO表通常包括用于存储有限数量的离散参数值中的每一个的条目的参数列，并且还包括时间戳列，其提供用于存储与在参数列中定义的每个参数值相关联的接收数据的时间的条目 。 或者，可以使用订单号列来存储与接收参数值的顺序相对应的号码次序条目。 每次接收到参数值时，与参数值相关联的时间戳或订单号条目更新为当前时间或订单号。 可以基于时间或选定数量的样本参数值来定义滑动窗口。 扫描落在滑动窗口内的参数值，以确定适用参数值的最小值和/或最大值。 使用TOLO表和滑动窗口的最小/最大确定方法可以用于各种各样的应用中，并且在ATM网络应用中特别有用，特别是在实现网络节点的小区丢弃策略时。

公开(公告)号：US06370520B1

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

申请号：US09440798

申请日：1999-11-15

申请人： Jussi Pekka Olavi Ruutu ,  Matti Kalevi Kilkki

发明人： Jussi Pekka Olavi Ruutu ,  Matti Kalevi Kilkki

IPC分类号： G06F1730

CPC分类号： H04L47/27 ,  H04L47/10 ,  H04L47/24 ,  H04L2012/5648 ,  H04L2012/5651 ,  H04Q11/0478 ,  Y10S707/99931

摘要： A system and method for determining the minimum and/or maximum values from a number of sample parameter values utilizes a table of last occurrence (TOLO-table), together with a sliding window or filter, to greatly enhance the speed and efficiency when determining the minimum and/or maximum value from a number of sample parameter values that fall within the sliding window. The TOLO-table typically includes a parameter column for storing entries for each one of a limited number of discrete parameter values, and also includes a time stamp column which provides entries for storing time of receipt data associated with each parameter value defined in the parameter column. Alternatively, an order number column may be employed for storing number order entries corresponding to the order in which the parameter values are received. Every time a parameter value is received, the time stamp or order number entry associated with the parameter value is updated to the current time or order number. The sliding window may be defined on the basis of time or by a selected number of sample parameter values. The parameter values falling within the sliding window are scanned to determine the minimum and/or maximum of the applicable parameter values. A minimum/maximum determination methodology that employs a TOLO-table and sliding window may be used in a wide variety of applications, and is particularly useful in ATM network applications, particularly in implementing the cell discarding strategy of a network node.

摘要翻译： 用于根据多个采样参数值确定最小值和/或最大值的系统和方法利用最后出现表（TOLO-table）以及滑动窗口或滤波器来大大提高速度和效率，当确定 来自滑动窗口内的多个样本参数值的最小值和/或最大值。 TOLO表通常包括用于存储有限数量的离散参数值中的每一个的条目的参数列，并且还包括时间戳列，其提供用于存储与在参数列中定义的每个参数值相关联的接收数据的时间的条目 。 或者，可以使用订单号列来存储与接收参数值的顺序相对应的号码次序条目。 每次接收到参数值时，与参数值相关联的时间戳或订单号条目更新为当前时间或订单号。 可以基于时间或选定数量的样本参数值来定义滑动窗口。 扫描落在滑动窗口内的参数值，以确定适用参数值的最小值和/或最大值。 使用TOLO表和滑动窗口的最小/最大确定方法可以用于各种各样的应用中，并且在ATM网络应用中特别有用，特别是在实现网络节点的小区丢弃策略时。

公开(公告)号：US06338046B1

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

申请号：US08944390

申请日：1997-10-06

申请人： Jarmo Ilkka Saari ,  Timo Ilmari Taskinen ,  Matti Kalevi Kilkki

发明人： Jarmo Ilkka Saari ,  Timo Ilmari Taskinen ,  Matti Kalevi Kilkki

IPC分类号： G06F1760

CPC分类号： H04M15/41 ,  G06Q30/0283 ,  G06Q30/04 ,  H04L12/14 ,  H04L12/1428 ,  H04L12/1439 ,  H04L12/1485 ,  H04M2215/0164

摘要： A system and method for determining charges for use of network service connections. The network includes nodes which facilitate the transfer of information between source and destination locations. When a connection is established with a node, a billing cell is transmitted to the node over the connection which contains billing and connection information. Data cells are transmitted over the same connection subsequent to the billing cell. A terminate billing cell or conventional means may be used to drop the connection when the connection is no longer needed. The node computes the cost of using the connection based on the billing and connection information copied from the billing cell, and may also consider the connection time and the amount of data transferred over the connection. Upon establishing a subsequent connection with another node, the previous node transmits the billing cell to the new node which copies the billing cell content and, after receiving the data cells over the new connection, performs similar connection usage computations. This process is repeated by each of the nodes involved in the transfer of information between the source and destination. The nodes transmit their respective charging information to a network billing system which generates a final bill that is forwarded to the user. The billing cell may be transmitted from the destination back to the source to verify proper operation of the billing procedure. Fixed rate and variable rate billing schemes may be implemented and augmented as needed by each network operator.

摘要翻译： 一种用于确定网络服务连接使用费用的系统和方法。 该网络包括便于在源和目的地位置之间传送信息的节点。 当与节点建立连接时，通过包含计费和连接信息的连接将结算单元发送到节点。 数据单元在结算单元之后的相同连接上传输。 当不再需要连接时，可以使用终止计费单元或常规装置来丢弃连接。 节点根据从计费单元复制的计费和连接信息计算使用连接的成本，并且还可以考虑通过连接传输的连接时间和数据量。 在建立与另一节点的后续连接之后，先前节点将计费单元发送到复制计费单元内容的新节点，并且在通过新连接接收到数据单元之后，执行类似的连接使用计算。 这个过程由源和目的地之间的信息传递所涉及的每个节点重复。 节点将它们各自的计费信息发送到生成转发给用户的最终账单的网络计费系统。 计费单元可以从目的地返回到源以验证计费过程的正确操作。 固定速率和可变速率计费方案可以根据每个网络运营商的需要来实现和扩充。

公开(公告)号：US6081505A

公开(公告)日：2000-06-27

申请号：US822266

申请日：1997-03-20

申请人： Matti Kalevi Kilkki

发明人： Matti Kalevi Kilkki

IPC分类号： H04L12/56 ,  H04Q11/04 ,  H04L12/54

CPC分类号： H04L49/9036 ,  H04L12/5693 ,  H04L47/6215 ,  H04Q11/0478 ,  H04L2012/5614 ,  H04L2012/5636 ,  H04L2012/5647 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04L2012/568 ,  H04L2012/5682

摘要： A system and method for managing elements of information at a network node received from a user access node. An access node includes a user/network interface (UNI), and a core network node includes a cell filtering unit. The UNI includes a measuring unit, which measures the actual momentary bit rate of a connection between the UNI and the core node, and a priority level computing unit, which computes the priority level of each cell using the measured bit rate and an established nominal bit rate (NBR). NBR represents an expected, but not guaranteed, bit rate associated with a particular user or connection. The connection may be a real-time or a non-real-time connection. A scheduling unit of a node accepts or discards an arriving cell based on the occupancy of a real-time buffer and a non-real-time buffer provided at the node. Cells accepted by the scheduling unit are transferred to either the real-time buffer or the non-real-time buffer depending on cell type, and read out of the buffers with preference given to cells in the real-time buffer. A UNI may include two measuring units for measuring a short-term and a long-term bit rate of the connection, respectively. Packets of cells may be processed by the scheduling unit, such that if the first cell of the packet is discarded by the node, then all subsequent cells of the packet are discarded. If the first cell of a packet is accepted, then the priority of other cells of the packet may be increased.

摘要翻译： 一种用于管理从用户接入节点接收的网络节点处的信息元素的系统和方法。 接入节点包括用户/网络接口（UNI），核心网络节点包括小区过滤单元。 UNI包括测量单元，其测量UNI和核心节点之间的连接的实际瞬时比特率，以及优先级计算单元，其使用测量的比特率和建立的标称位来计算每个小区的优先级 率（NBR）。 NBR表示与特定用户或连接相关联的期望但不保证的比特率。 该连接可以是实时或非实时连接。 节点的调度单元基于在该节点处提供的实时缓冲器和非实时缓冲器的占用来接受或丢弃到达的小区。 由调度单元接收的单元根据单元类型被传送到实时缓冲器或非实时缓冲器，并且优先于缓冲器中读出实时缓冲器中的单元。 UNI可以分别包括用于测量连接的短期和长期比特率的两个测量单元。 小区的分组可以由调度单元处理，使得如果分组的第一小区被节点丢弃，则丢弃分组的所有后续小区。 如果分组的第一小区被接受，则可以增加分组的其他小区的优先级。

公开(公告)号：US6163808A

公开(公告)日：2000-12-19

申请号：US821273

申请日：1997-03-20

申请人： Matti Kalevi Kilkki

发明人： Matti Kalevi Kilkki

IPC分类号： H04L12/56 ,  H04Q11/04 ,  G06F15/16

CPC分类号： H04Q11/0478 ,  H04L2012/5626 ,  H04L2012/5636 ,  H04L2012/5651

摘要： A system and method for communicating elements of information between an access node and a core node of a network. An access node includes a user/network interface, and a core network node includes a cell filtering unit. The UNI includes a measuring unit which measures the actual momentary bit rate of a connection between the UNI and the core node. The UNI also includes a priority level computing unit that computes the priority level of each cell using the measured bit rate and an established nominal bit rate (NBR). The value of NBR represents an expected, but not guaranteed, bit rate associated with a particular user or connection. The connection may be a real-time or a non-real-time connection. A scheduling unit of a node accepts or discards an arriving cell based on the occupancy of a real-time buffer and a non-real-time buffer provided at the node. Cells accepted by the scheduling unit are transferred to either the real-time buffer or the non-real-time buffer depending on cell type. In general, cells are transferred out of the real-time buffer in preference to cells in the non-real-time buffer. In an alternative embodiment, a UNI may include two bit rate measuring units for measuring a short-term and a long-term bit rate of the connection. The priority level computing unit then computes cell priority values using the NBR and the short-term and long-term actual bit rates.

摘要翻译： 一种用于在接入节点和网络的核心节点之间传送信息元素的系统和方法。 接入节点包括用户/网络接口，核心网络节点包括小区过滤单元。 UNI包括测量单元，其测量UNI和核心节点之间的连接的实际瞬时比特率。 UNI还包括优先级计算单元，其使用测量的比特率和建立的标称比特率（NBR）来计算每个小区的优先级。 NBR的值表示与特定用户或连接相关联的期望但不保证的比特率。 该连接可以是实时或非实时连接。 节点的调度单元基于在该节点处提供的实时缓冲器和非实时缓冲器的占用来接受或丢弃到达的小区。 由调度单元接收的单元根据单元类型被传送到实时缓冲器或非实时缓冲器。 通常，优先于非实时缓冲器中的单元，将单元从实时缓冲器传送出去。 在替代实施例中，UNI可以包括用于测量连接的短期和长期比特率的两个比特率测量单元。 优先级计算单元然后使用NBR和短期和长期实际比特率来计算小区优先级值。

公开(公告)号：US06868061B1

公开(公告)日：2005-03-15

申请号：US09209183

申请日：1998-12-10

申请人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

发明人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

IPC分类号： H04L12/56 ,  H04Q11/04 ,  H04L12/24

CPC分类号： H04L47/10 ,  H04L49/3081 ,  H04L2012/5615 ,  H04L2012/5636 ,  H04L2012/5647 ,  H04L2012/5651 ,  H04Q11/0478

摘要： A system and method for reducing network node congestion by filtering out comparatively low priority packets prior to execution of other node functions, such as routing and switching, in packet-based network transmissions. The volume of packets is reduced by intercepting the information packets prior to their input to the network node. A portion of the intercepted packets are filtered out based on parameters corresponding to a probable packet acceptability at the network node. The remaining portion of the intercepted packets are forwarded to the network node for processing by the network packet functions.

摘要翻译： 一种用于在执行基于分组的网络传输中的其他节点功能（例如路由和交换）之前滤除相对较低优先级的分组来减少网络节点拥塞的系统和方法。 通过在信息包输入到网络节点之前拦截信息包来减少数据包的数量。 截取的数据包的一部分根据与网络节点上可能的数据包可接受性相对应的参数进行过滤。 截取的数据包的剩余部分被转发到网络节点，以便通过网络数据包功能进行处理。

公开(公告)号：US06549938B1

公开(公告)日：2003-04-15

申请号：US09209182

申请日：1998-12-10

申请人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

发明人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

IPC分类号： G06F1516

CPC分类号： H04L49/3081 ,  H04L49/203 ,  H04L2012/5642 ,  H04L2012/5651 ,  H04L2012/5667 ,  H04L2012/5679 ,  H04Q11/0478

摘要： A system and method for achieving a comparable quality of service for each of the receivers of a multicast transmission incorporating a priority-based quality of service is provided. Packet acceptance criteria established at each individual connection of a network node is overridden to provide a collective packet acceptance criteria for each packet of a multicast transmission targeted for the individual connections. The packet acceptance criteria is collected from each of the individual connections in the network node that are targeted for the multicast transmission. A multicast packet priority is calculated for each of the packets associated with the multicast transmission based on an aggregate analysis of the packet acceptance criteria of each of the individual connections. Each of the packets associated with the multicast transmission is collectively accepted or discarded based on the calculated multicast packet priority.

摘要翻译： 提供了一种用于为包含基于优先级的服务质量的多播传输的每个接收机实现可比较的服务质量的系统和方法。 在网络节点的每个单独连接处建立的分组接受标准被覆盖以为针对各个连接的多播传输的每个分组提供集体分组接受标准。 分组接受标准从针对组播传输的网络节点中的每个单独连接收集。 基于每个单独连接的分组接受标准的聚合分析，针对与多播传输相关联的每个分组计算多播分组优先级。 基于所计算的组播分组优先级，与组播传输相关联的每个分组被共同接受或丢弃。

公开(公告)号：US06421335B1

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

申请号：US09178658

申请日：1998-10-26

申请人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

发明人： Matti Kalevi Kilkki ,  Jussi Pekka Olavi Ruutu

IPC分类号： H04J1302

CPC分类号： H04W28/22 ,  H04B7/264

摘要： A system and method for integrating a priority-based quality of service in CDMA communication systems that implement data packet transmission, in order to effectively allocate radio resources. Data packet transfers are selectively allocated over a wireless interface operating under a Code Division Multiple Access (CDMA) protocol. A nominal bit rate is established for each user desiring access to the CDMA interface. A relative packet priority is calculated for each of the data packets based on an actual bit rate at the source of the CDMA interface and the established nominal bit rate. An allowable packet priority is calculated for the CDMA interface based on a signal-to-noise ratio of the CDMA interface, and those of the data packets having a relative packet priority greater than or equal to the allowable packet priority of the CDMA interface are transmitted across the CDMA interface.

摘要翻译： 一种用于在实现数据分组传输的CDMA通信系统中集成基于优先级的服务质量的系统和方法，以便有效地分配无线电资源。 通过在码分多址（CDMA）协议下操作的无线接口选择性地分配数据分组传输。 为每个想要访问CDMA接口的用户建立标称比特率。 基于CDMA接口的源的实际比特率和建立的标称比特率，为每个数据分组计算相对分组优先级。 基于CDMA接口的信噪比来计算CDMA接口的允许分组优先级，并且发送具有大于或等于CDMA接口的允许分组优先级的相对分组优先级的数据分组的那些优先级 跨越CDMA接口。