公开(公告)号：US20120224477A1

公开(公告)日：2012-09-06

申请号：US13039220

申请日：2011-03-02

申请人： Chandramouli Balasubramanian ,  V.S. Jagannadham (Jack) Jonnalagadda ,  Brian Kean ,  Xianghai Yu ,  Zoltán Tóth

发明人： Chandramouli Balasubramanian ,  V.S. Jagannadham (Jack) Jonnalagadda ,  Brian Kean ,  Xianghai Yu ,  Zoltán Tóth

IPC分类号： H04L12/56

CPC分类号： H04L45/125 ,  H04L45/245

摘要： A method and system for reducing congestion and latency in a communication system by creating a pruned forwarding set for scalable tunneling applications. The communication system provides a communication link between a mobile communication device and a network, such as the Internet. The method entails using information included within a data packet to determine a corresponding tunnel peer address, which is then resolved onto a set of paths. Each path includes respective adjacency information. A determination of whether to prune each respective path is made by using the respective adjacency information. The pruned set of paths is used to identify available paths for the communication link. By pruning in this manner, the line card being used as the home slot for a given session may also be used as the egress slot, thereby reducing congestion and latency in the communication system.

摘要翻译： 一种用于通过为可扩展隧道应用创建修剪的转发集合来减少通信系统中的拥塞和等待时间的方法和系统。 通信系统提供移动通信设备和诸如因特网之类的网络之间的通信链路。 该方法需要使用包括在数据分组内的信息来确定对应的隧道对等体地址，然后将其解析到一组路径上。 每个路径包括各自的邻接信息。 通过使用相应的邻接信息来确定是否修剪每个相应的路径。 修剪的路径集合用于标识通信链路的可用路径。 通过以这种方式修剪，用作给定会话的归属时隙的线路卡也可以用作出口时隙，从而减少通信系统中的拥塞和等待时间。