• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2654-2662
• /
• 1998

Maximum single bus throughput of standard IEEE 802.6 DQDB(Distributed Queue Dual Bus) is not obtained over 1. Therefore, lots of studies for improving bus throughput have done by QA slot preuse/reuse. We propose three calculation cethods for network's utilization with preuse/reuse scheme based on erasure nodes. One is calculation method by traffic density function, other is calculation method for obtaining maximum throughput. The other is calculation method using probability concept which follows real DQDB operation mechanisms. The calculated throughputs are compared with each others. The results shows some favorite phenomena. The proposed calculation methods can be casily expanded in mumber of nodes or in number of erasure nodes.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.1
• /
• pp.129-136
• /
• 2018

In this paper, we propose a new real-time lane detection method that is efficient for road environment. Existing methods have a problem of low reliability under environmental changes. In order to overcome this problem, we emphasize the lane candidate area by using gray level division. And Extracts a straight line component near the lane by using the Hough transform, and generates an ROI for each straight line based on the extracted coordinates. And integrates the generated ROI images. Then, the lane is determined by dividing the object using the dual queue in the ROI image. The proposed method is able to detect lanes even in the environmental change unlike the conventional method. And It is possible to obtain an advantage that the area corresponding to the background such as sky, mountain, etc. is efficiently removed and high reliability is obtained.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.111-117
• /
• 2001

Most of the techniques for the performance estimation of unit-load AS/RS are a static model or computer simulation. Especially, their models have been developed under the assumption that the Storage/Retrieval (S/R) machine performs either single command(SC) or dual command(DC) only. In reality, depending on the operating policy and the status of the system at a particular time, the S/R machine performs a SC or a DC, or becomes idle. In order to resolve this weak point, we propose a stochastic model for the performance estimation of unit-load ASIRS by using a M/G/1 queueing model with a single server and two queues. Server utilization, expected numbers of waiting storage and retrieval commands and mean time spent in queue and system are found.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.973-982
• /
• 2004

High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.372-375
• /
• 2008

IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.128-135
• /
• 2003

A fairness control method for Distributed-Queue Dual-Bus(DQDB) has been studied under specific traffic types such as equal probability traffic, symmetric traffic and asymmetric traffic. To distribute DQDB network bandwidth fairly to all stations under general traffic such as a client-server traffic that differs from specific traffic types, we propose an effective fairness control method. Based on an access limit, the proposed mechanism applies two bandwidth control mechanisms to DQDB networks. One is the mechanism that is called APS(Access Protection Scheme) for servers. And another is the mechanism that controls the allocation of bandwidth only using an access limit lot clients. Simulation results show that it outperforms other mechanisms.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.133-140
• /
• 2002

Distributed-queue Dual-Bus (DQDB) shows an unfair behavior in bandwidth allocation due to the nature of unidirectional bus architecture. The study on fairness control method for DQDB has been performed under specific load types such as equal Probability load. symmetric load and asymmetric load type. A client-server load type is more practical traffic pattern than specific load type in Web environments. In this paper, we propose an effective fairness control method to distribute DQDB network bandwidth fairly to all stations under Web environments. The proposed method directly calculates an access limit from the bandwidth demand pattern. Based on an access limit, it controls the allocation of bandwidth by yielding empty slots in clients to servers. And we were certain that it outperforms other mechanisms from simulation results.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.435-446
• /
• 2001

In this paper, a new fairness control method is proposed to distribute DQDB-SR (Distributed-Queue Dual-Bus with Slot Reuse) network bandwidth fairly to all stations on client-server environments. By using an access limit that follows a characteristic of client-sever load patterns and a bandwidth borrowing and returning mechanism, the proposed mechanism imparts fairness bandwidth control capability to DQDB-SR. To implement the proposed mechanism, we find the optimal placement of erasure nodes that maximizes network capacity for DQDB-SR, and calculate the access limit. At overload conditions, simulation results show that the proposed mechanism does not deteriorate network throughput, and outperforms other fairness control mechanisms in a success rate and an average packet transfer delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.