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

1. 发明申请

US20080019325A1 TRAFFIC MODELING FOR PACKET DATA COMMUNICATIONS SYSTEM DIMENSIONING 有权
标题翻译：分组数据通信系统尺寸的交通建模
公开(公告)号：US20080019325A1
公开(公告)日：2008-01-24
申请号：US11834166
申请日：2007-08-06
申请人： Assad RADPOUR
发明人： Assad RADPOUR
IPC分类号： H04B7/216
CPC分类号： H04L41/147 , H04L41/0896 , H04L41/145 , H04L41/5003
摘要： A packet-based communications network is dimensioned based on a maximum number of users able to receive a predetermined target throughput of data over a predetermined number of channels. For each of an incremental number of users, at least one blocking probability is calculated, based on a traffic distribution model, and a service delay is calculated, based on the blocking probability. An iterative throughput, corresponding to each of the incremental number of users, is determined based on the corresponding blocking probability and service delay. Each iterative throughput is compared to the target throughput. The maximum number of users is identified as the number of users having a corresponding iterative throughput that is closest to and less than target throughput.
摘要翻译：基于分组的通信网络基于能够在预定数量的信道上接收预定目标吞吐量的最大数量的用户来确定尺寸。对于每个增量数量的用户，基于流量分布模型计算至少一个阻塞概率，并且基于阻塞概率来计算服务延迟。基于相应的阻塞概率和服务延迟确定对应于每个增量用户数量的迭代吞吐量。将每个迭代吞吐量与目标吞吐量进行比较。用户的最大数量被确定为具有最接近目标吞吐量的相应迭代吞吐量的用户数。

2. 发明申请

US20110149786A1 TRAFFIC MODELING FOR PACKET DATA COMMUNICATIONS SYSTEM DIMENSIONING 有权
标题翻译：分组数据通信系统尺寸的交通建模
公开(公告)号：US20110149786A1
公开(公告)日：2011-06-23
申请号：US13036677
申请日：2011-02-28
申请人： Assad RADPOUR
发明人： Assad RADPOUR
IPC分类号： H04L12/26
CPC分类号： H04L41/147 , H04L41/0896 , H04L41/145 , H04L41/5003
摘要： A packet-based communications network is dimensioned based on a maximum number of users able to receive a predetermined target throughput of data over a predetermined number of channels. For each of an incremental number of users, at least one blocking probability is calculated, based on a traffic distribution model, and a service delay is calculated, based on the blocking probability. An iterative throughput, corresponding to each of the incremental number of users, is determined based on the corresponding blocking probability and service delay. Each iterative throughput is compared to the target throughput. The maximum number of users is identified as the number of users having a corresponding iterative throughput that is closest to and less than target throughput.
摘要翻译：基于分组的通信网络基于能够在预定数量的信道上接收预定目标吞吐量的最大数量的用户来确定尺寸。对于每个增量数量的用户，基于流量分布模型计算至少一个阻塞概率，并且基于阻塞概率来计算服务延迟。基于相应的阻塞概率和服务延迟确定对应于每个增量用户数量的迭代吞吐量。将每个迭代吞吐量与目标吞吐量进行比较。用户的最大数量被确定为具有最接近目标吞吐量的相应迭代吞吐量的用户数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式