• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1919-1927
• /
• 1993

A new MAC protocol has been proposed and analysed to relieve the unfairness problems exhibited by the basic version of the DQDB standard. DQDB MAC protocol has the unfairness problems in throughputs. message delay and so or. And when the slots are reused or the file transmissions takes long, the unfairness problems in the system become worse. The new access protocol proposed here, which of called the Balanced DQDB, guarantees a fair bandwidth distribution by using one bit of the dual bus network protocol and keeps up all characteristics of DQDB. the DQDB analysis model introduced by Wen Jing, et al, was considered to analyse a sequential balance distribution of solts. And the probabilities of the empty in operation mode were represented to determine the probabilities for busy bits to generate on each node of the bus using the Markov chain. Through the simulations. the performances of the proposed Balanced DQDB and that of the standard DQDB of the BWB mechanism were compared at the state that the values of the RQ or CD counter on each node varied dynamically. As the results, it is shown that the Balanced DQDB has the decrement of throughputs in upstream, but the numbers of the used empty slots at each node of the Balanced DQDB had more than that of the others because the Balanced DQDB has over 0.9 throughputs in the 70~80% nodes of total node and it has constant throughputs at each node. And there results were analogous to that of the analytical model.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.675-684
• /
• 1993

In this paper, we analyze a traffic control schemes at the interworking unit(IWU) of the IEEE 802.6 DQDB MAN and the B-ISDN, and estimate its performance via computer simulation. We also study traffic management, relaying sublayers for the cases of four service classes defined in the B-ISDN. As for performance criteria, we consider slot waiting time, slot loss rate, and the fairness between DQDB nodes in access networks. We propose a simple control algorithm that decreases the waitint delay at the OWU. With the buffer size of 40 [slots] at the IWU, we have found that the slot loss rate was nearly zero at traffic load below 0.9, and the slot waiting time became less than 15 slot times.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• 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.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.5
• /
• pp.1-15
• /
• 1993

In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.237-246
• /
• 2001

In this paper we introduce a solution to improve the unfairness problem and to remove the waste of bandwidth in the distributed queue dual bus system. This solution requires only a minor modification of the current protocol and further shows no bandwidth wastes when we try to resolve the unfairness problem occurred in current DQDB protocol. There has been many problem in DQDB system in terms of fairness of sending message in each node. In order to solve this problem, Bandwidth Balancing technic and proportional assignment technic have been introduced. It is, however, to note that the waste of bandwidth problem is still existing in those technics, even though there has been significant improvement as to the fairness problem. In this paper we introduce a new solution to remove the waste of bandwidth problem while we are still obtaining the improved fairness of the network. By following this new solution, the simulation result shows higher throughput and lower message delay than previously proposed technics.

• 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.