• Title/Summary/Keyword: Time delay protocol

Search Result 538, Processing Time 0.027 seconds

A Receiver-driven TCP Flow Control for Memory Constrained Mobile Receiver (제한된 메모리의 모바일 수신자를 고려한 수신자 기반 TCP 흐름 제어)

  • 이종민;차호정
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.91-100
    • /
    • 2004
  • This paper presents a receiver-driven TCP flow control mechanism, which is adaptive to the wireless condition, for memory constrained mobile receiver. A receiver-driven TCP flow control is, in general, achieved by adjusting the size of advertised window at the receiver. The proposed method constantly measures at the receiver both the available wireless bandwidth and the packet round-trip time. Depending on the measured values, the receiver adjusts appropriately the size of advertised window. Constrained by the adjusted window which reflects the current state of the wireless network, the sender achieves an improved TCP throughput as well as the reduced round-trip packet delay. Its implementation only affects the protocol stack at the receiver and hence neither the sender nor the router are required to be modified. The mechanism has been implemented in real environments. The experimental results show that in CDMA2000 1x networks the TCP throughput of the proposed method has improved about 5 times over the conventional method when the receiver's buffer size is limited to 2896 bytes. Also, with 64Kbytes of buffer site, the packet round-trip time of the proposed method has been reduced in half, compared the case with the conventional method.

Multicast Methods in Support of Internet Host Mobility (인터넷 상에서 호스트 이동성을 지원하는 멀티캐스트 방안)

  • Bang, Sang-Won;Jo, Gi-Hwan;Kim, Byeong-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.5
    • /
    • pp.1231-1242
    • /
    • 1997
  • This paper deals with an IP mukticast protocol in support of host mobility. Most of the previous multicast schemes have utilized an underlying logical strucuture of network topology,in order to provide a certain degree of order and predictability.On the other hand,mobility implies that a host location relaative to the rest of the net-work changes with time;the physical connectivity of the entire network is thus modified as move.In this case.some multicast datagrams nay not delivered properly,or may delivered twice or more,to a mobile host because the destinations will keep moving whlist datagrams are dekivered with different time delay.This paper first describes the relation between host mobility and multicast, by exploring the possible interactions,and presents a multicast scheme in support of Internet host mobility.A revised scheme is then proposed to adapt the multicast semantic and to optimize the communication overhead.

  • PDF

Fast MAS Reallocation Method for Efficient Video Streaming Service of WiMedia MAC DRP (WiMedia MAC DRP 프로토콜에서 효율적인 영상 스트리밍 서비스를 위한 Fast MAS 재조정 기법)

  • Chung, Taewook;Chung, Chulho;Kim, Jaeseok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.1048-1057
    • /
    • 2015
  • In this paper, we propose a fast MAS reallocation method that can avoid reservation conflicts in the DRP process of WiMedia system in real time. WiMedia MAC DRP has been developed aimed QoS support for audio and video transmission that generate traffic periodically. The size variation of the video streaming data causes DRP reservation conflicts frequently, so that DRP could not support QoS of the video streaming service which is delay-sensitive. Fast MAS reallocation method could avoid reservation conflicts in real-time analyzing reservation requests information of the other device. Our proposed method is evaluated with test sequences using the software simulation and implemented in hardware/software with the integrated WiMedia MAC/PHY system.

Dynamic Allocation of Channel Times based on Link Quality of HR-WPAN (HR-WPAN에서 링크 상태에 따른 동적 채널 타임 할당 기법)

  • Kang, Jae-Eun;Byun, Sung-Won;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.264-273
    • /
    • 2009
  • For IEEE 802.15.3 HR-WPAN, we propose the DABL algorithm that PNC can allocate the channel times to the DEV in super frame in order that system frame throughput is increased and the delay is decreased. In detail, the DABL algorithm allows to dynamically allocate channel time as well as to adaptively apply the modulation and coding scheme based on the link quality of the DEV. In addition, due to the facts that QoS is quite different depending on service types, we provide the DABL algorithm taking into account RT(Real Time) traffic and Non-RT traffic respectively. Finally, we show simulation results of the DABL algorithm compared to the conventional algorithm that the PNC equally allocates channel times to the DEV regardless of the link quality of the DEV.

Efficient Differentiated Bandwidth Allocation for QoS based Ethernet PON System (QoS 기반의 EPON 시스템에서 효율적인 차등 대역폭 할당)

  • Eom Jong-Hoon;Jung Min-Suk;Kim Sung-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.156-166
    • /
    • 2005
  • Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

ELiSyR: Efficient, Lightweight and Sybil-Resilient File Search in P2P Networks

  • Kim, Hyeong-S.;Jung, Eun-Jin;Yeom, Heon-Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.1311-1326
    • /
    • 2010
  • Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

A Study on the security demand and Handoff of the pocket Internet (Wibro) with MIPv6 (MIPv6 의한 휴대인터넷(Wibro)의 보안요구 및 Handoff에 관한 연구)

  • Lee, Cheong-Jin;Kim, Do-Hwan;Kwon, Oh-Heung
    • Journal of Digital Contents Society
    • /
    • v.7 no.3
    • /
    • pp.161-168
    • /
    • 2006
  • Wibro(Wibro - Wireless Broadband Internet ) is a system that can accept effectively the IP-based Wireless data traffic with upward / downward asymmetric transfer characteristic by using a Wirelss broadband transfer technology in OFDMA/TDD (Orthogonal frequency Division Multiple Access/Time Division Duplex). Wibro service should support handover to maintain connection continuously in movement because the service is based on If system which is different from cellular system. Current Micro Mobility system and general Mobile If system has got a problem of delayed speed and lost packets during handover. IETF protocol has been proposed for minimizing this problem and its standardization is under process, mainly focused on Mip4, Mip6 and Mipshop WG. This article studies and analyzes an effective method of minimizing handover delay to improve the problem of WiBro system and its revitalization & outlook.

  • PDF

QoS Aware Cross-layer MAC Protocol in wireless Sensor Networks (무선 센서 네트워크에서 QoS를 인지하는 Cross-layer MAC 프로토콜)

  • Park, Hyun-Joo;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2811-2817
    • /
    • 2010
  • In this paper we propose the QAC-MAC that supports Quality of Service(QoS) and saves energy resources of the sensor node, and hence prolonging the lifetime of the sensor network with multiple sink nodes. Generally, the nodes nearest to the sink node often experience heavy congestion since all data is forwarded toward the sink through those nodes. So this critically effects on the delay-constraint data traffics. QAC-MAC uses a hybrid mechanism that adapts scheduled scheme for medium access and scheduling and unscheduled scheme based on TDMA for no data collision transmission. Generally speaking, characteristics of the real-time traffic with higher priority tends to be bursty and has same destination. QAC-MAC adapts cross-layer concept to rearrange the data transmission order in each sensor node's queue, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

A Distributed Conference Architecture with a New Load Control Method (새로운 부하 제어 방식을 사용한 분산형 컨퍼런스 구조)

  • Jang, Choon-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.67-73
    • /
    • 2012
  • A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.

Decentralized TDM-PON MAC Protocol Based on Power Detection (파워검출 기반의 분산형 TDM-PON MAC 프로토콜)

  • Lee, Sung-Kuen;Kim, Eal-Lae;Lee, Yong-Won;Lee, Sang-Rok;Jung, Dae-Kwang;Hwang, Seong-Taek;Oh, Yun-Je;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.83-89
    • /
    • 2007
  • In this paper, we have proposed the power detection (PD)-based TDM-PON architecture, which is implemented with a hardware-based decentralized DBA (Dynamic Bandwidth Allocation) algorithm among ONUs, without OLT's intervention. Of particular importance in the proposed approach is that the hardware-based power detection scheme is used to manage the distributed MAC algorithm without any complex, time-consuming and costly software-processing elements for DBA in ONUs and OLT. We evaluate the performance of average packet end-to-end delay in a statistical analysis and numerical analysis. In addition, through simulations with various traffic models, we verified the superior performance of the proposed approach by comparing with the results of other E-PONs.