• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.03 seconds

Study on Architecture of ATM LSR Supporting VC Merging and Traffic Engineering over It (VC 머징이 가능한 ATM LSR의 구조 및 트래픽 엔지니어링 연구)

  • Chung, Ho-Yeon;Seo, Jae-Young;Baek, Jang-Hyun
    • IE interfaces
    • /
    • v.15 no.2
    • /
    • pp.152-158
    • /
    • 2002
  • The explosive growth of the internet traffic in the last few years has imposed tremendous stress on today's routers, particularly in the core network. Recently, ATM LSRs(Label Switching Router) are potentially capable of providing the highest forwarding capacity in the backbone Internet network. VC merging is a mechanism in an ATM LSR that allows many IP routes to be mapped to the same VC label, and provides a scalable mapping method that can support thousands of destinations. VC merging requires reassembly buffers so that cells belonging to different packets intended for the same destination do not interleave with each other. In this study, we propose an architecture of the ATM LSR which supports VC merging. We propose traffic control scheme called APD(Active Packet Discard) algorithm so that predicts and controls the congestion of the Internet traffic effectively. We study the performance of this algorithm using simulation.

A Novel Scheme for Seamless Hand-off in WMNs

  • Vo, Hung Quoc;Kim, Dae-Sun;Hong, Choong-Seon;Lee, Sung-Won;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.4
    • /
    • pp.399-422
    • /
    • 2009
  • Although current wireless mesh network (WMN) applications experience a perceptually uninterrupted hand-off, their throughput after the hand-off event may be significantly degraded due to the low available bandwidth of the mobile client's new master. In this paper, we propose a novel mobility management scheme for 802.11-based WMNs that enables both seamless hand-off for transparent communications, and bandwidth awareness for stable application performance after the hand-off process. To facilitate this, we (i) present a new buffer moment in support of the fast Layer-2 hand-off mechanism to cut the packet loss incurred in the hand-off process to zero and (ii) design a dynamic admission control to grant joining accepts to mesh clients. We evaluate the benefits and drawbacks of the proposal for both UDP and TCP traffic, as well as the fairness of the proposal. Our results show that the new scheme can not only minimize hand-off latency, but also maintain the current application rates of roaming users by choosing an appropriate new master for joining.

Layer Selection Algorithms of H.264/SVC Streams for Network Congestion Control (네트워크 혼잡 제어를 위한 H.264/SVC 스트림의 계층 선택 알고리즘)

  • Kim, Nam-Yun;Hwang, Ki-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.44-53
    • /
    • 2011
  • H.264/SVC provides scalable video streams which consist of a base layer and one or more enhancement layers. Thus, it can efficiently adapt encoded streams to individual network conditions by dropping some layers of bit streams. However, on a dynamic environment such as the Internet, random packet losses due to network congestion can cause drastic effect on SVC quality. To avoid network congestion, the rate of video streams should be adjusted by carefully selecting a layer of each stream. In this paper, we propose three layer selection algorithms which can avoid network congestion by using the rate-distortion characteristics of streams. Simulation results show that FS(Far-Sighted) algorithm can maximize the overall PSNR value of streams by efficiently using the characteristics of video streams.

The Efficiency Design & MAC Function of the Composition Optical Network (광통신망 구축의 효과적인 설계 및 MAC고려 요소)

  • 하창국
    • Journal of the Korean Professional Engineers Association
    • /
    • v.34 no.4
    • /
    • pp.41-47
    • /
    • 2001
  • The paper describes SR3 (Synchronous Round Robin with Reservations), a collision-free medium access control protocol for all-optical slotted packet networks based on WDM multi-channel ring topologies where nodes are equipped with one fixed-wavelength receiver and one wavelength-tunable transmitter SR3 is derived from the SRR and MMR protocols previously proposed by the same authors for the same class of all-optical networks. SRR and MMR already achieve an efficient exploitation of the available bandwidth, while guaranteeing a throughput-fair access to each node. SR3, In addition, allows nodes to reserve slots. thereby achieving a stronger control on access delays; it is thus well suited to meet tight delay requirements, as it is the case for multimedia applications. Simulation results show that SR3 provides very good performance to guaranteed qualify traffic, but also brings signigicant performance improvements for best-effort traffic. Energy effciency is an important issue for optical network since they must rely on their batteries. We present a novel MAC protocol that achieves a good energy efficiency of optical interface of the network and provides support for diverse traffic types and QoS. The scheduler of the base station is responsible to provide the required QoS to connections on the optical link and to minimise the amount of energy spend by the High speed Network. The main principles of the MaC protocol are to avoid unsuccessful actions, minimise the number of transitions , and synchronise the mobile and the base-station. We will show that considerable amounts of energy can be saved using these principles.

  • PDF

Adaptive FEC and Rate Adaptation for High-speed Transport (고속 전송을 위한 적응형 FEC 및 전송률 제어)

  • Chang Hye young;Kim Jong won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.85-94
    • /
    • 2005
  • In this paper, we propose a reliable high-speed UDP-based media transport with an adaptive error control. The proposed adaptive transport scheme controls the amount of redundancy by monitoring the network in order to adapt to network fluctuations efficiently. The feedback of receiver enables the sender to be aware of current reception status (i.e., rate and type of packet loss) and to estimate the expected network status. Based on this, the proposed transport attempts to enable reliable transport by adaptively controlling the amount of both whole sending rate and the ratio for adaptive FEC code. Experiment with high-speed network has been conducted to verify the performance of the proposed system that demonstrates the enhanced reliability of the proposed transport at the speed of up to several hundred Mbps.

A Fair Scalable Inter-Domain TCP Marker for Multiple Domain DiffServ Networks

  • Hur, Kyeong;Eom, Doo-Seop
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.338-350
    • /
    • 2008
  • The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Ahn, Kye-Hyun;Han, Kyeong-Eun;Kim, Young-Chon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.321-331
    • /
    • 2004
  • In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

  • PDF

Development of web based shape inspection system for the forging products having complicated shapes (인터넷을 이용한 정밀단조품의 품질평가 시스템 개발에 관한 연구)

  • Park, K.S.;Kim, B.J.;Jang, J.H.;Moon, Y.H.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2006.05a
    • /
    • pp.211-214
    • /
    • 2006
  • The outer race of the constant velocity(CV) joint is an important load-supporting automotive part, which transmits torque between the transmission and the wheel. The outer race is difficult to forge, because its shape is very complex and the required dimensional tolerances are very stringent. Therefore, the internet based shape inspection system is developed in this study to provide quick and accurate data through the easy control from users. Proposed system uses mechanical displacement sensors to measure the shape of CV joint that has six inner ball grooves, and commercially available Lab-View program is used to process measured data into the dimensional shape. Developed program provides a simple user interface that enables users real-time access of data measured from industrial production lines. Furthermore, it can exchange measured data via the internet between users and forging system operators. A java applet helped the system connection via internet. A data, IP access, is transmitted to the packet by TCP/IP. Our proposed system has many advantages over current measuring systems including fast and efficient data processing by real-time control, and system flexibility.

  • PDF

An Adaptive FEC Code Control Algorithm for Mobile Wireless Sensor Networks

  • Ahn Jong-Suk;Hong Seung-Wook;Heidemann John
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.489-498
    • /
    • 2005
  • For better performance over a noisy channel, mobile wireless networks transmit packets with forward error correction (FEC) code to recover corrupt bits without retransmission. The static determination of the FEC code size, however, degrades their performance since the evaluation of the underlying channel state is hardly accurate and even widely varied. Our measurements over a wireless sensor network, for example, show that the average bit error rate (BER) per second or per minute continuously changes from 0 up to $10^{-3}$. Under this environment, wireless networks waste their bandwidth since they can't deterministically select the appropriate size of FEC code matching to the fluctuating channel BER. This paper proposes an adaptive FEC technique called adaptive FEC code control (AFECCC), which dynamically tunes the amount of FEC code per packet based on the arrival of acknowl­edgement packets without any specific information such as signal to noise ratio (SNR) or BER from receivers. Our simulation experiments indicate that AFECCC performs better than any static FEC algorithm and some conventional dynamic hybrid FEC/ARQ algorithms when wireless channels are modeled with two-state Markov chain, chaotic map, and traces collected from real sensor networks. Finally, AFECCC implemented in sensor motes achieves better performance than any static FEC algorithm.

VoIP Receiver Structure for Enhancing Speech Quality Based on Telematics (텔레메틱스 기반의 VoIP 음성 통화품질 향상을 위한 수신단 구조)

  • Kim, Hyoung-Gook;Seo, Kwang-Duk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.3
    • /
    • pp.48-54
    • /
    • 2012
  • The quality of real-time voice communication over Internet Protocol networks based on telematics is affected by network impairments such as delays, jitters, and packet loss. To resolve this issue, this paper proposes a receiver-based enhancing method of VoIP speech quality. The proposed method enables users to deliver high-quality voice using playout control and signal reconstruction, which consists of concealment of lost packets, adaptive playout-buffer scheduling using active jitter estimation, and smooth interpolation between two signals in a transition region. The proposed algorithm achieves higher Perceptual Evaluation of Speech Quality (PESQ) values and low buffering delay than the reference algorithm.