利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.023 秒)

    Decision support mechanisms for bandwidth commerce in communication networks
    1.
    发明授权
    Decision support mechanisms for bandwidth commerce in communication networks 有权
    通信网络中带宽商务的决策支持机制

    公开(公告)号：US07123588B2

    公开(公告)日：2006-10-17

    申请号：US10163140

    申请日：2002-06-04

    申请人： Debasis Mitra ,  Qiong Wang ,  Kajamalai Gopalaswamy Ramakrishnan

    发明人： Debasis Mitra ,  Qiong Wang ,  Kajamalai Gopalaswamy Ramakrishnan

    IPC分类号： H04L12/28 ,  H04L12/56 ,  G06F15/173

    CPC分类号： H04L41/147 ,  H04L41/0896 ,  H04L47/15 ,  H04L47/70 ,  H04L47/787

    摘要： A method is provided for a dynamic optimization of network resource allocation on the part of a network service provider. In particular, the method of the invention provides an analytical framework for a determination by network service providers of an optimal resource allocation among links in a service provider's own network and links obtained from other network service providers. The analytical framework of the invention also incorporates, as a parameter, the provision of link capacity to other network service providers in the determination of an optimal resource allocation. In a preferred embodiment of the invention, such an optimal resource allocation is determined in respect to revenue maximization for the network service provider.

    摘要翻译： 提供了一种用于网络服务提供商的网络资源分配的动态优化的方法。 具体地，本发明的方法提供了一种用于由网络服务提供商确定服务提供商自己的网络中的链路之间的最佳资源分配以及从其他网络服务提供商获得的链路的分析框架。 作为参数，本发明的分析框架还包括在确定最佳资源分配时向其他网络服务提供商提供链路容量。 在本发明的优选实施例中，关于网络服务提供商的收入最大化来确定这样的最佳资源分配。

    Multicommodity flow method for designing traffic distribution on a multiple-service packetized network
    3.
    发明授权
    Multicommodity flow method for designing traffic distribution on a multiple-service packetized network 有权
    用于设计多业务分组网络上的流量分配的多业务流方法

    公开(公告)号：US06721270B1

    公开(公告)日：2004-04-13

    申请号：US09370826

    申请日：1999-08-09

    申请人： Debasis Mitra ,  Kajamalai Gopalaswamy Ramakrishnan

    发明人： Debasis Mitra ,  Kajamalai Gopalaswamy Ramakrishnan

    IPC分类号： H04L1228

    CPC分类号： H04L49/25 ,  H04L49/205 ,  H04L2012/562 ,  H04L2012/5621 ,  H04L2012/5623 ,  H04L2012/5632 ,  H04L2012/5638 ,  H04L2012/5684 ,  H04Q11/0478

    摘要： A method is described for solving traffic engineering problems in a network. In one aspect, the invention is used in a network that has at least one QoS service class and at least one class of service that is not a QoS class. Bandwidth is allocated to service routes in the QoS service class so as to optimize a figure of merit such as network revenue. Then a new allocation is made so as to minimize network usage without departing too far from the optimal value of the figure of merit. A residual network consists of that bandwidth that remains unallocated, on each link of the network. Bandwidth for non-QoS traffic is allocated to routes on the residual network. In a second aspect, the invention involves the use of optimization techniques to allocate bandwidth among service routes in one or more service classes in response to a set of demands in each class. The demands are calculated so as to take into account an effective bandwidth associated with the pertinent class, and so as to make allowance for the stochastic behavior of the traffic demands that occur in practice.

    摘要翻译： 描述了一种解决网络中流量工程问题的方法。 一方面，本发明用于具有至少一个QoS服务类别和不是QoS类别的至少一类服务的网络。 带宽被分配给QoS服务类中的服务路由，以优化诸如网络收入的品质因数。 然后进行新的分配，以便最小化网络使用，而不会偏离品质因数的最佳值。 残留网络由在网络的每个链路上保持未分配的带宽组成。 非QoS流量的带宽被分配给剩余网络上的路由。 在第二方面，本发明涉及使用优化技术来响应于每个类中的一组需求来在一个或多个服务类别中的服务路由之间分配带宽。 计算要求，以考虑与相关班级相关的有效带宽，并对实际发生的交通需求的随机行为进行补贴。

    Apparatus and method for template-based scheduling processes using regularity measures
    6.
    发明授权
    Apparatus and method for template-based scheduling processes using regularity measures 失效
    使用规范性措施的基于模板的调度过程的装置和方法

    公开(公告)号：US5970049A

    公开(公告)日：1999-10-19

    申请号：US825240

    申请日：1997-03-27

    申请人： Simon C. Borst ,  Kajamalai Gopalaswamy Ramakrishnan

    发明人： Simon C. Borst ,  Kajamalai Gopalaswamy Ramakrishnan

    IPC分类号： H04J3/00 ,  H04L12/56 ,  H04Q3/00

    CPC分类号： H04L12/5602 ,  H04L2012/5619 ,  H04L2012/5649 ,  H04L2012/5679

    摘要： An advantageous measurement technique for evaluating the overall scheduling regularity producible by a scheduling template having particular slot assignment orderings for respective classes of events such as, for example, transmitting order of communication signals over respective virtual circuits by a node of a network. This measurement technique is used for measuring the overall scheduling regularity producible by each of a plurality of different scheduling templates to select the template having a desirable regularity measure for use in establishing a scheduling order of events for a network.

    摘要翻译： 一种有利的测量技术，用于评估具有针对各种事件的特定时隙分配排序的调度模板产生的整体调度规则性，例如由网络的节点通过各个虚拟电路的通信信号的发送顺序。 该测量技术用于测量由多个不同调度模板中的每一个产生的整体调度规则，以选择具有用于建立网络的事件的调度顺序的期望的规则度量的模板。

    Quality of service based path selection for connection-oriented networks
    7.
    发明授权
    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。 然后，如果缩放，截断和累加步骤不能满足客户规格，则下一次迭代将两倍。 两种方法都以计算有效的方式计算从一个源到所有目的地的路径。

    Method of designing signaling networks for internet telephony
    8.
    发明授权
    Method of designing signaling networks for internet telephony 失效
    网络电话信令网络的设计方法

    公开(公告)号：US06687363B1

    公开(公告)日：2004-02-03

    申请号：US09517658

    申请日：2000-03-03

    申请人： Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

    发明人： Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

    IPC分类号： H04M700

    CPC分类号： H04Q3/66 ,  H04M7/006

    摘要： A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.

    摘要翻译： 公开了一种用于设计用于互联网电话的呼叫协调器（CC）的信令网络的方法。 该新方法可用于设计任意大小的CC网络，其高概率地限制每CC的最大插座数以及网络中任意一对交换机之间的最大跳数。 根据所公开的方法，CC的网络最初被视为孤立点的集合，每个CC是一个点。 然后，在成对的CC之间添加链路，不包括位于同一交换机内的对。 链接是随机添加的，但具有特定概率p，对于不同的对可能是不同的。 因此，给定的链接是否被添加取决于实际上是一个加载的硬币的结果，其中肯定结果的概率是p。

    Method of admission control and routing of virtual circuits
    9.
    发明授权
    Method of admission control and routing of virtual circuits 失效
    虚拟电路的准入控制和路由方法

    公开(公告)号：US06175870B1

    公开(公告)日：2001-01-16

    申请号：US08565737

    申请日：1995-11-30

    申请人： Rainer Gawlick ,  Anil P. Kamath ,  Serge Plotkin ,  Kajamalai Gopalaswamy Ramakrishnan

    发明人： Rainer Gawlick ,  Anil P. Kamath ,  Serge Plotkin ,  Kajamalai Gopalaswamy Ramakrishnan

    IPC分类号： G06F15173

    CPC分类号： H04L45/42 ,  H04L45/10 ,  H04L45/122 ,  H04L45/127 ,  H04L45/22 ,  H04L45/44 ,  H04L2012/562 ,  H04L2012/5629 ,  H04L2012/563 ,  H04Q11/0478

    摘要： A method of admitting and routing switched virtual circuit requests in a network first finds a set of routing paths on which a requested VC may be routed by using a two step process. The method uses a cost function based on a parameter related to the number of hops in a subset of VC connections previously made in the network to determine potential routing paths on which the VC can be routed at a cost below a specified threshold. The method next checks to determine which potential routing paths comprise links and nodes with sufficient resources to accommodate the request. Paths satisfying both steps are output as a set of routing paths and then a second criterion is used to select a path from the set on which to route the request. In a distributed routing system, the inventive method uses a local network state to determine the cost function and the set of routing paths. The method further updates local state information at nodes along a path selected from the set and permits other paths from the set to be selected for routing a requested VC if the previously selected path has insufficient resources to accommodate the request.

    摘要翻译： 在网络中接纳和路由交换虚拟电路请求的方法首先找到一组路由路径，通过使用两步过程可以在其上路由所请求的VC。 该方法使用基于与先前在网络中进行的VC连接的子集中的跳数相关的参数的成本函数来确定VC可以以低于指定阈值的成本进行路由的潜在路由路径。 该方法接下来检查以确定哪些潜在路由路径包括具有足够资源以容纳该请求的链路和节点。 满足两个步骤的路径被输出为一组路由路径，然后使用第二准则来从路由请求的集合中选择路径。 在分布式路由系统中，本发明的方法使用本地网络状态来确定成本函数和路由路径集合。 该方法进一步更新沿着从组中选择的路径的节点处的本地状态信息，并且如果先前选择的路径具有足够的资源以容纳该请求，则允许来自该集合的其他路径被选择用于路由请求的VC。

    Apparatus and method for template-based scheduling processes using regularity measure lower bounds
    10.
    发明授权
    Apparatus and method for template-based scheduling processes using regularity measure lower bounds 失效
    用于基于模板的调度过程的装置和方法，其使用规则度量下限

    公开(公告)号：US6016305A

    公开(公告)日：2000-01-18

    申请号：US835047

    申请日：1997-03-27

    申请人： Simon C. Borst ,  Kajamalai Gopalaswamy Ramakrishnan

    发明人： Simon C. Borst ,  Kajamalai Gopalaswamy Ramakrishnan

    IPC分类号： H04J3/00 ,  H04L12/56 ,  H04Q3/00 ,  G01R31/08 ,  G06F11/00 ,  G08C15/00

    CPC分类号： H04L12/5602 ,  H04L2012/5619 ,  H04L2012/5649 ,  H04L2012/5679

    摘要： An advantageous scheduling template slot ordering for use in establishing a scheduling order of events such as transmitting communication signals in a communication network is determined by assigning at least two initial slot positions to a particular signal class and then determining a regularity measure based on a lower bound for the regularity measure of such assignments and the remaining unassigned slot positions. This lower bound for the regularity measure of the unassigned slots is advantageously based on a hypothetical assignment of fractions of the slot positions to different signal classes instead of limiting the assignment of a slot to a single signal class. This fractional slot assignment produces a regularity measure that is better than or equal to a corresponding regularity measure based on assigning a whole slot to a particular signal class. The lower bound of the regularity measure is then compared with a threshold regularity measure, such as from a known reference scheduling template. If the threshold regularity measure is lower than the determined lower bound, then it is known that the reference template would provide a more desirable regularity of events than any template having the assigned slot positions to that particular signal class. As a consequence, other slot assignments can be compared to the reference template to rapidly identify scheduling templates with enhanced regularity characteristics.

    摘要翻译： 通过将至少两个初始时隙位置分配给特定信号类，然后基于下限确定规则性度量来确定用于建立诸如在通信网络中发送通信信号的事件的调度顺序的有利的调度模板时隙排序 对于这种分配的规则性度量和剩余的未分配的位置。 对于未分配时隙的规则度量的这个下限有利地基于对不同信号类别的时隙位置的分数的假设分配，而不是将时隙的分配限制到单个信号类。 该分数时隙分配产生基于将整个时隙分配给特定信号类而优于或等于对应规则度量的规则度量。 然后将规则度量的下限与阈值规则度量进行比较，例如从已知的参考调度模板。 如果阈值规则度量低于确定的下限，则已知参考模板将提供比具有指定的时隙位置到该特定信号类别的任何模板更理想的事件规则性。 因此，可以将其他插槽分配与参考模板进行比较，以快速识别具有增强的规律性特征的调度模板。