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

1. 发明授权

US06385172B1 Administrative weight assignment for enhanced network operation 有权
标题翻译：增强网络运行的管理权重分配
公开(公告)号：US06385172B1
公开(公告)日：2002-05-07
申请号：US09272720
申请日：1999-03-19
申请人： Deepak Kataria , Dimitris Logothetis , Santhanam Srinivasan , Malathi Veeraraghavan
发明人： Deepak Kataria , Dimitris Logothetis , Santhanam Srinivasan , Malathi Veeraraghavan
IPC分类号： H04J116
CPC分类号： H04L45/00 , H04L45/124 , H04Q3/0016 , H04Q2213/13003 , H04Q2213/1305 , H04Q2213/1307 , H04Q2213/13103 , H04Q2213/13106 , H04Q2213/1313 , H04Q2213/13164 , H04Q2213/13166 , H04Q2213/13176 , H04Q2213/13178 , H04Q2213/13299 , H04Q2213/13335 , H04Q2213/13349 , H04Q2213/1338
摘要： Methods and communication networks having a plurality of connection-oriented switches in which administrative weights are assigned based on link call blocking probabilities. Three assignment schemes include, first, a solution that can be built in the switch software of sufficiently similar switches to enable the switches to determine administrative weights for their links. The second and third schemes employ administrative weight management stations. The second scheme uses an administrative weight management station that operates to enhance total network revenue or throughput in a communication network in which all of the switches implement a certain type of accounting management information databases (MIB). The third scheme uses an administrative weight management station that computes administrative weights for switches that do not have the capability for the second scheme, but which employ appropriate MIBs.
摘要翻译：具有多个面向连接的交换机的方法和通信网络，其中基于链路呼叫阻塞概率来分配管理权重。三种分配方案首先包括可以在交换机软件中构建足够相似的交换机的解决方案，以使交换机能够确定其链路的管理权重。第二和第三种方案采用行政权重管理站。第二种方案使用管理权重管理站，其操作以增强其中所有交换机实现某种类型的会计管理信息数据库（MIB）的通信网络中的总网络收入或吞吐量。第三种方案使用管理权重管理站，其计算对于不具有第二方案的能力但是使用适当的MIB的交换机的管理权重。

2. 发明授权

US06687229B1 Quality of service based path selection for connection-oriented networks 有权
标题翻译：面向连接的网络的基于服务质量的路径选择
公开(公告)号：US06687229B1
公开(公告)日：2004-02-03
申请号：US09188023
申请日：1998-11-06
申请人： Deepak Kataria , Dimitris Logothetis , Santhanam Srinivasan , Malathi Veeraraghavan
发明人： Deepak Kataria , Dimitris Logothetis , Santhanam Srinivasan , Malathi Veeraraghavan
IPC分类号： H04L1226
CPC分类号： H04L45/10 , H04L45/121
摘要： Arrangements and methods for improving the probability of finding a connection path that meets user specified delay requirements. The improvements offer packet switches enhanced path selection that will improve the resource utilization of networks, both flat networks and hierarchical networks incorporating such switches. The latter type of networks run the path selection algorithm in the PNNI v1.0 standard where the packet switches are asynchronous transfer mode switches. Two modes of enhanced delay-based path selection are based on two different accumulation methods, namely an additive method and an asymptotic method.
摘要翻译：用于提高查找符合用户指定延迟要求的连接路径的概率的安排和方法。这些改进提供了分组交换机增强的路径选择，其将改善网络（包括平面网络和并入这种交换机的分层网络）的资源利用。后一种类型的网络运行PNNI v1.0标准中的路径选择算法，其中分组交换机是异步传输模式交换机。两种增强型延迟路径选择模式基于两种不同的累积方法，即加法法和渐近法。

3. 发明授权

US06661797B1 Quality of service based path selection for connection-oriented networks 有权
标题翻译：面向连接的网络的基于服务质量的路径选择
公开(公告)号：US06661797B1
公开(公告)日：2003-12-09
申请号：US09514725
申请日：2000-02-28
申请人： Ashish Goel , Deepak Kataria , Dimitris Logothetis , Kajamalai Gopalaswamy Ramakrishnan
发明人： Ashish Goel , Deepak Kataria , Dimitris Logothetis , Kajamalai Gopalaswamy Ramakrishnan
IPC分类号： H04L1228
CPC分类号： H04L45/00 , H04L45/121
摘要： Arrangements and methods for efficiently selecting an optimum connection path that meets user specified delay requirements with enhanced efficiency. In a basic aspect, a method is implemented by one of a plurality of algorithms to meet user QoS specifications. The user not only specifies a delay threshold T for the incoming request but also specifies a delay threshold tolerance &egr; for the path delay that will satisfy him. Two implementations are disclosed. The first is termed non-iterative and sets scaling factor &tgr;=min (T, (n−1)/&egr;), where n is a number of links in a shortest path, scales all the relevant delay parameters by &tgr;/T, truncates all the scaled values to integers, and uses a dynamic programming algorithm to accumulate the total of resulting link delay parameters values for each possible shortest path. The second method, termed iterative, is similar, except that it sets &tgr;
摘要翻译：有效选择满足用户指定的延迟要求并提高效率的最佳连接路径的安排和方法。在一个基本方面，一种方法由多种算法中的一种来实现，以满足用户QoS规范。用户不仅为传入请求指定了延迟阈值T，还指定了将满足他的路径延迟的延迟阈值容差ε。公开了两种实现方式。第一个称为非迭代，并设置缩放因子τt = min（T，（n-1）/ epsilon），其中n是最短路径中的链路数，将所有相关延迟参数缩放为tau / T，截断将所有缩放的值作为整数，并使用动态编程算法来累积每个可能的最短路径的结果链路延迟参数值的总和。称为迭代的第二种方法是类似的，只是它设置tau << T。然后，如果缩放，截断和累加步骤不能满足客户规格，则下一次迭代将两倍。两种方法都以计算有效的方式计算从一个源到所有目的地的路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式