中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

47 records (took 0.024 seconds)

    METHOD FOR SHARED MEMORY MANAGEMENT IN NETWORK NODES
    24.
    发明专利
    METHOD FOR SHARED MEMORY MANAGEMENT IN NETWORK NODES 未知

    公开(公告)号：CA2213423A1

    公开(公告)日：1998-04-24

    申请号：CA2213423

    申请日：1997-08-18

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： MITRA DEBASIS

    IPC: H04Q3/00 ,  H04L12/56 ,  H04Q11/04 ,  H04L12/26

    Abstract: The invention concerns a method for a multi-port node having a shared buffer memory to provide enhanced data packet buffering capacity for established virtua l circuits (VC's) through the node and one of its output ports while maintaining grades of service commitments. The method admits incoming data packets to a node for an established VC based on a determination of combination of factors including the effective memory requirements for each output port as VC's are created or terminated, the portions of buffer memory in use for conveying packet s through the intended output port for the incoming packet, and the total amount o f available shared memory in the node. Such determinations enable the node to better decide whether admitting the incoming packet would cause a disproportionate allocation of the shared memory for the intended output port. A s a consequence, a relatively high packet buffering capacity can be achieved substantially without violating grades of service commitments.

    25.
    发明专利
    未知

    公开(公告)号：DE69737343D1

    公开(公告)日：2007-03-29

    申请号：DE69737343

    申请日：1997-10-14

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： MITRA DEBASIS

    IPC: H04Q3/00 ,  H04Q11/04 ,  H04L12/56

    Abstract: The invention concerns a method for a multi-port node (110) having a shared buffer memory (240) to provide enhanced data packet buffering capacity for established virtual circuits (VC's) through the node and one of its output ports (220) while maintaining grades of service commitments. The method admits incoming data packets to a node for an established VC based on a determination of combination of factors including the effective memory requirements for each output port as VC's are created or terminated, the portions of buffer memory in use for conveying packets through the intended output port for the incoming packet, and the total amount of available shared memory in the node. Such determinations enable the node to better decide whether admitting the incoming packet would cause a disproportionate allocation of the shared memory for the intended output port. As a consequence, a relatively high packet buffering capacity can be achieved substantially without violating grades of service commitments.

    TRAFFIC SHAPER FOR NETWORK NODES AND METHOD THEREOF
    28.
    发明专利
    TRAFFIC SHAPER FOR NETWORK NODES AND METHOD THEREOF 未知

    公开(公告)号：CA2232144C

    公开(公告)日：2002-03-26

    申请号：CA2232144

    申请日：1998-03-16

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： ELWALID ANWAR ,  MITRA DEBASIS

    IPC: H04Q3/00 ,  H04L12/56 ,  H04Q11/04 ,  H04L12/02

    Abstract: The traffic shaping system according to the principles of the present invent ion increases the connection-carrying capacity of a network node by shaping the data cells to increase the admissible number of connections. In accordance with certain embodiments of the present invention, the traffic shaping system uses a data buffer at the ingress of the network node to selectively buffer classes of data cells. As such, the traffic shaping system exploits differences in delay tolerances between traf fic classes to shape the less delay sensitive traffic classes to reduce the effective bandw idth of a connection of the particular traffic class and thereby increase the nodal connection-carrying capacity. Certain embodiments of the traffic shaping sys tem operate within a framework to provide parameters for the traffic shaping system which increas e the connection-carrying capacity for the node while meeting quality of service requirements for the data cells. In accordance with certain embodiments, an integrated regulator and shaper is provided which concurrently regulates and shapes the traffic cells to increase the nodal connection-carrying capacity.

    ADAPTIVE ROUTING SYSTEM AND METHOD FOR QOS PACKET NETWORKS
    29.
    发明专利
    ADAPTIVE ROUTING SYSTEM AND METHOD FOR QOS PACKET NETWORKS 未知

    公开(公告)号：CA2299111A1

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

    申请号：CA2299111

    申请日：2000-02-23

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： STILIADIS DIMITRIOS ,  RAMAKRISHNAN KAJAMALAI GOPALAS ,  MITRA DEBASIS ,  LAKSHMAN TIRUNELL V ,  AUKIA PETRI

    IPC: H04M3/00 ,  H04L12/56

    Abstract: A packet network employs routers that determine network routing based on quality of service (QoS) provisioning parameters and network topology information. QoS provisioning parameters are provided to each router from a network management database, and the network topology information is determined from a link state database of the router. The link state database may include network topology information collected by the router in accordance with the open shortest path protocol (OSPF). A network link, router, or other node failure initiates a new path-selection process. First, a temporary set of provisioning entries may be determined with a shortest path first (SPF) routing method. Then, the network packet flows may be classified into packet flows, real-time and non-real-time, and then as packet flows that require reserved bandwidth or that may be multiplexed. A multicommodity flow (MCF) routing method is then employed to determine an optimized set of candidate provisioning entries for the packet flows that may be multiplexed. The MCF routing method determines new routing for the packet flows based on QoS provisioning commitments as parameters. The MCF routing method determines the new routing based on an optimization criterion, such as maximized revenue. Once the new routing is determined, routing of network traffic is enabled by converting the provisioning entries into filter rules, which are then loaded into the packet classifier of the router.

    METHOD FOR SHARING NETWORK RESOURCES BY VIRTUAL PARTITIONING
    30.
    发明专利
    METHOD FOR SHARING NETWORK RESOURCES BY VIRTUAL PARTITIONING 未知

    公开(公告)号：CA2197585C

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

    申请号：CA2197585

    申请日：1997-02-14

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： MITRA DEBASIS ,  ZIEDINS ILZE

    IPC: H04L12/56 ,  H04Q11/04 ,  H04L12/24 ,  H04Q3/70

    Abstract: A method of operating a network by sharing resources associated with various classes among calls in the various classes according to a state dependent reservation parameter. Nominal amounts of one or more resources are allocated to each call class. When a call of a class of service operating in the network requires resources in excess of those allocated to the class, resources allocated to other classes of service are advantageously shared with the class of service. The sharing is based on a reservation parameter associated with the class of service of the call. The reservation parameter is advantageously a function of the network state. The role of the reservation parameter is to protect underloaded classes (i.e., those classes not using all of their allocated nominal capacity) from excessive borrowing by overloaded classes (i.e., classes using more than their allocated nominal capacity). More generally, the inventive method is used to determine if sufficient resources are available for routing calls and to route calls based on the determined available resources.

Patent Agency Ranking