公开(公告)号：US07593321B2

公开(公告)日：2009-09-22

申请号：US10634060

申请日：2003-08-04

申请人： Claude Galand ,  Olivier Bertin ,  Olivier Maurel ,  Laurent Nicolas ,  Aline Fichou

发明人： Claude Galand ,  Olivier Bertin ,  Olivier Maurel ,  Laurent Nicolas ,  Aline Fichou

IPC分类号： H04L12/407

CPC分类号： H04L45/28 ,  H04L1/22 ,  H04L45/00 ,  H04L45/22

摘要： A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.

摘要翻译： 公开了一种用于操作计算机网络中的节点的方法，其中网络由通过链路连接的节点组成。 该方法具有以下步骤：确定一个或多个链路的备用路径; 为备用路径预留资源; 并在链路故障的情况下重新路由备用路径上的流量。 备用路径可以定期更新。 可以维持多个备选路径。 备用路径可能没有任何共同的链接。 在主路径发生故障的情况下，用户流量可能会基本同时重新路由到备用路径的每个链路。

公开(公告)号：US06400681B1

公开(公告)日：2002-06-04

申请号：US08834679

申请日：1997-04-01

申请人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

发明人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

IPC分类号： H04L1256

CPC分类号： H04L49/253 ,  H04L49/205 ,  H04L49/206 ,  H04L49/256 ,  H04L49/3081 ,  H04L49/50 ,  H04L2012/5619

摘要： The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. A path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.

摘要翻译： 本发明涉及一种高速分组交换网络，特别涉及用于最小化建立起始节点和目的地节点之间的连接的时间的方法和系统。 在请求连接时计算的路径被记录在路由数据库中，并且每次在网络中发生修改时更新。 此外，当连接建立进程空闲时，可以计算并存储用于支持故障或抢占时的非破坏性路径切换的备用路径和朝向潜在目的地节点的新路径。 这些最后的操作在后台执行，处理优先级低，没有连接请求。

公开(公告)号：US06934249B1

公开(公告)日：2005-08-23

申请号：US10158624

申请日：2002-05-30

申请人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

发明人： Olivier Bertin ,  Gerard Brun ,  Claude Galand ,  Olivier Maurel ,  Laurent Nicolas

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L45/10 ,  H04L47/12 ,  H04L47/15 ,  H04L47/70 ,  H04L47/724 ,  H04L47/746 ,  H04L47/801 ,  H04L47/822 ,  H04L47/829

摘要： The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. Due to high dynamicity of the traffic on transmission links, it is important to select a routing path according to a fully up-to-date information on all network resources. The simpler approach is to calculate a new path for each new connection request. This solution may be very time consuming because there are as many path selection operations as connection set up operations. On another hand, the calculation of paths based on an exhaustive exploration of the network topology, is a complex operation which may also take an inordinate amount of resources in large networks. Many of connections originated from a network node flow to the same destination network node. It is therefore possible to take a serious benefit in reusing the same already calculated paths for several connections towards the same node. The path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.

摘要翻译： 本发明涉及一种高速分组交换网络，特别涉及用于最小化建立起始节点和目的地节点之间的连接的时间的方法和系统。 由于传输链路上的流量的高动态性，根据所有网络资源的完全最新信息选择​​路由路径很重要。 更简单的方法是为每个新的连接请求计算一个新路径。 该解决方案可能非常耗时，因为存在与连接建立操作相同的路径选择操作。 另一方面，基于网络拓扑的详尽探索的路径计算是一种复杂的操作，在大型网络中也可能占用过多的资源。 许多来自网络节点的连接流到同一目标网络节点。 因此，可以在对相同节点的多个连接重复使用相同的已经计算的路径方面有很大的益处。 在请求连接时计算的路径被记录在路由数据库中，并且每次在网络中发生修改时更新。 此外，当连接建立进程空闲时，可以计算并存储用于支持故障或抢占时的非破坏性路径切换的备用路径和朝向潜在目的地节点的新路径。 这些最后的操作在后台执行，处理优先级低，没有连接请求。

公开(公告)号：US06226266B1

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

申请号：US08946237

申请日：1997-10-07

申请人： Claude Galand ,  Maurice Duault ,  Aline Fichou ,  Olivier Bertin

发明人： Claude Galand ,  Maurice Duault ,  Aline Fichou ,  Olivier Bertin

IPC分类号： H04L1256

CPC分类号： H04Q11/0478 ,  H04L2012/5671 ,  H04L2012/5684

摘要： An apparatus and method that determines the end-to-end transit delay at each node of a path, in accordance with the selected probability value indicative of the probability to experience a delay at each node that is smaller than the computed transit delay. Then the computed transit delays per nodes are combined to obtain the end-to-end delay of the path, the combination being either an arithmetic operation or a convolution operation. A method to approximate the convolution operation is also disclosed.

摘要翻译： 根据所选择的概率值，其指示在每个节点处经历比所计算的过渡延迟小的延迟的概率，确定路径的每个节点处的端到端传输延迟的装置和方法。 然后将每个节点的计算的传输延迟组合以获得路径的端到端延迟，该组合是算术运算或卷积运算。 还公开了近似卷积运算的方法。

公开(公告)号：US06690678B1

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

申请号：US09437820

申请日：1999-11-10

申请人： Claude Basso ,  Aline Fichou ,  Claude Galand ,  Laurent Nicolas

发明人： Claude Basso ,  Aline Fichou ,  Claude Galand ,  Laurent Nicolas

IPC分类号： H04J1500

CPC分类号： H04L12/5602 ,  H04L2012/5619 ,  H04L2012/5634 ,  H04Q11/0478

摘要： The present invention relates to a system and method for dynamically adjusting the bandwidth of a continuous bit rate virtual path connection established between a source node and a destination node within a packet or cell switching network comprising a plurality of nodes interconnected with transmission links. In the network, a bandwidth management server having access to information concerning network nodes and transmission links is defined. This server is informed each time a virtual path connection or a virtual channel connection is established on the network with an indication concerning the initial bandwidth reserved for said connection. The server detects and shares, on a continuous or periodical mode, the bandwidth which is available on transmission links among the bandwidth adjustable continuous bit rate virtual path connections and determines for each connection a new bandwidth. The source node is informed each time a new bandwidth is computed. It adjusts the bandwidth of the corresponding bandwidth adjustable continuous bit rate virtual path connection accordingly.

摘要翻译： 本发明涉及一种系统和方法，用于动态地调整在包括与传输链路互连的多个节点的分组或小区交换网络内的源节点和目的地节点之间建立的连续比特率虚拟路径连接的带宽。 在网络中，定义了具有访问有关网络节点和传输链路的信息的带宽管理服务器。 每当在网络上建立虚拟路径连接或虚拟通道连接时，通知该服务器，并显示关于为所述连接保留的初始带宽。 服务器以连续或周期模式检测和共享带宽可调连续比特率虚拟路径连接之间的传输链路上可用的带宽，并为每个连接确定新的带宽。 每次计算新的带宽时通知源节点。 它相应地调整相应带宽可调连续比特率虚拟路径连接的带宽。

公开(公告)号：US6011804A

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

申请号：US771333

申请日：1996-12-16

申请人： Olivier Bertin ,  Claude Galand ,  Olivier Maurel

发明人： Olivier Bertin ,  Claude Galand ,  Olivier Maurel

IPC分类号： H04L12/54 ,  H04L12/70 ,  H04J3/16 ,  G01R31/08 ,  H04L12/28

CPC分类号： H04L12/5602 ,  H04L2012/5619 ,  H04L2012/563 ,  H04L2012/5632

摘要： A method and system for reserving dynamically and in priority for each link of the network the exact amount of bandwidth necessary for the transmission of the network control traffic. An evaluation of the expected control traffic on each link of the network is performed in order to allocate a sufficient but minimum fraction of the link bandwidth and for allocating the maximum available bandwidth for the user traffic.

摘要翻译： 一种用于动态地和优先地为网络的每个链路预留传输网络控制业务所需的精确带宽量的方法和系统。 执行对网络的每个链路上的预期控制流量的评估，以便分配足够但最小的链路带宽分数并为用户分配用于业务的最大可用带宽。

公开(公告)号：US06870850B1

公开(公告)日：2005-03-22

申请号：US09512562

申请日：2000-02-24

申请人： Aline Fichou ,  Claude Galand ,  Jacques Fieschi ,  Jean-Francoise Le Pennec

发明人： Aline Fichou ,  Claude Galand ,  Jacques Fieschi ,  Jean-Francoise Le Pennec

IPC分类号： H04L12/46 ,  H04L29/06 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L29/06 ,  H04L12/4604 ,  H04L69/08 ,  H04L69/16 ,  H04L69/22 ,  H04L2212/00

摘要： A method and system of transmitting data frames from a sending unit (10) to a receiving unit (12) in a data transmission network comprising at least a backbone (14) wherein the data are transmitted over high speed links enabling long Maximum Transmission Units (MTU) between an ingress node (18) connected to the sending unit by a first access link (16) and an egress node (22) connected to the receiving node by a second access link (20), with at least one of the first and second access links being a low speed access link requiring the data frames to be segmented into short MTUs between the sending unit and the ingress node and between the egress node and the receiving unit. A plurality of consecutive segmented data frames (28) belonging to the same flow of data transmitted from the sending unit to the ingress node are assembled by the ingress node into an assembled data frame (30) corresponding to the long MTU, the assembled data frame is transmitted over the backbone from the ingress node to the egress node at a high speed authorized by the backbone links, and the assembled data frame is de-assembled into consecutive segmented data frames (32) corresponding to the short MTUs by the egress node before being transmitted to the receiving unit.

摘要翻译： 一种将数据帧从发送单元（10）发送到至少包括主干（14）的数据传输网络中的接收单元（12）的方法和系统，其中所述数据通过高速链路传输，从而能够实现长的最大传输单元 在由第一接入链路（16）连接到发送单元的入口节点（18）和通过第二接入链路（20）连接到接收节点的出口节点（22）之间的MTU中，至少一个第一接入链路 并且第二接入链路是低速接入链路，需要将数据帧分段成发送单元和入节点之间以及出口节点与接收单元之间的短MTU。 属于从发送单元向入口节点发送的相同数据流的多个连续分段数据帧（28）由入口节点组装成对应于长MTU的组合数据帧（30），组合数据帧 以骨干链路授权的高速通过骨干网从入口节点传送到出口节点，组装好的数据帧在出口节点之前被去组装成与出口节点对应的短MTU的连续分段数据帧（32） 被发送到接收单元。

公开(公告)号：US06188698B1

公开(公告)日：2001-02-13

申请号：US09013701

申请日：1998-01-26

申请人： Claude Galand ,  Jean-Marie Munier ,  Victor Spagnol ,  Pierre-Andre Foriel ,  Jean-Marc Berthaud ,  Aline Fichou ,  Marcus Enger

发明人： Claude Galand ,  Jean-Marie Munier ,  Victor Spagnol ,  Pierre-Andre Foriel ,  Jean-Marc Berthaud ,  Aline Fichou ,  Marcus Enger

IPC分类号： G01R3108

CPC分类号： H04L47/2433 ,  H04L47/10 ,  H04L47/20 ,  H04L47/29 ,  H04L47/50 ,  H04L47/522 ,  H04L47/60 ,  H04L47/6225 ,  H04L47/625 ,  H04L49/3081 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04Q11/0478

摘要： A packet scheduling system for use in a switching node of a high speed packet switching network. Incoming packets are enqueued in connection queues. Each connection is classified as red (exceeding traffic profile) or green (within traffic profile). QOS priority is also identified for each connection. Packets are dequeued for transmission as a function of priority class and connection class. Higher priority class connections have priority over lower priority class connections. Within a given priority class of connections, green connections have priority over red connections. Round robin scheduling is used for packets from connections in the same priority and connection class. In addition, a dynamic priority coupling mechanism is provided to prevent red higher priority traffic from blocking green lower priority traffic.

摘要翻译： 一种用于高速分组交换网络的交换节点的分组调度系统。 接入数据包在连接队列中排队。 每个连接分为红色（超过流量模式）或绿色（在流量模式中）。 每个连接也确定了QOS优先级。 作为优先级类和连接类的函数，数据包出队进行传输。 较高优先级的类连接优先于较低优先级的类连接。 在给定的优先级连接中，绿色连接优先于红色连接。 循环调度用于来自同一优先级和连接类的连接的数据包。 另外，提供了动态优先级耦合机制，以防止红色较高优先级的流量阻止绿色低优先级流量。

公开(公告)号：US6118791A

公开(公告)日：2000-09-12

申请号：US760202

申请日：1996-12-04

申请人： Aline Fichou ,  Pierre-Andre Foriel ,  Claude Galand

发明人： Aline Fichou ,  Pierre-Andre Foriel ,  Claude Galand

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

CPC分类号： H04L45/02 ,  H04Q11/0478 ,  H04L2012/5619 ,  H04L2012/5632

摘要： Adaptive bandwidth allocation for Non-Reserved traffic over high speed transmission links of a digital network is operated through regulation of data packet transfers over network nodes/ports including input/output adapters connected through a switching device. A network node is assigned with a Control Point computing devise (CP) storing a Topology Data Base containing an image of the network. This Data Base is periodically and at call set up updated by Topology Data Base Update messages (TDUs) including an Explicit Rate parameter for link l indicating the current available bandwidth on link l, and a parameter NNRl indicating the number of Non-Reserved connections on link l. This information are used within each Adapter to periodically regulate the transmission bandwidth assigned to each Non-Reserved traffic connection within the network. To that end, each adapter is provided with an Access Control Function device for each attached connection (data source) and a Connection Agent (CA) getting, on request, required current link informations from the attached Topology Data Base.

摘要翻译： 通过在包括通过交换设备连接的输入/输出适配器的网络节点/端口上的数据分组传输的调节来操作数字网络的高速传输链路上的非保留流量的自适应带宽分配。 网络节点被分配有存储包含网络图像的拓扑数据库的控制点计算设备（CP）。 该数据库是周期性的并且在由拓扑数据库更新消息（TDU）更新的呼叫建立中，包括用于指示链路l上的当前可用带宽的链路l的显式速率参数，以及指示非保留连接数目的参数NNR1 链接l。 该信息在每个适配器内使用以周期性地调节分配给网络内的每个非保留业务连接的传输带宽。 为此，每个适配器都具有每个连接的连接（数据源）的访问控制功能设备，连接代理（CA）根据请求从所附的拓扑数据库中获取所需的当前链接信息。

公开(公告)号：US5602830A

公开(公告)日：1997-02-11

申请号：US526345

申请日：1995-09-11

申请人： Aline Fichou ,  Pierre-Andre Foriel ,  Claude Galand

发明人： Aline Fichou ,  Pierre-Andre Foriel ,  Claude Galand

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

CPC分类号： H04L49/505 ,  H04L12/5602 ,  H04L49/503 ,  H04L2012/5615 ,  H04L2012/5616 ,  H04L2012/5619 ,  H04L2012/5632 ,  H04L2012/5636 ,  H04L2012/5649 ,  H04L2012/5679 ,  H04L2012/568 ,  H04L49/30

摘要： A method and an apparatus implementing a shaping function in a fixed length cell switching network node adapter supporting output lines in a telecommunication network. The adapter includes a Time Division Multiplexing (TDM) table where each entry is a pointer to a first cell of a queue of cells stored in the adapter for a given traffic. When a new traffic is established, the TDM table is updated. A placement device performs the pre-computation of the best placement of the entries reserved for one traffic in the TDM table. The placement device minimizes the Cell Delay Variation as computed by a Generic Cell Rate Algorithm (GCRA--ITU standard organization) policer. The Cell Delay Variation (CDV) is defined as the deviation of the placement of the cells from their ideal position in an output stream, the ideal placement being when the cells are spaced with an interval corresponding to the period of traffic negotiated at traffic establishment time. The preferred embodiment includes a scheduler which reads the TDM table and fetches the corresponding cell in the queue storage to send the cell onto the output line via a line interface unit.

摘要翻译： 一种在电信网络中支持输出线路的固定长度小区交换网络节点适配器中实现整形功能的方法和装置。 适配器包括时分复用（TDM）表，其中每个条目是指向存储在适配器中的给定业务的小区的队列的第一小区的指针。 当新流量建立时，TDM表被更新。 放置设备对TDM表中的一个业务保留的条目的最佳布局进行预先计算。 放置装置使由通用信元速率算法（GCRA-ITU标准组织）监管器计算的信元延迟变化最小化。 单元延迟变化（CDV）被定义为在输出流中单元从它们的理想位置的位置的偏离，理想的位置是当单元间隔一个对应于在交通建立时间协商的交通周期的间隔时 。 优选实施例包括调度器，其读取TDM表并且获取队列存储器中的相应小区，以经由线路接口单元将小区发送到输出线路。