• Title/Summary/Keyword: Packet Service

Search Result 1,157, Processing Time 0.025 seconds

Wireless Internet DiffServ Packet Scheduling Algorithm over Wireless Networks with Location-dependent Channel Errors (위치 종속적 채널 에러 특성을 갖는 무선망에서 인터넷 DiffServ QoS 제공을 위한 패킷 스케줄링 알고리즘)

  • 신강식;유상조
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.46-58
    • /
    • 2003
  • The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

An Enhanced Mobile Multicast Protocol

  • Nam, Sea-Hyeon
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.61-64
    • /
    • 2005
  • The packet loss problem that occurs in the mobile multicast (MoM) protocol due to designated multicast service provider (DMSP) handoff is investigated through simulation experiments for several DMSP selection policies. Then, two enhanced DMSP schemes are proposed to minimize the packet loss of the MoM protocol with single DMSP. The first scheme uses a backup DMSP and greatly reduces the packet loss rate at the expense of the increased network traffic. The second scheme utilizes the extended DMSP operation and shows many desirable features such as the almost-zero packet loss rate and relatively low network traffic.

  • PDF

An Analysis Tool for Deriving Bounds on Delay and Buffer Size in Packet Networks (패킷 네트워크에서 지연과 버퍼 크기 한계를 추출할 수 있는 분석 도구)

  • 편기현;송준화;이흥규
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.641-648
    • /
    • 2003
  • In this paper, we propose a general analysis tool that derives guaranteed delay bounds for real-time sessions when those sessions pass through heterogeneous schedulers in general packet networks. This tool characterizes each different scheduler by a homogeneous service curve server. We show that service curve servers can characterize a strictly larger class of schedulers than LR servers. That is, we can characterize not only all LR servers but also RC-EDF and SC scheduler by service curve servers. Even with such advantage over LR servers, service curve servers provide accurate analysis results. We prove mathematically that if we analyze a network that can be analyzed by both LR servers and service curve servers,,both cases yield the same delay bound.

Performance Analysis of Packet CDMA R-ALOHA for Multi-media Integration in Cellular Systems with Adaptive Access Permission Probability

  • Kyeong Hur;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12B
    • /
    • pp.2109-2119
    • /
    • 2000
  • In this paper, the Packet CDMA Reservation ALOHA protocol is proposed to support the multi-traffic services such as voice and videophone services with handoff calls, high-rate data and low-rate data services efficiently on the multi-rate transmission in uplink cellular systems. The frame structure, composed of the access slot and the transmission slot, and the proposed access permission probability based on the estimated number of contending users for each service are presented to reduce MAI. The assured priority to the voice and the videophone handoff calls is given through higher access permission probability. And through the proposed code assignment scheme, the voice service can be provided without the voice packet dropping probability in the CDMA/PRMA protocols. The code reservation is allowed to the voice and the videophone services. The low-rate data service uses the available codes during the silent periods of voice calls and the remaining codes in the codes assigned to the voice service to utilize codes efficiently. The high-rate data service uses the assigned codes to the high-rate data service and the remaining codes in the codes assigned to the videophone service. Using the Markov-chain subsystem model for each service including the handoff calls in uplink cellular systems, the steady-state performances are simulated and analyzed. After a round of tests for the examples, through the proposed code assignment scheme and the access permission probability, the Packet CDMA Reservation ALOHA protocol can guarantee the priority and the constant QoS for the handoff calls even at large number of contending users. Also, the data services are integrated efficiently on the multi-rate transmission.

  • PDF

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

The 3rd National Conference Of Professional engineers - Mobile Communication Trend Toward Packet Based Service (제3회 전국기술사대회 특집(정보통신) - 패킷 서비스로 진화하는 이동통신)

  • Ryu, Young-Kwon
    • Journal of the Korean Professional Engineers Association
    • /
    • v.42 no.4
    • /
    • pp.34-39
    • /
    • 2009
  • IMT-2000 service started around year of 2000 to support global roaming with high speed data rate. But 3GPP and 3GPP2 could not narrow gaps between them to make separate specification. To make it worse, economy regression delayed deployment. Starting 2007, WCDMA, standardized in 3GPP, was launched in Korea by KT and SKT. 3GPP introduced HSDPA and HSUPA as an enabler for high speed down and uplink packet service, in release5 and release5, respectively.

  • PDF

Performance Analysis of HomePNA 2.0 MAC Protocol (HomePNA 2.0 MAC 프로토콜의 성능 분석)

  • Kim, Jong-Won;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.877-885
    • /
    • 2005
  • The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we propose some mathematical models about the important elements of HomePNA 2.0 MAC protocol performance, which are Saturation Throughput, Packet Delay and Packet Jitter. Then, we present an overall performance analysis of HomePNA 2.0 MAC protocol along with simulations.

Joint Packet and Sub-carrier Allocation Scheme to Ensure Reliable Multimedia Service in OFDMA Multicast System (OFDMA 멀티캐스트 시스템에서 신뢰성 있는 멀티미디어 서비스를 보장하기 위한 패킷 및 서브 캐리어 할당 기법)

  • Gwak, Yong-Su;Kim, Yong-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.4
    • /
    • pp.8-12
    • /
    • 2009
  • We propose BMPA(balanced multimedia packet allocation) scheme. This scheme considers the issue of optimal sub-carrier allocation in OFDMA multicast system. When RT(real time) packets and NRT(non-real time) packets arrive at the same time, BMPA scheme gives higher weight to RT packets than NRT packets and then, it allocates sub-carriers according to the total weight sum of packets in each user. This process acts as both packet scheduler and sub-carrier allocation. Therefore, each user receives multimedia packets with reliability. With simulation results, it shows that BMPA scheme ensures long-term system throughput and, in average RT packet delay, BMPA scheme greatly outperforms multi-user water-filling algorithm.

Congestion Control Mechanism for Efficient Network Environment in WMSN (무선 멀티미디어 센서 네트워크에서 효율적인 네트워크 환경을 위한 혼잡 제어 메커니즘)

  • Park, Jeong-Hyeon;Lee, Sung-Keun;Oh, Won-Geun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.289-296
    • /
    • 2015
  • Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.

A modified RIO queue management scheme that reduces the bandwidth skew problem in Assured Service

  • Kim, hyogon;Park, Won-Hyoung;Saewoong Bahk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.423-426
    • /
    • 1999
  • In offering a statistical end-to-end bandwidth guarantee service, typically called Assured Service, in Differentiated Serviced (Diff-Serv) framework, the biggest issue is its inconsistency. Larger profile TCP flows fail to achieve the guaranteed rate when competing with many smaller profile flows. This phenomenon, which we call "bandwidth skew", stems from the fact that larger profile flows take longer time to recover from the congestion window size backoff after a packet drop. Proposed solutions to this problem, therefore, are focused on modifying the TCP behavior. However, TCP modification is not practicable, mainly due to its large installation base. We look to other mechanisms in the Diff-Serv framework to find more realistic solutions. In particular, we demonstrate that RIO, the de facto standard packet differentiation mechanism used for Assured Service, also contributes to the bandwidth skew. Based on this new finding, we design a modified RIO mechanism called RI+O. RI+O uses OUT queue length in addition to IN and IN+OUT queue length to calculate OUT packet drop probability. We show through extensive simulation that RI+O significantly alleviates the bandwidth skew, expanding the operating regime for Assured Service.d Service.

  • PDF