-
公开(公告)号：JP2000196650A
公开(公告)日：2000-07-14
申请号：JP36363899
申请日：1999-12-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KODIALAM MURALIDHARAN SAMPATH , LAU WING CHEONG , YAN ANLU
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.
-
公开(公告)号：CA2290026C
公开(公告)日：2002-08-20
申请号：CA2290026
申请日：1999-11-16
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KODIALAM MURALIDHARAN SAMPATH , YAN ANLU , LAU WING CHEONG
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.
-
公开(公告)号：DE69935703D1
公开(公告)日：2007-05-16
申请号：DE69935703
申请日：1999-12-07
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KODALIAM MURALIDHARAN SAMPATH , LAU WING CHEONG , YAN ANLU
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 from 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.
-
公开(公告)号：DE60017622T2
公开(公告)日：2006-03-23
申请号：DE60017622
申请日：2000-02-15
Applicant: LUCENT TECHNOLOGIES INC
Inventor： CHUAH MOOI CHOO , KODIALAM MURALIDHARAN SAMPATH , YAN ANLU
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.
-
公开(公告)号：ES2234524T3
公开(公告)日：2005-07-01
申请号：ES00301168
申请日：2000-02-15
Applicant: LUCENT TECHNOLOGIES INC
Inventor： CHUAH MOOI CHOO , KODIALAM MURALIDHARAN SAMPATH , YAN ANLU
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
公开(公告)号：DE69935703T2
公开(公告)日：2008-01-03
申请号：DE69935703
申请日：1999-12-07
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KODALIAM MURALIDHARAN SAMPATH , LAU WING CHEONG , YAN ANLU
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 from 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.
-
7.发明专利
公开(公告)号：CA2299141C
公开(公告)日：2006-12-12
申请号：CA2299141
申请日：2000-02-23
Applicant: LUCENT TECHNOLOGIES INC
Inventor： CHUAH MOOI , YAN ANLU , YUE ON-CHING , FLEISCHER WOLFGANG
Abstract: A packet encapsulation scheme for multiplexing application sessions Lightweight IP Encapsulation (LIPS) - is described. An LIFE packet comprises at least one multiplexing header (MH) and associated multimedia data packet (MDP). Th e LIPE packet uses UDP/IP as transport. An MH field further comprises a 16-bit a us er identifier (UID) field, an 11 bit length indicator (LNG) field, a 1 bit "more" (M) fiel d and an optional payload type/class of service (PT/CoS) field comprising 8 bits.
-
公开(公告)号：DE60017622D1
公开(公告)日：2005-03-03
申请号：DE60017622
申请日：2000-02-15
Applicant: LUCENT TECHNOLOGIES INC
Inventor： CHUAH MOOI CHOO , KODIALAM MURALIDHARAN SAMPATH , YAN ANLU
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.
-
9.发明专利
公开(公告)号：CA2299141A1
公开(公告)日：2000-09-08
申请号：CA2299141
申请日：2000-02-23
Applicant: LUCENT TECHNOLOGIES INC
Inventor： CHUAH MOOI , FLEISCHER WOLFGANG , YAN ANLU , YUE ON-CHING
Abstract: A packet encapsulation scheme for multiplexing application sessions Lightweight IP Encapsulation (LIPS) - is described. An LIFE packet comprises at least one multiplexing header (MH) and associated multimedia data packet (MDP). The LIPE packet uses UDP/IP as transport. An MH field further comprises a 16-bit a user identifier (UID) field, an 11 bit length indicator (LNG) field, a 1 bit "more" (M) field and an optional payload type/class of service (PT/CoS) field comprising 8 bits.
-
公开(公告)号：CA2290026A1
公开(公告)日：2000-06-22
申请号：CA2290026
申请日：1999-11-16
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KODIALAM MURALIDHARAN SAMPATH , LAU WING CHEONG , YAN ANLU
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 from 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.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.024 seconds)
