• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1529-1538
• /
• 1999

광대역 액세스 망은 B-ISDN 환경에서 다양한 유형의 가입자들을 서비스 노드로 집선하는 기능을 수행한다. ITU-T의 SG13에서는 광대역 액세스 망과 서비스 노드 사이에서 ATM 자원의 동적인 할당 및 해제를 위하여 연결 제어 프로토콜의 표준화를 수행하고 있다. ATM 연결의 설정을 위한 연결 제어 프로토콜과 신호 프로토콜의 연동 기능은 서비스 노드에서 수행되며, ITU-T에서는 순차적 연동 모델을 채택하고 있다. 순차적 연동 모델은 SN에서 각 프로토콜의 절차가 순차적 방식으로 연동되므로 연결 지연이 크다. 본 논문에서는 광대역 액세스 망의 도입으로 인한 연결 설정 지연을 최소화하기 위하여 병렬형으로 수행되는 연동 모델을 제시하였다. 그리고 본 논문에서 제안한 병렬형 연동 모델의 성능 분석을 통하여 순차적 연동 모델과의 연결 설정 지연 및 완료비에 대한 비교, 분석을 수행하였다. 성능 분석에서 사용된 워크로드 파라미터는 RACE MAGIC 프로젝트의 결과를 적용하였다. Abstract In B-ISDN environment, various subscribers are concentrated into a service node via a broadband access network. The SG13 of ITU-T is standardizing a connection control protocol which provides dynamic allocation of ATM resources between an access network and a service node. To establish an ATM connection, interworking functions between the connection control protocol and the signaling protocol are performed at the service node. ITU-T adopts the sequential interworking model. In this paper, we propose the parallel interworking model which minimizes the overall connection setup delay by introducing the access network. Using the performance analysis, we compare our proposed parallel model with the existing sequential model in terms of connection setup delay and completion ratio. The workload parameters of RACE MAGIC project are applied to the analysis and simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.3053-3059
• /
• 2010

In DS-CDMA method, Mobile Stations own jointly one radio channel and are made to use a PN code (Pseudo-Noise Code) for the purpose of minimize interference. However, corelation value of PN code is one when time delay is zero but the corelation value is 1 / N when time delay is not 0. Therefore corelation characteristic does not fully attained. As a result, when the user increase, the performance degradation and system capacity problem will be able to occur by interference among users. In this paper, the PN code has ideally self corelation. It was proved that PN code could depress interference from other users in multiple access system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.820-831
• /
• 1999

In this paper, we have compared the performance of a D-TDMA protocol with that of a CDMA protocol, in radio access system for integrated voice/data services.The D-TDMA protocol is based on a generic dynamic channel assignment approach to be followed a combination of “circuit mode” reservation for voice calls, along with dynamic first-come-first served assignment of remaining capacity for data messages. In the CDMA protocol, we have used the voice activity detection to reduce the interface power of other mobiles in internal and external cells, and analyzed the interference power ratio. Also we have computed BER(Bit Error Rate) by using this interference power ratio and evaluated voice blocking probability(voice packet loss probability) and data transmission delay, according to average data length and average data arrival rate.We have found the CDMA protocol achieves comparatively higher performance for short data length, regardless of data arrival rate. Otherwise, the data transmission delay of D-TDMA protocol is shorter than that of the CDMA protocol for long data message.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.807-815
• /
• 2012

In this paper, we propose a scheme for partially dynamic lane control for energy saving in multilane-based high-speed Ethernet. In this scheme, among the given transmission lanes, at least one lane is always operating, and the remaining lanes are dynamically activated to alleviate the network performance in terms of queuing delay and packet loss in the range of acceptance. The number of active lanes is determined by the decision algorithm based on the information regarding traffic and queue status. The reconciliation sublayer adjusts the transmission lane with the updated number of lanes received from the algorithm, which guarantees no processing delay in the media access control layer, no overhead, and minimal delay of the exchanging control frames. The proposed scheme is simulated in terms of queuing delay, packet loss rate, lane changes, and energy saving using an OPNET simulator. Our results indicate that energy savings of around 55% (or, when the offered load is less than 0.25, a significant additional savings of up to 75%) can be obtained with a queuing delay of less than 1 ms, a packet loss of less than $10^{-4}$, and a control packet exchange time of less than $0.5{\mu}s$ in random traffic.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.2
• /
• pp.62-73
• /
• 2020

Access management is aimed at preserving the road's high intercity mobility. In urbanized areas, immoderate acceleration lane-length requirements restrict the accessibility of land. Therefore, there are many opinions to revise the minimum acceleration lane-length requirement. For this purpose, it is important to diagnose the effects of slow vehicles on the mainline. This study analyzed a single merging vehicle's total delay occurrence depending on the mainline traffic flow rate and merging speed. A linear relationship was observed between the mainline traffic flow rate and total delay. As a merging speed increases gradually from 40km/h to 100km/h in 20km/h intervals, the total delay decreases by 5.0, 1.6, and 5.1 times, respectively. This shows that the ideal condition with the total delay is less than 0.5 vehicle·sec when there is no speed difference between the mainline and merging vehicle. On the other hand, given the one-second response time of drivers, the total delay occurrence was slightly low when the speed difference between the mainline and merging vehicle was less than 20km/h.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.306-309
• /
• 2005

We consider the multi-objective optimization of a multi-service arrayed-waveguide grating-based single-hop metro WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. We develop and evaluate a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Our methodology provides the network architecture and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with our methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.403-411
• /
• 2008

This paper introduces an interconnect delay fault test (IDFT) controller on boards and system-on-chips (SoCs) with IEEE 1149.1 and IEEE 1500 wrappers. By capturing the transition signals launched during one system clock, interconnect delay faults operated by different system clocks can be simultaneously tested with our technique. The proposed IDFT technique does not require any modification on boundary scan cells. Instead, a small number of logic gates needs to be plugged around the test access port controller. The IDFT controller is compatible with the IEEE 1149.1 and IEEE 1500 standards. The superiority of our approach is verified by implementation of the controller with benchmark SoCs with IEEE 1500 wrapped cores.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.136-141
• /
• 2007

The frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) for applications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the telecom network. As telecom networks evolve from circuit to packet switching, proper synchronization algorithm should be meditated for IP networks to achieve performance quality comparable to that of legacy circuit-switched networks. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. But, The ToP can be affected by impairments of a network such as packet delay variation. This paper proposes the efficient method to minimize the expectable delay variation when ToP synchronizes the distributed clocks. The simulation results are presented to demonstrate the improved performance case when the efficient ToP transmit algorithm is applied.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.63 no.3
• /
• pp.195-199
• /
• 2014

Various M2M applications have different quality-of-service(QoS) requirements to be implemented practically. QoS requirements are normally data rate and delay constraint. However, there are limited number of wireless communication chip solutions which cannot support QoS requirements for all M2M application. Hence, aggregated usage of plural wireless communication chip solutions should be needed to implement M2M applications. In this paper, we consider the case that two wireless communication chips using random access protocol work together to transmit data of an M2M application. In such case, data rate and delay performance are mathematically analyzed. In our results, practical data rate can be improved from 2.5 to 7 times while delay constraints are satisfied if we simply use two wireless communication chips together.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1996.11a
• /
• pp.326-335
• /
• 1996

In this paper, we quantify the tradeoff between security and performance in secure data communication systems based on the queueing theory, and propose the optimization methods, such as the preprocessing, a message segmentation, compression, integration of compression and encryption and integration of user authentication and access control, which are able to reduce the delay induced by the security mechanisms and protocols. Moreover, we analyze the average delay for the secure data communication systems through the computer simulations, which are modeled by M/M/1, M/E$_2$/1 and M/H$_2$/1 queueing systems, respectively. We consider the DES, RSA digital signature and the combination of IDEA and RSA as security mechanisms for applying security services.