中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.022 seconds)

    ROUTING METHOD TO BE USED FOR PACKET NETWORK
    1.
    发明专利
    ROUTING METHOD TO BE USED FOR PACKET NETWORK 失效

    公开(公告)号：JP2001268127A

    公开(公告)日：2001-09-28

    申请号：JP2000346176

    申请日：2000-11-14

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： ZHANG HONG ,  AHMED WALID ,  KODIALAM MURALIDHARAN SAMPATH ,  MONOGIOUDIS PANTELIS ,  REGE KIRAN M

    IPC: H04B7/26 ,  H04B7/204 ,  H04L12/28 ,  H04L12/56 ,  H04W40/20 ,  H04W40/30 ,  H04W48/08 ,  H04W64/00 ,  H04W84/18 ,  H04Q7/34

    Abstract: PROBLEM TO BE SOLVED: To provide a new routing protocol of Ad-Hoc network. SOLUTION: In this method, a source node holds the position information, routing information of all nodes inside a local node topology and the rough position information of partial nodes outside the local topology. When it is necessary for the source node to transmit a packet to a destination node inside the local topology, the routing information is already provided. When it is necessary for the source node to transmit a packet to a destination node outside the local topology, however, which node inside the local topology is closest to the destination node is specified while using the rough position information of the destination node. When this specified node is not the source node, the source node transmits the packet to the specified node and transmits the packet to the destination node later. In the other case, the packet is dropped.

    CONDITIONAL SHORTEST ROUTING METHOD
    2.
    发明专利
    CONDITIONAL SHORTEST ROUTING METHOD 失效

    公开(公告)号：JP2000196650A

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

    申请号：JP36363899

    申请日：1999-12-22

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： KODIALAM MURALIDHARAN SAMPATH ,  LAU WING CHEONG ,  YAN ANLU

    IPC: H04L12/56 ,  H04Q11/04 ,  H04L12/46 ,  H04L12/28

    Abstract: PROBLEM TO BE SOLVED: To solve the shortest route within a network under an additional delaying condition by obtaining the shortest cumulative delay to a source from a destination, generating a cumulative delaying label to a destination node (k) from a node based on this and deciding an administrative weight as a link scale based on this delaying result. SOLUTION: Dijkstra SPF is executed from a source again. The administrative weight(AW) is used as the link scale (metric) for deciding the shortest route. In this case, each node is labeled by accumulative AW from the source and a (Ds,i) label expressing accumulative delay from the source of the adjacent node (j) of a permanently labeled node (i) is updated only when (Ds,i+dj,k+δi,i) satisfies the delay restriction of end to end such as 10. It is known that a route passing through a node 6 and a node 4 has delay being 11 and exceeds delay restriction. On the other hand, a route passing through the node 6 and a node 3 from the node 5 has total route delay being 9.

    CONSTRAINED SHORTEST PATH ROUTING METHOD
    6.
    发明专利
    CONSTRAINED SHORTEST PATH ROUTING METHOD 未知

    公开(公告)号：CA2290026C

    公开(公告)日：2002-08-20

    申请号：CA2290026

    申请日：1999-11-16

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： KODIALAM MURALIDHARAN SAMPATH ,  YAN ANLU ,  LAU WING CHEONG

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

    Abstract: A real-time method for routing subject to an acceptable delay constraint between nodes in high-speed data networks, such as PNNI protocol networks, uses an illustrative two-phase algorithm employing Dijkstra's algorithm at each phase. In an illustrative first phase, the Dijkstra SPF algorithm is used in seeking the shortest cumulative delay from the destination to the source, thereby generating cumulative delay labels fr om a node j to the destination node k. The delay results are then employed in the second phase, where the Dijkstra SPF algorithm is illustratively employed for determining administrative weight (AW) as the link metric subject to modification in accordance with results obtained in the first phase.

    8.
    发明专利
    未知

    公开(公告)号：DE60017622T2

    公开(公告)日：2006-03-23

    申请号：DE60017622

    申请日：2000-02-15

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： CHUAH MOOI CHOO ,  KODIALAM MURALIDHARAN SAMPATH ,  YAN ANLU

    IPC: H04L12/56 ,  H04L29/06 ,  H04L12/22 ,  H04L12/46

    Abstract: A new RSVP-based tunnel protocol establishes packet tunnels between a tunnel source point (TSP) and a tunnel destination point (TDP) such that guaranteed services to aggregated packet flows is provided. In particular, an end-to-end RSVP session is mapped using a receiver-oriented RSVP type of signaling such that the TDP determines tunnel mapping. As such, this new RSVP-type of protocol is compatible with the receiver-driven nature of RSVP. Subsequent to admitting RSVP sessions, a tunnel tuning procedure dynamically adapts existing RSVP tunnels to traffic conditions in order to improve bandwidth efficiency. This tunnel tuning procedure may result in RSVP tunnel re-assignment of some of the admitted end-to-end sessions.

    PROTOCOLO DE TUNEL BASADO EN RSVP QUE PROPORCIONA SERVICIOS INTEGRADOS.
    9.
    发明专利
    PROTOCOLO DE TUNEL BASADO EN RSVP QUE PROPORCIONA SERVICIOS INTEGRADOS. 未知

    公开(公告)号：ES2234524T3

    公开(公告)日：2005-07-01

    申请号：ES00301168

    申请日：2000-02-15

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： CHUAH MOOI CHOO ,  KODIALAM MURALIDHARAN SAMPATH ,  YAN ANLU

    IPC: H04L12/22 ,  H04L12/46 ,  H04L29/06 ,  H04L12/56

    Abstract: Un método para uso en un servidor de paquetes, comprendiendo el método las operaciones de: recibir (205) tráfico de señales basado en RSVP (protocolo de reserva de recursos); y correlacionar (225) una sesión de RSVP extremo a extremo en un túnel (60) entre un punto de fuente de túnel "TSP" (15) y un punto de destino del túnel "TDP" (25); caracterizado porque: dicho servidor de paquetes sirve como dicho TDP; dicho tráfico de señales basado en RSVP contiene parámetros para un túnel RSVP propuesto entre el TSP y el TDP que permitiría que un conjunto de flujos de paquetes individuales agregados se desplazase dentro de una calidad de servicio "QoS" dada a través de dicho túnel RSVP propuesto; dicho método incluye determinar un túnel RSVP real suficiente para satisfacer los parámetros dentro del tráfico de señales de RSVP; y dicha operación de correlación correlaciona la sesión RSVP extremo a extremo para el túnel determinado.

Patent Agency Ranking