http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
다중 스트림에 적합한 효율적인 대역폭 할당 알고리즘 개발
高仁善 弘益大學校 科學技術硏究所 2002 科學技術硏究論文集 Vol.13 No.-
Video on Demand (VoD) service, an algorithm for dynamic bandwidth allocations is essential because the variable bit rate (VBR) of video data streams is inherently bursty. Typical dynamic allocations to competing streams are done in linear proportion to the bandwidth requirements. However, since this scheme has not taken into account statistical nature of compressed video data and constraints of buffers, it is not suitable to directly implement in the scheduler. We propose an algorithm that incorporates fair bandwidth allocation, statistical property of compressed video data, and constraints of buffer. First, we describe the constraints imposed by the buffer to avoid underflow or overflow. Based on these constraints, a new scheme is then designed to ensure a much fairer bandwidth allocation. Finally, the proposed scheme will be verified with video trace, as shown in the following figures via ExSpect 6.1 based on Petri Nets.
高仁善,金度衡 弘益大學校 科學技術硏究所 2003 科學技術硏究論文集 Vol.14 No.-
This paper discusses the optimal switching algorithm in packet switching network. In Multimedia Network like VOD(Video On Demand) service, it is important to guarantee the QOS(Quality Of Service) to each clients. In multimedia network system there are many kind of multimedia data - mpeg video, mp 2-layer audio, jpeg image, and so on. We introduce the switching algorithm adapted to each kind of multimedia data guaranteeing the minimum transmission delay. It allows network system to have good throughput and clients to more fast transmissions. In next research, we will considerate the flow error control in fast transmission and adapt proposed algorithm to error-existing network system.
조훤,高仁善 弘益大學校 科學技術硏究所 1998 科學技術硏究論文集 Vol.9 No.2
In this paper, the analysis for discrete dynamic systems, such as the entrance of vehicles from all directions of the intersections, is performed, and the operation of traffic signal controllers and the flow of vehicles are modeled by stochastic Petri Nets. The flow of vehicles in the intersection are described using the concept of probability. The situations of the intersection due to the change of the number of vehicles entering the intersection are represented by the variation of tokens in the modeled system. Through simulation, we analyse the number of vehicles passing through the intersection in the modeled traffic signal system. This model can easily extended for the interactions of multiple intersections.
페트리 네트에서 시스템의 분석과 데드락 방지를 위한 short-cut 행렬의 분석
高仁善,金度衡 弘益大學校 科學技術硏究所 2004 科學技術硏究論文集 Vol.15 No.-
This paper discusses the algorithm for finding short-cut matrix defined by us for analysis and deadlock avoidance of system. First, we analyze the system with one shared resource model graphically. Then, we extend graphcal model in detail. Second, we analyze the system in numerical method and find the short-cut matrix. The short-cut matrix is useful thing for analysis for system performance and deadlock avoidance. We propose the method and figure of short-cut matrix for simple reachability tree. So, we can find the synchronic variables for reachability tree and we can have the simple reachability tree.