公开(公告)号：KR1020030055629A

公开(公告)日：2003-07-04

申请号：KR1020010085663

申请日：2001-12-27

Applicant: 한국전자통신연구원 ,  유티스타콤코리아 유한회사

Inventor： 김성경 ,  김주희 ,  김경수

IPC: H04J13/20

CPC classification number: H04J13/0044 ,  H04B7/2628 ,  H04J13/20

Abstract: PURPOSE: A method for managing spreading codes through dual state management of a plane tree structure and a method for allocating and releasing the spreading codes by using the same are provided to adopt the plane tree structure storing an OVSF(Orthogonal Variable Spreading Factor) code tree in a one-dimensional array, and to perform the dual state management of OVSF codes, thereby eliminating the effort to search states of related codes upon allocation and release. CONSTITUTION: A state of each spreading code is divided into two fields, in order to meet an allocation rule of spreading codes. The first state field(5a) indicates a state(IDLE) of available spreading codes, a state(BUSY) of currently used spreading codes, and a state(QUASI-BUSY) showing that lower spreading codes connected to the same branch are unavailable due to use of upper spreading codes. The second state field(5b) indicates information on the number of spreading codes(#BUSY-CHILD) in a 'BUSY' state among lower spreading codes of corresponding spreading codes. Resources of a spreading code tree are managed in a plane tree structure with a one dimensional array. Accordingly, direct access into an array index is possible without passing a step of searching additional link information, when accessing the lower spreading codes and upper spreading codes.

Abstract translation: 目的：提供一种用于通过平面树结构的双状态管理来管理扩展码的方法，以及通过使用它们来分配和释放扩展码的方法，以采用存储OVSF（正交可变扩频因子）码树的平面树结构 并且执行OVSF代码的双重状态管理，从而消除了在分配和释放时搜索相关代码的状态的努力。 构成：每个扩展码的状态分为两个字段，以满足扩展码的分配规则。 第一状态字段（5a）指示可用扩展码的状态（IDLE），当前使用的扩展码的状态（BUSY）和表示连接到同一分支的较低扩展码不可用的状态（QUASI-BUSY） 使用高扩展码。 第二状态字段（5b）指示相应扩展码的较低扩展码中的“忙”状态下的扩展码数（＃BUSY-CHILD）的信息。 扩展码树的资源在具有一维数组的平面树结构中进行管理。 因此，当访问较低的扩展码和高扩展码时，直接访问数组索引是可能的，而不会通过搜索附加链路信息的步骤。

公开(公告)号：KR1020020054197A

公开(公告)日：2002-07-06

申请号：KR1020000083020

申请日：2000-12-27

Applicant: 한국전자통신연구원

Inventor： 유병한 ,  김주희 ,  장성철

IPC: H04L12/28

Abstract: PURPOSE: A performance analyzing method and bandwidth determining method of a broadband transmission path adopting a statistical multiplier are provided to theoretically evaluate loss probability and transmission delay of a packet according to a given traffic situation, effectively operate a broadband transmission path and maintain a suitable transmission quality by evaluating a bandwidth of the transmission path according to a bandwidth determining method proposed in case that a loss probability and transmission delay of a required packet have not been previously determined. CONSTITUTION: A bandwidth satisfying a delay condition is determined(S31). A size of a transmission buffer of a broadband transmission path satisfying a maximum allowable delay time is determined(S31). A packet loss probability of a bandwidth is calculated in consideration of the maximum delay time(S33). A packet loss probability(Pd) and a packet loss probability(PL) requested for transmission are compared(S34). If Pd is greater than PL, a size of a buffer is increased one by one(S36) to calculate a packet loss probability of the bandwidth(S37), the obtained packet loss probability(Pd) and the packet loss probability(PL) requested for transmission are compared(S38), thereby finding a buffer size satisfying a QoS(quality of service) condition. A bandwidth satisfying the QoS is determined(S39).

Abstract translation: 目的：提供采用统计乘数的宽带传输路径的性能分析方法和带宽确定方法，以理论上根据给定的业务情况评估分组的丢失概率和传输延迟，有效地操作宽带传输路径并保持合适的传输 通过在未预先确定所需分组的丢失概率和传输延迟的情况下根据提出的带宽确定方法评估传输路径的带宽来进行质量评估。 构成：确定满足延迟条件的带宽（S31）。 确定满足最大允许延迟时间的宽带传输路径的传输缓冲器的大小（S31）。 考虑到最大延迟时间来计算带宽的分组丢失概率（S33）。 比较要求传输的分组丢失概率（Pd）和分组丢失概率（PL）（S34）。 如果Pd大于PL，缓冲器的大小逐一增加（S36），以计算带宽的分组丢失概率（S37），所获得的分组丢失概率（Pd）和分组丢失概率（PL）被请求 进行传输（S38），从而找到满足QoS（服务质量）条件的缓冲器大小。 确定满足QoS的带宽（S39）。