• International Journal of Highway Engineering
• /
• v.14 no.2
• /
• pp.83-91
• /
• 2012

This study deals with the operational efficiency of roundabout. The roundabouts generally have such the merits as high capacity, delay reduction, safety improvement, and others. Circular intersection can be divided into the rotary and roundabout according to travelling priority. The objective of this study is to comparatively analyze the operational efficiency of rotary and roundabout by scenario. In pursuing the above, this study gives the particular attentions to developing 256 scenarios according to the directional and entering traffic volume and analyzing the delay using VISSIM. The main results are as follows. First, the average delay of rotary was analyzed to be 1.56-8.74 times of roundabout. Second, the operational efficiencies of rotary and roundabout were analyzed to be better in the case of bigger differences in the traffic volumes between the main and minor roads. Third, the average delay of the 4-legged was evaluated to be 1.77-11.70 times of 3-legged intersection. Finally, 2-lane intersection (3-legged & 4-legged) was analyzed to be 2.02-2.23 times of 1-lane intersection.

• International Journal of Highway Engineering
• /
• v.15 no.5
• /
• pp.217-226
• /
• 2013

PURPOSES : Under the capacity conditions with balanced approach flows, roundabouts give less delay than existing signalized intersections; however, flows over 450 vehicles/hour/lane with unbalanced approach flow conditions, roundabouts efficiency drops due to the short time difference between the critical gap and the follow-up headway. The purpose of this study is developing a roundabout Signal Metering operation method by considering approach lanes degree of saturation. METHODS : A four-way-approach with one-lane roundabout is selected to compare the Signal Metering performance for the case of 16 different unbalanced flow conditions. Based on these traffic conditions, the performance is evaluated for 64 different cases of Signal Metering combinations by using SIDRA software. A degree of saturation(V/C ratio) sum for two adjoined approaches is used for the performance index of choosing Metered Approach and Controlling Approach. RESULTS : When the V/C ratio sum is 0.29~0.81 and Metered Approach flow is less than Controlling Approach flow, the average delay saving per vehicle is about 7 seconds; however, after this rage the delay saving decreases gradually until the V/C ratio sum reaches around 1.0. The range of V/C ratio sum 0.93~1.09 provides average delay saving per vehicle about 3 seconds. In case of V/C ratio sum is grater than 1.0 and the flows of Metered Approach is grater than Controlling Approach, the average delay per vehicle increases 3~11 times respectively. CONCLUSIONS : As expected, the Signal Metering provides substantial improvements in delay saving for the case of V/C ratio sum is 0.3~1.0 under the traffic flow conditions of Metered Approach is less than Controlling Approach.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.10-17
• /
• 1994

In this paper, a priority schedling and a flow control algorithm with hysteresis effect are proposed for high-speed networks. A mathematical model for the flow control is proposed and a cell transition probability from this model is found. And the performance of the proposed algorithm is analyzed by a computer simulation. According to the simulation results, it can be shown that the priority scheduling and the flow control with hysteresis effect get the cell loss probability 0.061 better and the average delay 100ms better and the average delay 100ms beter than those of single threshold.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.108-111
• /
• 1983

This paper presents a new method for the optimum capacity assignment in store-and-forward communication networks under a total fixed-capacity constraints. Any two link capacities needed in this method can have the desirable quantites and then other capacities can be obtained from the fixed two link capacities. When the minimum and the maximum capacities that are the quantites of the conventional method are fixed, the total average time delay from the new method is almost the same as that from the conventional method. And when the minimum capacity is fixed, the new method gives smaller average time delay.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1748-1751
• /
• 2002

An expression for the average carry propagation delay in a ripple carry adder is obtained which is exact up to terms of the order 0(n$\^$-1/ln n). The case of several adders working in parallel is also considered.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.43-51
• /
• 2023

Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.678-683
• /
• 2003

This study presents a result of performance with the design of network topology for voice and data integration under computer network. This network is consisted of FastEthernet, other LANs and ATM WAN(wide area network), and performance evaluation of delay in a PBX+IP network, delay in a VoIP network and delay in a IP+ATM network will be shown. We use parameters including network bandwidth, number of packet, routing protocol(IGRP, OSPF). We simulate integrated of voice and data used PBX. we will study further about the case of integrated of voice and data environments using PBX. and, evaluate IP+ATM WAN average measured network delay and average delay of VoIP network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4484-4501
• /
• 2019

In this paper, we put forward a delay-aware secure maximum distance separable (MDS) coded caching scheme to resist the eavesdropping attacks for device-to-device (D2D) content sharing by combining MDS coding with distributed caching. In particular, we define the average system delay to show the potential coupling of delay-content awareness, and learn the secure constraints to ensure that randomly distributed eavesdroppers cannot obtain enough encoded packets to recover their desired contents. Accordingly, we model such a caching problem as an optimization problem to minimize the average system delay with secure constraints and simplify it to its convex relaxation. Then we develop a delay-aware secure MDS coded caching algorithm to obtain the optimal caching policy. Extensive numerical results are provided to demonstrate the excellent performance of our proposed algorithm. Compared with the random coded caching scheme, uniform coded caching scheme and popularity based coded caching scheme, our proposed scheme has 3.7%, 3.3% and 0.7% performance gains, respectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.