会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • FAST NETWORK HEURISTIC FOR TRAFFIC FLOW PREDICTION
    • 快速网络流量预测
    • WO2007136511A3
    • 2008-12-18
    • PCT/US2007010356
    • 2007-04-27
    • IDT CORPRELIS JEROME
    • RELIS JEROME
    • H04M7/00H04M15/00
    • H04Q3/66H04L47/10H04Q2213/13141H04Q2213/13383
    • A method of determining call routing within a telephone system network comprising a plurality of carriers, the method comprising: determining an ordering of the carriers or tandem connections at each location (Lj); determining the traffic demand for each location (Lj), for each carrier Ci which is first in order at a location (order 1) determining the total traffic demand LDCi of all locations where the order of the carrier (Ci) is 1; determining the ratio of CPi the capacity of carrier Ci to the total traffic demand LDCi of all locations where the carrier is order 1. If that ratio is greater than 1, then Ci can accommodate.all traffic where it is order one and hence assign all that traffic to Ci. For all carriers Ci where the ratio CPi/LDCi is less than 1 this means the demand LDCi would overflow Ci. Find the smallest such overflow ratio OFRmin. Applying that ratio to the demand at each location. (Fig. 3)
    • 一种在包括多个载波的电话系统网络内确定呼叫路由的方法,所述方法包括:确定每个位置(Lj)处的载波或串联连接的顺序; 对于确定载波(Ci)的顺序为1的所有位置的总交通需求LDCi的位置(顺序1),首先按顺序确定每个位置(Lj)的交通需求; 确定载波Ci的容量与载波为1的所有位置的总业务量LDCi的CPi的比率。如果该比率大于1,则Ci可以适应所有业务,其中它是一个,并且因此分配所有 交通到Ci。 对于比例CPi / LDCi小于1的所有运营商Ci,这意味着需求LDCi将溢出Ci。 找到最小的这样的溢流比OFRmin。 将该比率应用于每个位置的需求。 (图3)
    • 10. 发明申请
    • FAST NETWORK HEURISTIC FOR TRAFFIC FLOW PREDICTION
    • 快速网络流量预测流量网络
    • WO2007136511A2
    • 2007-11-29
    • PCT/US2007/010356
    • 2007-04-27
    • IDT CORPORATIONRELIS, Jerome
    • RELIS, Jerome
    • G01W1/00
    • H04Q3/66H04L47/10H04Q2213/13141H04Q2213/13383
    • A method of determining call routing within a telephone system network comprising a plurality of carriers, the method comprising: determining an ordering of the carriers or tandem connections at each location (Lj); determining the traffic demand for each location (Lj), for each carrier Ci which is first in order at a location (order 1) determining the total traffic demand LDCi of all locations where the order of the carrier (Ci) is 1; determining the ratio of CPi the capacity of carrier Ci to the total traffic demand LDCi of all locations where the carrier is order 1. If that ratio is greater than 1, then Ci can accommodate all traffic where it is order one and hence assign all that traffic to Ci. For all carriers Ci where the ratio CPi/LDCi is less than 1 this means the demand LDCi would overflow Ci. Find the smallest such overflow ratio OFRmin. Applying that ratio to the demand at each location. Updating the available capacity CPi of each carrier Ci which is order 1 somewhere to CPi - OFRmin * LDCi5 i.e., reducing the carriers capacity by the smallest overflow ratio times the total demand to the carrier where it is first. Updating the demand LDj at each location Lj to LDj — OFRmin*LDj, i.e., reducing the locations demand by the smallest overflow ratio times the demand at the location. Removing any carriers Ck which have reached capacity. Redetermining the ordering of carriers at each location and recursively apply the above method until all traffic is apportioned to carriers and tandem connections.
    • 一种在包括多个载波的电话系统网络内确定呼叫路由的方法,所述方法包括:确定每个位置(Lj)处的载波或串联连接的顺序; 对于确定载波(Ci)的顺序为1的所有位置的总业务量需求LDCi的位置(顺序1),首先按顺序确定每个位置(Lj)的业务需求量; 确定载波Ci的容量与载波为1的所有位置的总业务需求LDCi的CPi的比率。如果该比率大于1,则Ci可以容纳所有业务,其中它是第一个,因此分配所有 交通到Ci。 对于比例CPi / LDCi小于1的所有载波Ci,这意味着需求LDCi将溢出Ci。 找到最小的这样的溢流比OFRmin。 将该比率应用于每个位置的需求。 将CPi-OFRmin * LDCi5的某个位置1的每个载波Ci的可用容量CPi更新为最小溢出比乘以载波容量乘以其首先为载波的总需求。 将每个位置Lj处的需求LDj更新为LDj-OFRmin * LDj,即将最小溢出比率的位置需求减小到该位置的需求。 删除已达到容量的任何载波Ck。 重新确定每个位置的载波排序,并递归地应用上述方法,直到所有业务分配到载波和串联连接。