-
公开(公告)号：DE69920893D1
公开(公告)日：2004-11-11
申请号：DE69920893
申请日：1999-07-13
Applicant: IBM
Inventor： FICHOU ALINE , LE PENNEC JEAN-FRANCOIS , GALAND CLAUDE
IPC: H04L12/54 , H04L47/762 , H04Q11/04 , H04L12/56
Abstract: Disclosed herein is a connection bandwidth management process and system for use in a high speed packet switching network. The network comprises a plurality of switching nodes interconnected through a plurality of communication links. Each of the switching nodes comprises means for switching packets from at least one input link to at least one output link. Each of the output links are coupled to at least one buffer in the switching node for queuing packets before they are transmitted over the output link. Each of the communication links supports the traffic of a plurality of user connections statistically multiplexed over the link. Each user connection is allocated an initial agreed-upon bandwidth through the network, with each of the communication links being possibly oversubscribed. The connection bandwidth management process according to the invention comprises the steps of: Link monitoring data on the communication links are periodically received in a network monitoring center, and stored in a computer memory in the network monitoring center. Then, one monitored link is selected and the corresponding link monitoring data are retrieved from the computer memory. The link monitored data retrieved for the selected link is analyzed, and it is determined whether the selected link is oversubscribed or not. If it is determined that the selected link is oversubscribed and that the link monitoring data for the selected link satisfies at least one predetermined condition the bandwidth initially allocated to each of the connections boarded on the selected link is reallocated, such that, the sum of the reallocated bandwidth of the connections boarded on the selected link is less or equal to the total bandwidth capacity of the selected link. The process recycles until all the monitored links have been selected.
-
公开(公告)号：DE69330675T2
公开(公告)日：2002-06-13
申请号：DE69330675
申请日：1993-06-03
Applicant: IBM
Inventor： GALAND CLAUDE , LEBIZAY GERALD
Abstract: A packet switching communication system is improved by using a packet header structure which does not require a fixed format. The packet header comprises a chain of 2 byte command/data segments. Each command/data segment contains generic bits and a routing field. One of the generic bits (bit 1) allows the header to be extended with another command/data segment.
-
公开(公告)号：AT208109T
公开(公告)日：2001-11-15
申请号：AT93480105
申请日：1993-07-30
Applicant: IBM
Inventor： GALAND CLAUDE , SCOTTON PAOLO
Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure : a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.
-
公开(公告)号：DE69330675D1
公开(公告)日：2001-10-04
申请号：DE69330675
申请日：1993-06-03
Applicant: IBM
Inventor： GALAND CLAUDE , LEBIZAY GERALD
Abstract: A packet switching communication system is improved by using a packet header structure which does not require a fixed format. The packet header comprises a chain of 2 byte command/data segments. Each command/data segment contains generic bits and a routing field. One of the generic bits (bit 1) allows the header to be extended with another command/data segment.
-
公开(公告)号：DE69305734T2
公开(公告)日：1997-05-15
申请号：DE69305734
申请日：1993-06-30
Applicant: IBM
Inventor： GALAND CLAUDE , MAUDUIT DANIEL , PAUPORTE ANDRE , SPAGNOL VICTOR , LEBIZAY GERALD , MUNIER JEAN-MARIE , SAINT-GEORGES ERIC
IPC: H04L29/06
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
Patent Agency Ranking
公开(公告)号：DE69305734D1
公开(公告)日：1996-12-05
申请号：DE69305734
申请日：1993-06-30
Applicant: IBM
Inventor： GALAND CLAUDE , MAUDUIT DANIEL , PAUPORTE ANDRE , SPAGNOL VICTOR , LEBIZAY GERALD , MUNIER JEAN-MARIE , SAINT-GEORGES ERIC
IPC: H04L29/06
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
公开(公告)号：BR9402596A
公开(公告)日：1995-06-13
申请号：BR9402596
申请日：1994-06-29
Applicant: IBM
Inventor： GALAND CLAUDE , LEBIZAY GERALD , MAUDUIT DANIEL , MUNIER JEAN-MARIE , PAUPORTE ANDRE , SAINT-GEORGES ERIC , SPAGNOL VICTOR
Abstract: A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises means for buffering (132) said data packets, means for identifying said buffering means and said data packets in said buffering means, means for queueing (Figure 15) in storing means (131) said identifying means in a single instruction, means for dequeueing (Figure 16) from said storing (131) means said identifying means in another single instruction , means for releasing said buffering means, Each instruction comprises up to three operations executed in parallel by said processing means : an arithmetical and logical (ALU) operation on said identifying means, a memory operation on said storing means, and a sequence operation.
-
公开(公告)号：DE68916944T2
公开(公告)日：1995-03-16
申请号：DE68916944
申请日：1989-04-11
Applicant: IBM
Inventor： GALAND CLAUDE , ROSSO MICHELE
-
公开(公告)号：CA2123449A1
公开(公告)日：1995-01-31
申请号：CA2123449
申请日：1994-05-12
Applicant: IBM
Inventor： ALFONSI JEAN-PIERRE , GALAND CLAUDE , LEBIZAY GERALD , MAUREL OLIVIER
IPC: H04L12/56
Abstract: Currently, the routing algorithms compute all the available paths in the network, from the source node to the destination node before to select the optimal route. No assumption is made on the network topology and the route computation is often time and resource consuming. Some paths which are calculated are not acceptable due to the particular geographical configuration of the network. In the real world, large transport networks are not fully meshed. The present invention is based on the observation that networks are usually built around a hierarchical structure. A set of nodes, interconnected by high throughput lines, are used to build a 'Backbone' (401) with a high degree of meshing to allow the redundancy and reliability required by the user. The other nodes or 'local' nodes (404) are attached to one or several backbone nodes. It is the network designer responsibility, at the configuration time to define for each node what is its attribution : backbone (402) or local node (404). The list of the node attributions appears in the topology table (306) and is updated each time a node is added to or dropped from the network. The routing algorithm can take advantage of the particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are eligible and are taken in account by the algorithm in the optimal route search. The object of the invention is to split the network in backbone and local nodes to speed up the path selection.
-
公开(公告)号：DE3785189T2
公开(公告)日：1993-10-07
申请号：DE3785189
申请日：1987-04-22
Applicant: IBM
Inventor： GALAND CLAUDE
Abstract: The process for slowing-down/speeding up a speech signal involves splitting at least a portion of the speech frequency bandwidth into N narrow sub-bands, processing each sub-band signal contents to derive therefrom magnitude data M(i, n) and phase data P(i,n), i= 1, ..,N being the subband index and n the time index. The M (i, n) sequence is converted into a sequence M'(n) by either duplicating one sample every K samples (K being an integer value derived from the desired slowing-down/speeding up ratio). The phase sequence P (i,n) is processed to derive therefrom an increment sequence D(i,n) = P(i,n) - P(i, n-1), which increment sequence is first converted into a D'(i, n) sequence by either dropping or duplicating one sample every K, samples, before being converted into P'(i,n) = P(i,n) + D'(i, n). Said P'(i,n), D'(i,n) sequences are converted back into sub-band signals contents, then combined together into the slowed-down/speeded-up speech signal.
-
-
-
-
-
-
-
-
-
Search Results
77
records
(took 0.019 seconds)
