-
公开(公告)号：JP2001160831A
公开(公告)日：2001-06-12
申请号：JP2000302082
申请日：2000-10-02
Applicant: LUCENT TECHNOLOGIES INC
Inventor： TU MING-HSU , FALCO STEVEN A , STRICKLAND STEPHEN GREGORY
Abstract: PROBLEM TO BE SOLVED: To provide a data flow performance enhance means in a communication node. SOLUTION: The communication node 14 predicts a transmission/departure time of a received data message from an output section 16 just after the reception of the received data message in an input section 12 of the communication node 14. The communication node 14 decides whether or not the received data message is resident in the communication node for a latent time longer than a wait time limit based on the predicted transmission departure time. If the received data message is transmitted before the wait time limit expires, the communication node 14 accepts the received data message for the storage to a buffer memory 36 for the purpose of expected transmission from the output section 16.
-
公开(公告)号：JP2001136193A
公开(公告)日：2001-05-18
申请号：JP2000302083
申请日：2000-10-02
Applicant: LUCENT TECHNOLOGIES INC
Inventor： TU MING-HSU , FALCO STEVEN A , STRICKLAND STEPHEN GREGORY
Abstract: PROBLEM TO BE SOLVED: To provide a method and a communication node to control a data flow provided to a communication node for serving a wireless communication system. SOLUTION: A communication node captures an incoming message to its buffer memory if the incoming message is contained within a range of a storage capacity with respect to a class of the incoming message and no congestion takes place in the buffer memory. A state detector detects whether or not congestion takes place in the buffer memory by evaluating an occupancy ratio of the buffer memory. The range of the storage capacity is decided by obtaining an operating rate of the buffer memory depending on the specific class of a data message specified according to an economical value rating estimated by the data message.
-
公开(公告)号：JP2000197113A
公开(公告)日：2000-07-14
申请号：JP34800599
申请日：1999-12-07
Applicant: LUCENT TECHNOLOGIES INC
Inventor： FALCO STEVEN ANTHONY , STRICKLAND STEPHEN GREGORY , TU MING-HSU
Abstract: PROBLEM TO BE SOLVED: To prevent any other message from being interrupted when a time slot is not used to the maximum by selecting a priority system for scheduling a message to the time slot. SOLUTION: A hyper-frame number is used as characteristics for selecting a priority system for scheduling a message to a time slot on a time slotted control channel. When the time slot is reserved for a broadcast message, scheduling is operated so that the broadcast message can be transmitted by this time slot, and this broadcast message is transmitted. When the time slot is not the primary super-frame of a hyper-frame but the secondary super-frame, whether or not a message transmitted by the time slot of the primary super-frame is pages is judged, and when the pages are present in the corresponding time slot, scheduling is operated so that the same pages can be transmitted by the time slot.
-
公开(公告)号：AU6126100A
公开(公告)日：2001-04-05
申请号：AU6126100
申请日：2000-09-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor： TU MING-HSU , FALCO STEVEN A , STRICKLAND STEPHEN GREGORY
Abstract: A communications node predicts a transmission-departure time of a receive data message from an output upon reception of the receive data message at an input of the communications node. The communications node determines if the receive data message would remain stored within the communications node for a latent duration longer than a waiting-time limit based on the predicted transmission-departure time. The communications node admits the receive data message, for storage in a buffer memory of the communications node for prospective transmission over the output, if the receive data message would be transmitted prior to expiration of the waiting-time limit.
-
公开(公告)号：CA2289188C
公开(公告)日：2004-04-27
申请号：CA2289188
申请日：1999-11-09
Applicant: LUCENT TECHNOLOGIES INC
Inventor： TU MING-HSU , STRICKLAND STEPHEN GREGORY , FALCO STEVEN ANTHONY
Abstract: A method that selects one of a plurality of priority schemes for scheduling messages for one of cyclically repeating sets of time slots of a control channel based on at least one of a plurality of characteristics of the state of the control channel. The state of the contro l channel is all information regarding what has arrived, what is queued, and what has been transmitted. This includes the status of the queues, the messages awaiting transmission, along with their type and th e time they have been waiting, the sequence of past transmissions, as well as other information. I n one embodiment, in a control channel of a TDMA system where the hyperframe number is the characteristic used to select the priority scheme, a priority scheme is selected that assigns a voice page highest priority when the hyperframe number is an even number, and that assigns an R-DATA SPACH notification highest priority when the hyperframe number is an odd number. In another embodiment of the invention, if there is a packed airlink message, the packed airlink message is scheduled i n the time slot. If there are no packed airlink messages, then the method dynamically alters the priority of messages based on whether there is a voice page or an R-DATA SPACH notification in the message queues since at least the end of the time slot construction period of a corresponding time slot of a previous hyperframe. If there are no such messages and there is a non-packable message, the non- packable message is scheduled in the time slot, although if there are no non-packable messages a nd there is a voice page or R-DATA SPACH notification, it is packaged in an unpacked airlink message tha t is scheduled in the time slot. However, if there is a voice page or an R-DATA SPACH notification in any of the message queues since at least the end of the time slot construction period of the corresponding time slot of the previous hyperframe, the voice page or R-DATA SPACH is packaged in an unpack ed airlink message that is scheduled in the time slot. This significantly reduces both the numb er of messages that are blocked and the number of messages timed out.
-
Patent Agency Ranking
公开(公告)号：CA2320709A1
公开(公告)日：2001-04-01
申请号：CA2320709
申请日：2000-09-26
Applicant: LUCENT TECHNOLOGIES INC
Inventor： FALCO STEVEN A , STRICKLAND STEPHEN GREGORY , TU MING-HSU
Abstract: A communications node admits the receive data message to the buffer memory if the receive arriving message falls within the capacity rang e of a class of the receive data messages and if the buffer memory is not congested. A state detector detects if the buffer memory is congested by evaluating the occupancy rate of the buffer memory, or otherwise. The capacity range determines the utilization of buffer memory by a particular class of data messages, which may be defined in accordance with an estimated economic value rating of the data messages.
-
公开(公告)号：CA2320693A1
公开(公告)日：2001-04-01
申请号：CA2320693
申请日：2000-09-26
Applicant: LUCENT TECHNOLOGIES INC
Inventor： TU MING-HSU , FALCO STEVEN A , STRICKLAND STEPHEN GREGORY
Abstract: A communications node predicts a transmission-departure time of a receive data message from an output upon reception of the receive data message at an input of the communications node. The communications node determines if the receive data message would remain stored within the communications node for a latent duration longer than a waiting-time limit based on the predicted transmission-departure time. The communications node admits the receive data message, for storage in a buffer memory of the communications node for prospective transmission over the output, if the receive data message would be transmitted prior to expiration of the waiting-time limit.
-
公开(公告)号：AU6306399A
公开(公告)日：2000-06-15
申请号：AU6306399
申请日：1999-12-03
Applicant: LUCENT TECHNOLOGIES INC
Inventor： FALCO STEVEN ANTHONY , TU MING-HSU , STRICKLAND STEPHEN GREGORY
Abstract: A method that selects one of a plurality of priority schemes for scheduling messages for one of cyclically repeating sets of time slots of a control channel based on at least one of a plurality of characteristics of the state of the control channel (10). The state of the control channel (10) is the all information regarding what has arrived, what is queued, and what has been transmitted. This includes the status of the queues, the messages awaiting transmission, along with their type and the time they have been waiting, the sequence of past transmissions, as well as other information. In one embodiment, in a control channel of a TDMA system where the hyperframe number is the characteristic used to select the priority scheme, a priority scheme is selected that assigns a voice page highest priority when the hyperframe number is an even number, and that assigns an R-DATA SPACH notification highest priority when the hyperframe number is an odd number. In another embodiment of the invention, if there is a packed airlink message, the packed airlink message is scheduled in the time slot. If there are no packed airlink messages, then the method dynamically alters the priority of messages based on whether there is a voice page or an R-DATA SPACH notification in the message queues since at least the end of the time slot construction period of a corresponding time slot of a previous hyperframe. If there are no such messages and there is a non-packable message, the non-packable message is scheduled in the time slot, although if there are no non-packable messages and there is a voice page or R-DATA SPACH notification, it is packaged in an unpacked airlink message that is scheduled in the time slot. However, if there is a voice page or an R-DATA SPACH notification in any of the message queues since at least the end of the time slot construction period of the corresponding time slot of the previous hyperframe, the voice page or R-DATA SPACH is packaged in an unpacked airlink message that is scheduled in the time slot. This significantly reduces both the number of messages that are blocked and the number of messages timed out.
-
公开(公告)号：DE69923282T2
公开(公告)日：2006-03-30
申请号：DE69923282
申请日：1999-11-30
Applicant: LUCENT TECHNOLOGIES INC
Inventor： FALCO STEVEN ANTHONY , STRICKLAND STEPHEN GREGORY , TU MING-HSU
Abstract: A method that selects one of a plurality of priority schemes for scheduling messages for one of cyclically repeating sets of time slots of a control channel based on at least one of a plurality of characteristics of the state of the control channel (10). The state of the control channel (10) is the all information regarding what has arrived, what is queued, and what has been transmitted. This includes the status of the queues, the messages awaiting transmission, along with their type and the time they have been waiting, the sequence of past transmissions, as well as other information. In one embodiment, in a control channel of a TDMA system where the hyperframe number is the characteristic used to select the priority scheme, a priority scheme is selected that assigns a voice page highest priority when the hyperframe number is an even number, and that assigns an R-DATA SPACH notification highest priority when the hyperframe number is an odd number. In another embodiment of the invention, if there is a packed airlink message, the packed airlink message is scheduled in the time slot. If there are no packed airlink messages, then the method dynamically alters the priority of messages based on whether there is a voice page or an R-DATA SPACH notification in the message queues since at least the end of the time slot construction period of a corresponding time slot of a previous hyperframe. If there are no such messages and there is a non-packable message, the non-packable message is scheduled in the time slot, although if there are no non-packable messages and there is a voice page or R-DATA SPACH notification, it is packaged in an unpacked airlink message that is scheduled in the time slot. However, if there is a voice page or an R-DATA SPACH notification in any of the message queues since at least the end of the time slot construction period of the corresponding time slot of the previous hyperframe, the voice page or R-DATA SPACH is packaged in an unpacked airlink message that is scheduled in the time slot. This significantly reduces both the number of messages that are blocked and the number of messages timed out.
-
公开(公告)号：CA2320693C
公开(公告)日：2003-12-30
申请号：CA2320693
申请日：2000-09-26
Applicant: LUCENT TECHNOLOGIES INC
Inventor： FALCO STEVEN A , TU MING-HSU , STRICKLAND STEPHEN GREGORY
Abstract: A communications node predicts a transmission-departure time of a receive data message from an output upon reception of the receive data message at an input of the communications node. The communications node determines if the receive data message would remain stored within the communications node for a latent duration longer than a waiting-time limit based on the predicted transmission-departure time. The communications node admits the receive data message, for storage in a buffer memory of the communications node for prospective transmission over the output, if the receive data message would be transmitted prior to expiration of the waiting-time limit.
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.021 seconds)
