• 제어로봇시스템학회논문지
• /
• 제12권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.

• 한국멀티미디어학회논문지
• /
• 제17권12호
• /
• pp.1453-1460
• /
• 2014

WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

• 산업경영시스템학회지
• /
• 제20권41호
• /
• pp.51-60
• /
• 1997

In this paper, A Connection Admission Control(CAC) algorithm by Dynamic Bandwidth Allocation is proposed. The B-ISDN will be required to carry traffic generated by a various traffic sources. These source will have all traffic flow characteristics and quality of services requirements. When a connectionless message with burstiness arrives at a node during a renewal period, CAC will be dynamically determined connection request by using the predetermined connection admission bounds in estimating the number of input arriving cells. The proposed algorithm estimates the available bandwidth by observing cell streams of the aggregate traffic. A connection request is accepted if the available bandwidth is larger than declared peak rate, and otherwise rejected. The proposed CAC scheme is shown to be promising and practically feasible in obtaining efficient transmission of burst traffic with guaranteed quality of services.

• 한국통신학회논문지
• /
• 제27권5C호
• /
• pp.465-473
• /
• 2002

In this paper the authors propose a theoretic framework to design the Virtual Private Network (VPN) via which the Quality of Services (QoSs) are guaranteed over IP networks. The required QoS is a very strict packet loss probability or a probability that packet delay does not exceed a certain target value in a statistical manner. QoSs are guaranteed by providing a statistical bandwidth similar to equivalent bandwidth, which is computed so that the provided bandwidth is sufficient to guarantee those requirements. Two typical network architectures are considered in constructing VPN, the customer pipe scheme and the Hose scheme, and we propose a method to compute the amount of the required bandwidth for the two schemes. Finally, we investigate the implication of the scheme via numerical experiments.

• ETRI Journal
• /
• 제26권1호
• /
• pp.27-37
• /
• 2004

The architecture in a differentiated services (DiffServ) network is based on a simple model that applies a per-class service in the core node of the network. However, because the network behavior is simple, the network structure and provisioning is complicated. If a service provider wants dynamic provisioning or a better bandwidth guarantee, the differentiated services network must use a signaling protocol with QoS parameters or an admission control method. Unfortunately, these methods increase the complexity. To overcome the problems with complexity, we investigated scalable dynamic provisioning for admission control in DiffServ networks. We propose a new scalable $qDPM^2$ mechanism based on a centralized bandwidth broker and distributed measurement-based admission control and movable boundary bandwidth management to support heterogeneous QoS requirements in DiffServ networks.

• 한국정보과학회논문지:정보통신
• /
• 제37권6호
• /
• pp.415-419
• /
• 2010

본 논문에서는 이동 셀룰러 네트워크 환경에서 한정된 자원인 무선대역폭을 효율적으로 사용하기 위해 게임이론을 이용한 대역폭 예약 기법을 제안하였다. 제안된 기법에서는 게임 이론의 협상 해법 중 대표적인 NBS 기법을 이용하여 전체 시스템의 효용을 극대화하는 최적의 대역폭 대여량과 예약량을 계산한다. 성능평가 결과 제안된 기법이 다양한 네트워크의 상황에 탄력적으로 대응할 수 있었기에 기존에 제안된 기법에 비해 뛰어난 성능을 보임을 확인할 수 있었다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• pp.27-31
• /
• 1998

The growing usage of multimedia communication applications with specific bandwidth and real-time delivery requirements has created the needs for quality of service(QoS). In response to the growing demand for an integrated services, the Reservation Protocol(RSVP) has been designed to exchange resource reservation among routers in the internet. RSVP protocol provides the quality of service for real-time applications but the network efficiency is reduced because of the limited bandwidth. In order to use network resources efficiently. We compare the resource efficiency of traditional reservation methods with that of the proposed method and evaluate the performance of the internet phone.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.726-747
• /
• 2013

In order to support a large number of mobile stations (MSs) with statistical multiplexing in cellular networks, a random access scheme is widely used for uplink (UL) bandwidth request (BR). In the design of a random access based BR scheme, there are two important requirements: short connection delay and diverse Quality of Services (QoSs) support. Such requirements are crucial for IMT-Advanced systems like IEEE 802.16m to provide various types of fourth generation (4G) data services. IEEE 802.16m provides advanced UL BR schemes for non-real time polling service (nrtPS) and best-effort (BE) service to meet the requirements of short connection time and multiple QoS level support. In order to provide short connection time and multiple QoS support, three-step and differentiated BR procedures are adopted. In this paper, a novel modelling of IEEE 802.16m contention based BR scheme is proposed that uses a 2-dimensional discrete time Markov chain. Both the short access delay three-step BR procedures and normal five-step BR procedure are considered in the model. Our proposed model also incorporates the IEEE 802.16m differentiated BR procedure. With the proposed model, we extensively evaluate the performance of IEEE 802.16m BR for two different service classes by changing QoS parameters, such as backoff window size and BR timer. Computer simulations are performed to corroborate the accuracy of the proposed model for various operation scenarios. With the proposed model, accurate QoS parameter values can be derived for the IEEE 802.16m contention-based BR scheme.

• 대한전자공학회논문지TC
• /
• 제38권1호
• /
• pp.1-13
• /
• 2001

본 논문에서는 VBR 비디오 트래픽에 대해 통신망 내부에서의 동적인 자원 요청 및 할당을 통해, 사용자가 요구하는 서비스 품질을 만족시키는 동시에 자원의 효율적 사용을 제공할 수 있는 새로운 방법을 제안한다. 본 논문에서는 장면전환을 고려한 변형된 적응 선행 예측 방법을 사용하여 향후 스위치로 입력 레이트를 추정하고, 사용자가 요구한 평균 지연 및 손실률에 대해 현재 통신망에서 제공되고 있는 연결별 품질 만족도를 측정하여, 동적으로 필요한 대역을 할당한다. 사용자에게 연결 설정 기간 동안 일관된 서비스 품질을 제공하기 위해, 본 논문에서 정의한 ‘서비스 품질 만족도’를 이용하여 신규 호의 수락 여부를 결정한다. 모의실험을 통하여 제안된 방법은 QoS 요구사항에 따라 사용자에게 안정적인 서비스 품질을 제공하고 통신망 자원을 효율적으로 관리할 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.