中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

62 records (took 0.025 seconds)

    23.
    发明专利
    未知

    公开(公告)号：BR0005819A

    公开(公告)日：2001-07-24

    申请号：BR0005819

    申请日：2000-12-08

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： BALACHANDRAN KRISHNA ,  EJZAK RICHARD PAUL ,  NANDA SANJIV

    IPC: H04B7/26 ,  H04J3/00 ,  H04Q7/36

    Abstract: A system and method for providing wireless time division multiplexed communications in which time is divided into a plurality of frames and each frame is divided into N data bursts, which has a first multiplexer defining a channel as a series of bursts that occur periodically every N bursts once per frame; a second multiplexer defining a sub-channel as every Mth burst of said channel; and a transmitter transmitting said channel and sub-channel from a first station to a second station. A new interleaving 0246/1357 method is used by the system which is just as good as the known 0123/4567 method when ideal frequency hopping is used, and 0246/1357 has better performance when non-ideal frequency hopping or no frequency hopping is used.

    CONTROL DE CONEXION DE RADIO CON RETRANSMISIONES LIMITADAS PARA SERVICIOS DE FLUJO.
    27.
    发明专利
    CONTROL DE CONEXION DE RADIO CON RETRANSMISIONES LIMITADAS PARA SERVICIOS DE FLUJO. 未知

    公开(公告)号：ES2329755T3

    公开(公告)日：2009-12-01

    申请号：ES01306134

    申请日：2001-07-17

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： BALACHANDRAN KRISHNA ,  CHANG KIRK K ,  EJZAK RICHARD PAUL ,  LUO WEI ,  NANDA SANJIV

    IPC: H04L1/18 ,  H04B7/26 ,  H04L1/00 ,  H04L1/08 ,  H04L1/16 ,  H04L12/56

    Abstract: Un método para un control de enlace radio, al que se hace referencia en lo que sigue como RLC, protocolo que permite al menos la recuperación parcial de un servicio de flujo (transmisión de paquetes de datos) sobre un canal de comunicaciones inalámbricas en el que se controla el abortar la recuperación de un bloque de RLC, método caracterizado por: determinar un tiempo de transferencia para cada bloque de RLC en función del tamaño del bloque, la velocidad de transferencia y el retardo permitido para cada transmisión; y o bien abortar la recuperación para un bloque de RLC si dicho bloque de RLC no es recibido para el correspondiente tiempo de transferencia del mismo; o bien recibir y recuperar dicho bloque de RLC que es recibido para el correspondiente tiempo de transferencia el mismo.

    29.
    发明专利
    未知

    公开(公告)号：DE602004011347T2

    公开(公告)日：2009-01-15

    申请号：DE602004011347

    申请日：2004-03-30

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： BALACHANDRAN KRISHNA ,  BUDKA KENNETH C ,  DAS ARNAB ,  MEDAPALLI KAMESWARA RAO ,  PARULEKAR MINOTHI

    IPC: H04L12/28 ,  H04L12/56 ,  H04W28/24 ,  H04W72/12

    Abstract: A scheduler and a method for scheduling transmissions to a plurality of users (105) in a communication network assigns a higher target minimum throughput for receiving a next transmission to a user based on a quality of service (QoS) class of the user. A token count that tracks the user's achieved performance relative to a target minimum throughput Is determined for each user in given timeslot, and a weight is determined for each user based on one or more of the token count and a current rate requested by the user. A user having the highest weight as determined by a weight function is scheduled to be served the next transmission. User priority for scheduling may be downgraded if an average data rate requested by the user is less than the target minimum throughput.

    30.
    发明专利
    未知

    公开(公告)号：DE602004014274D1

    公开(公告)日：2008-07-17

    申请号：DE602004014274

    申请日：2004-03-30

    Applicant: LUCENT TECHNOLOGIES INC

    Inventor： BALACHANDRAN KRISHNA ,  BUDKA KENNETH C ,  DAS ARNAB ,  MEDAPALLI KAMESWARA RAO ,  PARULEKAR MINOTHI

    IPC: H04L12/28 ,  H04L12/56 ,  H04W28/24 ,  H04W72/12

    Abstract: A scheduler and a method for scheduling transmissions to a plurality of users (105) in a communication network assigns a higher target minimum throughput for receiving a next transmission to a user based on a quality of service (QoS) class of the user. A token count that tracks the user's achieved performance relative to a target minimum throughput Is determined for each user in given timeslot, and a weight is determined for each user based on one or more of the token count and a current rate requested by the user. A user having the highest weight as determined by a weight function is scheduled to be served the next transmission. User priority for scheduling may be downgraded if an average data rate requested by the user is less than the target minimum throughput.

Patent Agency Ranking