• Title/Summary/Keyword: Bandwidth

Search Result 7,446, Processing Time 0.036 seconds

Implementation and Experimental Evaluation of Bandwidth Allocation Scheme on MS/TP Protocol (MS/TP 프로토콜에서 대역폭할당기법 구현 및 실험적 평가)

  • Kwon, Young-Chan;Hong, Seung-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.11
    • /
    • pp.1144-1155
    • /
    • 2006
  • Digital communication networks have become a core technology in advanced building automation systems. BACnet(Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing(MS/TP) protocol as one of its field level networks. In this study, we introduce a method of implementing a bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we actually developed the hardware and firmware of the modified MS/TP communication module in which the bandwidth allocation scheme is implemented. Using the modified MS/TP communication module, we developed an experimental model in order to examine the validity of the bandwidth allocation scheme in the MS/TP protocol. Experimental results show that the modified MS/TP protocol satisfies the requirements of real time communication for periodic and urgent messages of BACnet communication services.

BandBlock: Bandwidth allocation in blockchain-empowered UAV-based heterogeneous networks

  • Kuna Venkateswarararao;Pratik Kumar;Akash Solanki;Pravati Swain
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.945-954
    • /
    • 2022
  • The 5G mobile network is promising to handle the dynamic traffic demands of user equipment (UE). Unmanned aerial vehicles (UAVs) equipped with wireless transceivers can act as flying base stations in heterogeneous networks to ensure the quality of service of UE. However, it is challenging to efficiently allocate limited bandwidth to UE due to dynamic traffic demands and low network coverage. In this study, a blockchain-enabled bandwidth allocation framework is proposed for secure bandwidth trading. Furthermore, the proposed framework is based on the Cournot oligopoly game theoretical model to provide the optimal solution; that is, bandwidth is allocated to different UE based on the available bandwidth at UAV-assisted-based stations (UBSs) with optimal profit. The Cournot oligopoly game is performed between UBSs and cellular base stations (CBSs). Utility functions for both UBSs and CBSs are introduced on the basis of the available bandwidth, total demand of CSBs, and cost of providing cellular services. The proposed framework prevents security attacks and maximizes the utility functions of UBSs and CBSs.

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • 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.

  • PDF

ENUMERATION OF OPTIMALLY LABELLED GRAPHS OF BANDWIDTH 2

  • Chae, Gab-Byung;Cheong, MinSeok;Kim, Sang-Mok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.1883-1891
    • /
    • 2017
  • An optimally labelled graph of bandwidth 2 is an ordered pair (G, f) where G is a simple graph with bw(G) = 2 and $f:V(G){\rightarrow}[n]$ is a bijection such that bw(G, f) = 2. In this paper, the number of optimally labelled graphs of bandwidth two of order n is enumerated by counting linear forests.

Performance Evaluation of a Bandwidth Allocation Algorithm of E-PON (가입자 통신망을 위한 대역 할당 알고리즘 성능 분석)

  • Ju, Un-Gi;Lee, Sang-U;Kim, Chan;Gwon, Yul
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.361-364
    • /
    • 2005
  • As increasing the Internet traffic, many researches on access network are reported for end-to-end high-speed broadband network, where E-PON(Ethernet-Passive Active Network) is one of reasonable candidate fur the network with respect to cost and bandwidth utilization. For the high-speed access network, E-PON need an efficient bandwidth allocation method. This paper suggests a WFA(Water-Filling Allocation) algorithm for the efficient bandwidth allocation with various simulation test.

  • PDF

Dynamic Bandwidth Allocation Algorithm using Multiple LLID in EPON (EPON에서 Multiple LLID를 이용한 동적대역할당 알고리즘)

  • Bae, Gyeong-Won;Kim, Gyu-Won;Eom, Ho-Seok;Jeong, Je-Myeong
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2005.02a
    • /
    • pp.162-163
    • /
    • 2005
  • One of the most important things in EPON(Ethernet Passive Optical Network) is that ONUs(Optical Network Units) have to share a channel in upstream direction. We proposed a new algorithm of Dynamic Bandwidth Allocation using Multiple LLID(Logical Link IDentifier). We show how to allocate bandwidth in Queues for improving performance from Bandwidth using Multiple LLID.

  • PDF

Channel-adaptive Image Compression for Wireless Transmission

  • Lee, Yun-Gu;Lee, Ki-Hoon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.4
    • /
    • pp.276-280
    • /
    • 2017
  • This paper presents computationally efficient image compression for wireless transmission of high-definition video, to adaptively utilize available channel bandwidth and improve image quality. The method indirectly predicts an unknown available channel bandwidth by monitoring encoder buffer status, and adaptively controls a quantization parameter to fully utilize the bandwidth. Experimental results show that the proposed method is robust to variations in channel bandwidth.

QoS oriented bandwidth management scheme on the ATM based IMT-2000 networks (ATM 기반 IMT-2000망에서 QoS에 기반한 대역폭 관리기법)

  • 조성현;양승제;박성한
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.35-38
    • /
    • 1999
  • In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

  • PDF

HEDGING OPTION PORTFOLIOS WITH TRANSACTION COSTS AND BANDWIDTH

  • KIM, SEKI
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.77-84
    • /
    • 2000
  • Black-Scholes equation arising from option pricing in the presence of cost in trading the underlying asset is derived. The transaction cost is chosen precisely and generalized to reflect the trade in the real world. Furthermore the concept of the bandwidth is introduced to obtain the better rehedging. The model with bandwidth derived in this paper can be used to calculate the more accurate option price numerically even if it is nonlinear and more complicated than the models shown before.

  • PDF

Variable Bandwidth Selection for Kernel Regression

  • Kim, Dae-Hak
    • Journal of the Korean Data and Information Science Society
    • /
    • v.5 no.1
    • /
    • pp.11-20
    • /
    • 1994
  • In recent years, nonparametric kernel estimation of regresion function are abundant and widely applicable to many areas of statistics. Most of modern researches concerned with the fixed global bandwidth selection which can be used in the estimation of regression function with all the same value for all x. In this paper, we propose a method for selecting locally varing bandwidth based on bootstrap method in kernel estimation of fixed design regression. Performance of proposed bandwidth selection method for finite sample case is conducted via Monte Carlo simulation study.

  • PDF