2.
    发明专利
    未知

    公开(公告)号:BR0105397A

    公开(公告)日:2003-12-02

    申请号:BR0105397

    申请日:2001-11-22

    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).

    Supplemental channel sharing algorithm

    公开(公告)号:AU9341901A

    公开(公告)日:2002-06-06

    申请号:AU9341901

    申请日:2001-11-23

    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).

    4.
    发明专利
    未知

    公开(公告)号:DE60109717D1

    公开(公告)日:2005-05-04

    申请号:DE60109717

    申请日:2001-06-11

    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).

    6.
    发明专利
    未知

    公开(公告)号:DE60109717T2

    公开(公告)日:2006-02-02

    申请号:DE60109717

    申请日:2001-06-11

    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).

    7.
    发明专利
    未知

    公开(公告)号:AT292360T

    公开(公告)日:2005-04-15

    申请号:AT01305079

    申请日:2001-06-11

    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).

Patent Agency Ranking