• Title/Summary/Keyword: Packet Delay

Search Result 1,167, Processing Time 0.026 seconds

Emergency Message Transmission Protocol using CSMA/TDMA in Medical Body Area Networks(MBANs) (Medical Body Area Networks(MBAN)에서 CSMA/TDMA를 이용한 긴급 메시지 전송 프로토콜)

  • Kim, Kyung-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.2
    • /
    • pp.224-230
    • /
    • 2009
  • In the latest date, medical body area networks (MBANs) are emerging as a new technology for diagnosis the human body. MBANs in the health care fields are based on short-range and low-power (e.g. ubiquitous computing) among small-sized devices, and have been used by means of medical services. In this paper, we proposed an emergency message transmission protocol using carrier sense multiple access/time division multiple access in MBANs. This scheme focuses on dependability and power-efficiency. In order to increase the reliability of the transmission, this scheme modified a MCTA slot of IEEE 802.15.3 standard to a SR-MCTA slot. SR-MCTA slot is assigned by MBAN coordinator according to requesting terminal nodes. The method, having the priority of transmission, occurs a collision packet randomly. Results from this proposed solution revel that reservation-based TDMA medical body area network(MBAN) protocol for transmitting emergency message was improved in terms of transmission delay.

  • PDF

Reserved Slot Allocation Scheme for Voice Service in WATM MAC (무선 비동기 전송모드 매체 접근제어에서 음성서비스를 위한 예약 슬롯 할당 알고리즘)

  • 김관웅;배성환;전병실
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.7
    • /
    • pp.101-108
    • /
    • 2001
  • In this paper we focus on dynamic reservation slot allocation scheme for supporting QoS of a voice traffic in WATM MAC. Especially, voice traffic is the most important real-time object, and so we propose a new MAC protocol for voice traffic over WATM networks in the multimedia environment. According to the characteristics of voice traffic which is repeatedly in silent state and active state, new protocol allocates reservation slots dynamically with respect to the number of silent voice source of which starting time is stored to the state table in base station (BS). The simulation results show that the proposed protocol has better performance than slotted ALOHA in average access delay, collision rate, better than NC-PRMA(Non Collision Packet Reservation Multiple Access) in band width efficiency, and can provide a certain level of QoS requirement by the given slot assignment even though the number of voice terminals is increased.

  • PDF

A Protocol Compression Scheme for Improving Call Processing of Push-To-Talk Service over IMS (IMS망에서 PTT서비스의 통화 처리 성능 향상을 위한 프로토콜 압축 기법)

  • Jung, In-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.257-271
    • /
    • 2009
  • In this paper, we propose a protocol compression scheme for enhancing the performance of call processing of PTT(Push-to-Talk) which is one of the important services in IMS(IP Multimedia Subsystem), a next generation integrated wired/wireless packet communication network. To service the PTT on an IMS network, it should use the same call setup procedure as legacy Mobile and TRS(Trunked Radio System) networks and have a fast call setup time and enough communication bandwidth because a number of terminals should be able to exchange same data in real time. The proposed A+SigComp scheme reduces the initial call setup delay of SIP by about 10%, which is used by PTT service for call setup. In addition, the A+ROHC scheme is proposed to compress the header of RTP packets transferred during PTT voice transmission and, as a result, about 5% of increase in communication efficiency is observed.

  • PDF

A Linear System Approach to Serving Gaussian Traffic in Packet-Switching Networks (패킷 교환망에서 가우스 분포 트래픽을 서비스하는 선형 시스템 접근법)

  • Chong, Song;Shin, Min-Su;Chong, Hyun-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.553-561
    • /
    • 2002
  • We present a novel service discipline, called linear service discipline, to serve multiple QoS queues sharing a resource and analyze its properties. The linear server makes the output traffic and the queueing dynamics of individual queues as a linear function of its input traffic. In particular, if input traffic is Gaussian, the distributions of queue length and output traffic are also Gaussian with their mean and variance being a function of input mean and input power spectrum (equivalently, autocorrelation function of input). Important QoS measures including buffer overflow probability and queueing delay distribution are also expressed as a function of input mean and input power spectrum. This study explores a new direction for network-wide traffic management based on linear system theories by letting us view the queueing process at each node as a linear filter.

Performance Analysis about the Failure Restoration Scheme Using a Multi-path in Hierarchical MPLS Networks (계층형 MPLS 네트워크에서 다중 경로를 이용한 장애 복구 방안에 관한 성능 분석)

  • Jang, Seong-Jin;Kim, Ki-Yong;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.61-64
    • /
    • 2007
  • MPLS networks architectures have been prevailed as scalable approach to provide quality of service in the Internet. Many researches have been mainly focused on scalability and multi-path calculation scheme for failure restoration. However, the MPLS network have an scalability problem about traffic, and the existing failure restoration methods are wasted resources, and it has the problem that loss of a packet by a lot of delay occurs in too. Therefore in this paper, we propose a H-MPLS (Hierachical-Multiprotocol Label Switching)network for rapidly failure restorations and effective management of network extended. The proposed H-MPLS Network apply LSP multi-path routing algorithm and consists of several MPLS. After comparing the performance among the existing failure restoration methods with various network models, we use NS simulator in order to analyze the performance. Finally, we present an improvement scheme of the efficiency and scalability.

  • PDF

A Nested Network Mobility Support Scheme in a Proxy MIPv6 Domain (Proxy MIPv6 도메인에서 중첩 네트워크 이동성 지원 방안)

  • Park, Hee-Dong;Kim, Do-Hyeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1385-1391
    • /
    • 2008
  • The network-based IP mobility solution - Proxy MIPv6 provides a mobile node with local mobility support without requiring MIPv6 functionality of the mobile node by using two principle functional entities, LMA (Local Mobility Anchor) and MAG (Mobile Access Gateway) located in a Proxy MIPv6 domain. Yet, in case that a mobile node moves into a mobile network located in the domain, the mobile node can't receive the local mobility support any more because it can't communicate with the MAG. This paper proposes a scheme to support nested network mobility in a Proxy MIPv6 domain by adding MAG functionality to a mobile router in the mobile network and evaluates the performance of the proposed scheme. Performance analysis shows that the proposed scheme can increase the performance of handover delay, signaling costs, and packet loss ratio.

  • PDF

Estimating the Optimal Buffer Size on Mobile Devices for Increasing the Quality of Video Streaming Services (동영상 재생 품질 향상을 위한 최적 버퍼 수준 결정)

  • Park, Hyun Min
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.3
    • /
    • pp.34-40
    • /
    • 2018
  • In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

Performance Analysis of IPACT MAC Protocol for Gigabit Ethernet-PON (Gigabit Ethernet-PON을 위한 IPACT 매체접근제어 방식의 성능분석)

  • Shin Ji hye;Lee Jae yong;Kim Byung chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.114-129
    • /
    • 2005
  • In this paper, we examine Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm which was proposed to control upstream traffic for Gigabit Ethernet-PONs, and we analyze the performance of the gated service and the limited service of the IPACT mathematically. For the mathematical performance analysis, we model IPACT algorithm as a polling system and use mean-value analysis. We divide arrival rate λ value into three regions and analyze each region accordingly. We obtain average packet delay, average queue size and average cycle time of both the gated and the limited service. We compare analytical results with simulation to verify the accuracy of the mathematical analysis. Upon now, simulation analysis have been used to evaluate the performance of EPONs, which require much time sud effort. Mathematical analysis can be widely used in the design of EPON systems since system designers can obtain various performance results rapidly.

Source-based Multiple Gateway Selection Routing Frotocol in Ad-hoc Networks (애드 흑 네트워크에서 소스 기반 다중 게이트웨이 선출 라우팅 프로토콜)

  • Lee Byung-Jin;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8A
    • /
    • pp.679-687
    • /
    • 2005
  • A mobile ad-hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. It is necessary to use bandwidth effectively because MANET has limited bandwidth. In this paper, we propose SMGS (source based multiple gateway selection routing protocol). In SMGS, each node estimates its expected life time (ELT) and if its ELT is larger than that of current gateway it becomes a candidate node. When a source node establishes a path, in each grid the candidate node will take the route request and be a gateway node for the each source node. The node that is expected to stay the longest time in the grid is selected so that we can reduce frequent gateway handoff, packet loss, and handoff delay.

Performance Analysis of Group Scheduling with Look-Ahead Algorithm for Optical Burst Switching Networks (광 버스트 스위칭 네트워크에서 Look-Ahead 알고리즘을 적용한 그룰 스케줄링의 성능 분석)

  • Shin, Jong-Dug;Jang, Won-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1037-1043
    • /
    • 2006
  • There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.