• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4703-4723
• /
• 2018

In recent years, dense small cell network has been deployed to address the challenge that has resulted from the unprecendented growth of mobile data traffic and users. It has proven to be a cost efficeient solution to offload traffic from macro-cells. Software defined heterogeneous wireless network can decouple the control plane from the data plane. The control signal goes through the macro-cell while the data traffic can be offloaded by small cells. In this paper, we propose a framework for cell virtualization and user association in order to satisfy versatile requirements of multiple tenants. In the proposed framework, we propose an interference graph partioning based virtual-cell association and customized physical-cell association for multi-homed users in a software defined small cell network. The proposed user association scheme includes 3 steps: initialization, virtual-cell association and physical-cell association. Simulation results show that the proposed virtual-cell association outperforms the other schemes. For physical-cell association, the results on resource utilization and user fairness are examined for mobile users and infrastructure providers.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.5
• /
• pp.13-21
• /
• 2000

In this paper, we investigate the performance improvement by applying flow control to LonWorks-based network systems which support various communication media together with interpretable class of systems. To this end, we introduce a circular queue at each node of industrial network systems usually operated in open loop. Then we utilize the feedback information of the number of data in a queue, the data arriving interval in a queue and channel error to make the overall industrial network system in closed loop. We verify the improved performance of the network systems in view of throughput and fairness measures via the experimental results conducted in several field situation.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.375-383
• /
• 2009

The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1345-1348
• /
• 2002

기존의 TCP/IP 네트워크 상에서 혼잡을 제어하는 일반적인 방법은 end-to-end 피드백 방식이다. 혼잡이 발생했는지의 여부는 수신측의 ACK 신호로 예측할 수밖에 없으므로 RTT(round trip time)가 길어질 경우 혼잡처리 시간이 길어지게 된다. Active Network 기술을 이용한 ACC(Active Congestion Control)의 경우 혼잡이 발생한 라우터에서 전송자에게 직접적으로 정보를 전송하기 때문에 보다 빠른 혼잡처리가 가능하다. 비록 코어 라우터에서 패킷을 누락시키는 방법에 있어 상태정보를 필요로 하는 단점이 있지만 모의 실험 결과 향상된 처리량을 보여주었다. 혼잡처리에 있어 새로운 처리 방식은 AQM(Active Queue Management)이다. 이 방식은 RED 를 기본 모델로 변형된 것이 대부분이며 RED 가 갖는 단점을 개선하고 혼잡처리와 공평성(fairness)을 향상 시키는데 목적이 있다. 본 논문에서는 ACC 의 피드백 메커니즘과 AQM 의 융통성 있는 큐 관리 기법을 이용하여 보다 향상된 혼잡제어 기법을 보이겠다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.939-948
• /
• 1997

In this paper, we propose the new rate-based transmission rates control algorithm that allocates the fair band-width for ABR service in ATM network. In the traditional ABR service, bandwidth is allocated with constant rate increment or decrement, but in the proposed algorithm, it is allocated fairly to the connected calls by the fuzzy inference of the available bandwidth. The fuzzy inference uses buffer state and the buffer variant rate as the input variables, and uses the total transmission rate as a output variable. This inference a bandwidth is fairly distributed over all ABR calls in service. By simmulation, we showed that the proposed method improved 0.17% in link effectiveness when RIF, RDF is 1/4, 38.6% when RIF, RDF 1/16, and 82.4% when RIF, RDF 1/32 than that of the traditional EFPCA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.61-65
• /
• 2005

We propose a soft QoS-based borrowing scheme for call admission control(CAC) in DVB-RCS(Digital Video Broadcast-Return Channel via Satellite). Some of the ongoing calls temporarily and fairly release bandwidths that can be used to accommodate a new call in an overloaded satellite network. The amount of bandwidth borrowed from each call is proportional to each user's critical bandwidth ratio, one of parameters for soft QoS mechanism. Simulation results show that the proposed scheme improves the system performance in terms of call blocking probability and bandwidth utilization.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.1
• /
• pp.1-9
• /
• 2022

The PoN (Proof of Nonce) distributed consensus algorithm basically uses a non-competitive consensus method that can guarantee an equal opportunity for all nodes to participate in the block generation process, and this method was expected to resolve the first trilemma of the blockchain, called the decentralization problem. However, the decentralization performance of the PoN distributed consensus algorithm can be greatly affected by the network transaction transmission delay characteristics of the nodes composing the block chain system. In particular, in the consensus process, differences in network node performance may significantly affect the composition of the congress and committee on a first-come, first-served basis. Therefore, in this paper, we presented a problem by analyzing the decentralization performance of the PoN distributed consensus algorithm, and suggested a fairness control algorithm using a learning-based probabilistic acceptance rule to improve it. In addition, we verified the superiority of the proposed algorithm by conducting a numerical experiment, while considering the block chain systems composed of various heterogeneous characteristic systems with different network transmission delay.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.794-798
• /
• 2010

Assuming that a wireless link is mostly used at the network edge and the wireless NIC driver keeps monitoring the error rate of its link, this paper proposes an enhanced TCP congestion control, TCP-L (TCP Link-Aware). TCP-L predicts true congestion losses occurred inside the wired link area by utilizing the wireless link error rate. As a result, it mitigates performance degradation caused from TCP congestion control actions when segments losses occur in a wireless link. Experimental results show that TCP-L provides better performance and fairness in lossy wireless links than existing TCP congestion control schemes. Our approach utilizing the characteristic of the link at TCP could be well adapted to new wireless environments such as Cognitive Radio and ACK-less IEEE 802.11, where a frame may be delivered with a very long delay or lost in the link.