이동통신 시스템에서 버퍼링 윈도우의 시작 시간을기준으로 하는 패킷 스케줄링 방법
    1.
    发明授权
    이동통신 시스템에서 버퍼링 윈도우의 시작 시간을기준으로 하는 패킷 스케줄링 방법 失效
    在本发明的实施方式中,本发明提供了一种方法,

    公开(公告)号:KR100461546B1

    公开(公告)日:2004-12-17

    申请号:KR1020020074039

    申请日:2002-11-26

    Abstract: PURPOSE: A packet scheduling method on the basis of start time of a buffering window in a mobile communication system is provided to preferentially provide service to a user having the largest difference between time at a scheduling update point and buffering window start time of each user. CONSTITUTION: The number of OVSF codes is initialized(601) and it is checked whether a buffer is empty(602). A value is calculated on the basis of a difference between scheduling update time of every packet of users in a buffering window and start time of the buffering window of each user to which the scheduling update time belongs(603). A buffering window for every packet in the buffering window is calculated, and if a packet exceeds a certain delay, packets from the corresponding packet to every following inputted packet in the buffering window are discarded through a packet scheduling(604-609).

    Abstract translation: 目的:提供一种基于移动通信系统中的缓冲窗口的开始时间的分组调度方法,以优先为在每个用户的调度更新点和缓冲窗口开始时间之间具有最大时间差的用户提供服务。 构成:OVSF代码的数量被初始化(601),并检查缓冲器是否为空(602)。 基于缓冲窗口中的每个用户的分组的调度更新时间与调度更新时间所属的每个用户的缓冲窗口的开始时间之间的差来计算值(603)。 计算缓冲窗口中的每个分组的缓冲窗口,并且如果分组超过一定延迟,则通过分组调度(604-609)丢弃从对应分组到缓冲窗口中的每个后续输入分组的分组。

    이동통신 시스템에서 버퍼링 윈도우의 시작 시간을기준으로 하는 패킷 스케줄링 방법
    2.
    发明公开
    이동통신 시스템에서 버퍼링 윈도우의 시작 시간을기준으로 하는 패킷 스케줄링 방법 失效
    基于移动通信系统缓冲窗启动时间的分组调度方法

    公开(公告)号:KR1020040046200A

    公开(公告)日:2004-06-05

    申请号:KR1020020074039

    申请日:2002-11-26

    Abstract: PURPOSE: A packet scheduling method on the basis of start time of a buffering window in a mobile communication system is provided to preferentially provide service to a user having the largest difference between time at a scheduling update point and buffering window start time of each user. CONSTITUTION: The number of OVSF codes is initialized(601) and it is checked whether a buffer is empty(602). A value is calculated on the basis of a difference between scheduling update time of every packet of users in a buffering window and start time of the buffering window of each user to which the scheduling update time belongs(603). A buffering window for every packet in the buffering window is calculated, and if a packet exceeds a certain delay, packets from the corresponding packet to every following inputted packet in the buffering window are discarded through a packet scheduling(604-609).

    Abstract translation: 目的:提供基于移动通信系统中的缓冲窗口的开始时间的分组调度方法,以优先向在调度更新点的时间与每个用户的缓冲窗口开始时间之间具有最大差异的用户提供服务。 构成:初始化OVSF代码(601),检查缓冲区是否为空(602)。 基于缓冲窗口中的每个用户分组的调度更新时间与调度更新时间所属的每个用户的缓冲窗口的开始时间之间的差异来计算值(603)。 计算缓冲窗口中的每个数据包的缓冲窗口,如果数据包超过一定延迟,则通过数据包调度(604-609)丢弃来自缓冲窗口的相应数据包到每个后续输入数据包的数据包。

Patent Agency Ranking