• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.032 seconds

Transmission Rate Priority-based Traffic Control for Contents Streaming in Wireless Sensor Networks (무선 센서 네트워크에서 콘텐츠 스트리밍을 위한 전송율 우선순위 기반 트래픽제어)

  • Lee, Chong-Deuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.7
    • /
    • pp.3176-3183
    • /
    • 2011
  • Traffic and congestion control in the wireless sensor network is an important parameter that decides the throughput and QoS (Quality of Service). This paper proposes a transmission rate priority-based traffic control scheme to serve digital contents streaming in wireless sensor networks. In this paper, priority for transmission rate decides on the real-time traffic and non-real-time with burst time and length. This transmission rate-based priority creates low latency and high reliability so that traffic can be efficiently controlled when needed. Traffic control in this paper performs the service differentiation via traffic detection process, traffic notification process and traffic adjustment. The simulation results show that the proposed scheme achieves improved performance in delay rate, packet loss rate and throughput compared with those of other existing CCF and WCA.

A Traffic Distribution Scheme for Connectionless Data Service using Multi-Path in ATM Networks (ATM 망에서 다중 경로를 이용한 비연결형 트랙픽의 분산 기법)

  • 서원석;오영열;김석규;이배용;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.103-118
    • /
    • 1996
  • With the advent of B-ISDN based on ATM technonlogy, ther are increasing needs for the interconnection of existing LAN/MAN's through ATM networks. ATM networks, therefore, must provide connectionless service. In this paper, the traffic distributio scheme using multi-path is proposed to support efficient connectionless service in ATM networks. Because the proposed scheme distributed the bursty traffic arrived in the interworking unit (IWU) and the connectionless server (CLS) from LAN-terminals, it alleviates the packet loss ratio caused by buffer overflow at IWU/CLS and is able to use nettowrk resources efficiently according to the network conditions and the amount of the traffic arrived at IWU/CLS. This paper presents the distribution algorithm and the IWU/CLS, CLS-CLS closed-loop rate control scheme.

  • PDF

Explicit Multicast Extension (Xcast+) for Efficient Multicast Packet Delivery

  • Shin, Myung-Ki;Kim, Yong-Jin;Park, Ki-Shik;Kim Sang-Ha
    • ETRI Journal
    • /
    • v.23 no.4
    • /
    • pp.202-204
    • /
    • 2001
  • In this letter, we propose a new multicast scheme, named Xcast+, which is an extension of Explicit Multicast (Xcast) for an efficient delivery of multicast packets. The mechanism incorporates the host group model and a new control plane into existing Xcast, and not only does it provide the transparency of traditional multicast schemes to senders and receivers, but it also enhances the routing efficiency in networks. Since intermediate routers do not have to maintain any multicast states, it results in a more efficient and scalable mechanism to deliver multicast packets. Our simulation results show distinct performance improvements of our approach compared to Xcast, particularly as the number of receivers in a subnet increases.

  • PDF

Performance Analysis of the IEEE 802.11 Distribution Coordination Function (DCF)

  • Ryou, Myung-Seon;Park, Hong-Seong;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1474-1479
    • /
    • 2003
  • This paper proposes a transmission interval which includes collisions and retransmissions in the IEEE 802.11 DCF. The transmission probability is used for the calculation of collisions and retransmissions in the DCF. Since the noises are considered to analyze the transmission interval, retransmissions by the noises are included in the proposed transmission interval. The proposed transmission interval takes account of the retransmissions by packet errors, and makes it possible to analyze the maximum throughput of the DCF.

  • PDF

Efficient Hybrid ARQ schemes for Wireless Communication Systems

  • Ryoo, Sun-Heui;Kim, Soo-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.342-345
    • /
    • 2004
  • An efficient hybrid ARQ scheme based on the rate compatible block turbo codes has been proposed, and its performance has been analyzed. System efficiency is improved by means of adaptive rate code transmission using channel information, trading off bit rate for channel codes, with resulting energy saving. The rate adaptation scheme improves power efficiency while keeping packet delay minimized. On the other hand, power dependant strategies reduce power consumption. Simulation results show that the benefits obtained are very encouraging. The modified hybrid ARQ schemes with the channel information and efficient retransmission structures highly improve the throughput performance in the satellite communication system. Therefore, proposed schemes could be used in future communication systems.

  • PDF

QoS Based Routing Algorithm with Crank-Back Ability

  • Kanthavong, Somphone;Tangtisanon, Prakit;Lertwatechakul, Mayuree
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2413-2417
    • /
    • 2003
  • This paper proposes an improvement of a QoS based routing protocol. The hierarchical source routing algorithm[4] was improved by including of the Crank-Back algorithm[2]. The Crank-Back capability is the ability to solve the problem of selecting the wrong route because of using unsynchronized routing information in the ingress router. In order to reduce time of reversing the call-setup process back to the ingress router, spare-route information is included with a call-setup packet. Spare-route information could be used by every router to find the next appropriated link itself when insufficient resource of the selected link was found. The proposed algorithm improves the performance of the source routing call-setup process significantly.

  • PDF

Adaptive Fault-tolerant Multistage Interconnection Network (적응적 결함-허용 다단계 상호연결망)

  • 김금호;김영만;배은호;윤성대
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.199-202
    • /
    • 2001
  • In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.

  • PDF

A Developed Collision Resolution Algorithm in MAC Protocol for IEEE 802.11b Wireless LANs (ICEIC'04)

  • Chung Kyung Taek;Pan Ce;Park Hyun;Kim Byun Gon;Chon Byoung Sil
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.681-685
    • /
    • 2004
  • Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

  • PDF

A Study on the Buffer Management and Scheduling of TCP/IP for GFR service in the ATM networks (ATM망에서 GFR서비스를 위한 TCP/IP의 버퍼 관리방법과 스케쥴링에 관한 연구)

  • 문규춘;최현호;박광채
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.275-278
    • /
    • 2000
  • Recently ATM(Asynchronous Transfer Mode) technology is facing challenges from Integrated Service IP(Internet Protocol), IP router, Gigabit Ethernet. Although ATM is approved by ITU-T as the standard technology in B-ISDN, its survival is still in question. In the ATM networks, the Guaranteed Frame Rate(GFR) service has been designed to accommodate non-real-time applications, such as TCP(Transmission Control Protocol)/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fairshare of available resources. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP Traffic is carried. Through simulations, we know that only per-VC queueing with weighted Round Robin(WRR) can guarantee Minimum Cell Rate Among all the Schemes that have been experimented, we recommend DT-EPD(Dynamic Threshold-Early Packet Discard) integrated with MCRplus(Minimum Cell Rate) to support the GFR service.

  • PDF

Architecture and Call Setup Latency of a Softswitch for VoIP Service (소프트스위치 시스템의 호처리 성능 향상)

  • Kim, Sung-Chul;Yoo, Byun-Hoon;Lee, Byung-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.113-118
    • /
    • 2005
  • Softswitch is the core BcN equipment which voice and multimedia switching based on the IP Technologies. It is designed to replace the Class 5(local Exchange) and Class 4(Toll Exchange) switch based on the circuit wired and wireless switching network technologies. Softswitch gets its name because typically it is a software based solution implemented on general purpose computers/servers. While the traditional PSTN switches are rely on dedicated facilities for T and S inter-connection and are designed primarily for voice communications. Packet based Softswitch is divided the control of call and bearer, very different from Public telephone network. Sometimes Call Agent or Media Gateway Controller, a key component in the VoIP solution, is also called Softswitch. This paper will suggest the software architecture of softswitch for performance in call processing part, also suggest the session management model to cover call setup latency.

  • PDF