-
公开(公告)号:JP2002232431A
公开(公告)日:2002-08-16
申请号:JP2001366200
申请日:2001-11-30
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , BURGESS JOHN K , KIANG T ROGER , VITEBSKY STANLEY
Abstract: PROBLEM TO BE SOLVED: To provide a method for more efficiently using SCH(supplemental channel) resources for a SCH by minimizing a gap between data bursts due to overhead delay. SOLUTION: The gap is minimized by prospectively assigning the SCH resources supporting existing SCH by using a supplemental channel sharing algorithm and scheduling the future issuance of DNR(data notify request). The SCH resources which are currently unavailable are prospectively allocated based on the states of the SCH resources. An existing SCH means an SCH to which data burst is currently being transmitted.
-
公开(公告)号:BR0105397A
公开(公告)日:2003-12-02
申请号:BR0105397
申请日:2001-11-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , VITEBSKY STANLEY , KIANG T ROGER , BURGESS JOHN K
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).
-
公开(公告)号:AU9341901A
公开(公告)日:2002-06-06
申请号:AU9341901
申请日:2001-11-23
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , VITEBSKY STANLEY , KIANG T ROGER , BURGESS JOHN K
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).
-
公开(公告)号:DE60109717D1
公开(公告)日:2005-05-04
申请号:DE60109717
申请日:2001-06-11
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , BURGESS JOHN K , KIANG T ROGER , VITEBSKY STANLEY
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).
-
公开(公告)号:CA2361934A1
公开(公告)日:2002-06-01
申请号:CA2361934
申请日:2001-11-13
Applicant: LUCENT TECHNOLOGIES INC
Inventor: VITEBSKY STANLEY , KIANG T ROGER , BURGESS JOHN K , BALOGH DAN ANTHONY
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorit hm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted.
-
公开(公告)号:DE60109717T2
公开(公告)日:2006-02-02
申请号:DE60109717
申请日:2001-06-11
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , BURGESS JOHN K , KIANG T ROGER , VITEBSKY STANLEY
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).
-
公开(公告)号:AT292360T
公开(公告)日:2005-04-15
申请号:AT01305079
申请日:2001-06-11
Applicant: LUCENT TECHNOLOGIES INC
Inventor: BALOGH DAN ANTHONY , BURGESS JOHN K , KIANG T ROGER , VITEBSKY STANLEY
Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).
-
-
-
-
-
-