• Title/Summary/Keyword: Persistent Request

Search Result 14, Processing Time 0.02 seconds

New Transient Request with Loose Ordering for Token Coherence Protocol (토큰 코히런스 프로토콜을 위한 경서열 트렌지언트 요청 처리 방법)

  • Park, Yun Kyung;Kim, Dae Young
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.10
    • /
    • pp.615-619
    • /
    • 2005
  • Token coherence protocol has many good reasons against snooping/directory-based protocol in terms of latency, bandwidth, and complexity. Token counting easily maintains correctness of the protocol without global ordering of request which is basis of other dominant cache coherence protocols. But this lack of global ordering causes starvation which is not happening in snooping/directory-based protocols. Token coherence protocol solves this problem by providing an emergency mechanism called persistent request. It enforces other processors in the competition (or accessing same shared memory block, to give up their tokens to feed a starving processor. However, as the number of processors grows in a system, the frequency of starvation occurrence increases. In other words, the situation where persistent request occurs becomes too frequent to be emergent. As the frequency of persistent requests increases, not only the cost of each persistent matters since it is based on broadcasting to all processors, but also the increased traffic of persistent requests will saturate the bandwidth of multiprocessor interconnection network. This paper proposes a new request mechanism that defines order of requests to reduce occurrence of persistent requests. This ordering mechanism has been designed to be decentralized since centralized mechanism in both snooping-based protocol and directory-based protocol is one of primary reasons why token coherence protocol has advantage in terms of latency and bandwidth against these two dominant Protocols.

Performance Analysis of VoIP Services in Mobile WiMAX Systems with a Hybrid ARQ Scheme

  • So, Jaewoo
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.510-517
    • /
    • 2012
  • This paper analyzes the performance of voice-over-Internet protocol (VoIP) services in terms of the system throughput, the packet delay, and the signaling overhead in a mobile WiMAX system with a hybrid automatic repeat request (HARQ) mechanism. Furthermore, a queueing analytical model is developed with due consideration of adaptive modulation and coding, the signaling overhead, and the retransmissions of erroneous packets. The arrival process is modeled as the sum of the arrival rate at the initial transmission queue and the retransmission queue, respectively. The service rate is calculated by taking the HARQ retransmissions into consideration. This paper also evaluates the performance of VoIP services in a mobile WiMAX system with and without persistent allocation; persistent allocation is a technique used to reduce the signaling overhead for connections with a periodic traffic pattern and a relatively fixed payload. As shown in the simulation results, the HARQ mechanism increases the system throughput as well as the signaling overhead and the packet delay.

Load Distribution Policy of Web Server using Subsequent Load and HTTP Connection Time (잠재 부하 정보와 HTTP 연결의 에이징을 통한 HTTP 연결 스케줄링 알고리즘)

  • Kim Si-Yeon;Kim Sungchun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.717-721
    • /
    • 2005
  • With HTTP/1.0, a single request means a single HTTP connection so that the granular unit of dispatching is the same as real load. But with persistent HTTP connection, multiple requests may arrive on a single TCP connection. Therefore, a scheme that dispatches load at the granularity of individual requests constrains the feasible dispatching policies In this paper we propose a new connection dispatching polity for supporting HTTP/1.1 persistent connections in cluster-based Web servers. When the request of a base html file arrives, the dispatcher gets the subsequent load arriving on that connection using the embedded objects information. After the dispatcher stores the load information in Load Table, the dispatcher employs the connection aging strategy on live persistent connections on the passage of time. The results of simulation show about $1.7\%\~16.8\%$ improved average response time compared to existing WLC algorithm.

Popularity-Based Adaptive Content Delivery Scheme with In-Network Caching

  • Kim, Jeong Yun;Lee, Gyu Myoung;Choi, Jun Kyun
    • ETRI Journal
    • /
    • v.36 no.5
    • /
    • pp.819-828
    • /
    • 2014
  • To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.

Differentiated-HTTP for Differentiated Web Service (웹 상에서의 차별화 된 서비스 제공을 위한 Diff-HTTP)

  • Hyeon, Eun-Sil;Lee, Yun-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.1
    • /
    • pp.126-135
    • /
    • 2001
  • HTTP 프로토콜은 WWW에서 HTML(HyperText Markup Language)문서를 송수신하기 위해 사용하고 있는 애플리케이션 프로토콜로서 TCP를 수송계층 프로토콜로 이용하여 이루어지는 애플리케이션 계층 프로토콜 가운데 하나이다[12]. HTTP/1.0은 동일한 서버로부터 각각의 개체에 대하여 개별적인 TCP연결은 생성하기 때문에 다중의 요구를 비효율적으로 처리한다. 이러한 문제를 해결하기 위한 방안으로 제안된 HTTP/1.1은 TCP연결을 지속적인 연결(Persistent connection)이라는 개념을 도입하여 하나의 TCP 연결 상에서 다중의 요구(Request)를 처리하도록 하고 있다[9]. 네트워크가 발전됨에 따라 사용자가 늘어나고 다양해지면서 서비스의 차별화 문제가 중요한 문제로 대두되었다.[3.5] 본논문에서 제시하는 Diff-HTTP은 웹 서버에 서비스를 요청한 클라이언트들에게 차별화 된 서비스를 제공하기 위해서 사용자를 두 등급 기본등급과 우선 순위를 고려한 상위 등급으로 구분한다. 각 등급은 제한시간으로 차별화되고 상위 등급에 속한 클라이언트에게 제한된 시간을 증가 시켜 지연을 최소로 함으로써 고품질의 서비스를 제공하는 방안을 제시한다.

  • PDF

Design of Implementation Repository Interface for Effective Management of Distributed Object (효율적인 분산 객체 관리를 위한 구현저장소 인터페이스 설계)

  • Koo, Hyun-Ju;Lee, Yoon;Park, Se-Myung
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 1998.10a
    • /
    • pp.214-218
    • /
    • 1998
  • 분산 객체 컴퓨팅 환경이 대두되고 있는 오늘날, 네트워크 상에 분산되어 있는 객체들을 효율적으로 관리할 수 있는 기능이 필요하게 되었다. OMG(Objective Request Broker Architecture)에서는 개체를 바인딩하기 위한 두 가지 형태의 객체 참조, 즉 일시적 객체참조(Transient Object Reference)와 영구적 객체참조(Persistent Object Reference)가 있으며 영구적 객체 참조를 바인딩하기 위해서 ORB는 구현저장소를 제공해야 한다. 이를 위해 CORBA 스펙에서는 구현저장소의 개념만을 정의되어 있을 뿐 인터페이스는 아직 정의되어 있지 않은 상태이다. 본 논문에서는 구현저장소의 도움만을 받아 구현객체를 바인딩 할 수 있도록 하기 위한 구현저장소의 인터페이스를 설계하였다.

  • PDF

Diff-HTTP for QoS under web (웹 상에서의 QoS 제공을 위한 Diff-HTTP)

  • 현은실;이윤정;이윤정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.361-363
    • /
    • 2001
  • HTTP/1.0은 동일한 서버로부터 각각의 개체에 대하여 개별적인 TCP 연결을 생성하기 때문에 다중의 요구를 비효율적으로 처리한다. 이러한 문제를 해결하기 위한 방안으로 제안된 HTTP/1.0은 TCP 연결을 지속적인 연결(Persistent connection)이라는 개념을 도입하여 하나의 TCP 연결 상에서 다중의 요구(Request)를 처리하도록 하고 있다.[9]. 네트워크가 발전됨에 따라 사용자가 늘어나고 다양해지면서 서비스의 차별화 문제가 중요한 문제로 대두되었다.[3.5]. 본 논문에서 제시하는 Diff(Differentiated)-HTTP은 웹 서버에 서비스를 요청한 클라이언트들에게 차별화 된 서비스를 제공하기 위해서 사용자들 두 등급, 기본 등급과 우선 순위를 고려한 상위 등급으로 구분한다. 각 등급은 제한시간(Holding Time)으로 차별화 되고 상위 등급에 속한 클라이언트에게 제한된 시간을 증가시켜 지연을 최소로 함으로써 고품질의 서비스를 제공하는 방안을 제안한다.

Diff-HTTP for QoS (QoS 제공을 위한 Diff-HTTP)

  • Hyun, Eun-Sil;Rhee, Yoon-Jung;Kim, Tai-Yun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04a
    • /
    • pp.515-518
    • /
    • 2001
  • HTTP/1.0은 동일한 서버로부터 각각의 개체에 대하여 개별적인 TCP 연결을 생성하기 때문에 다중의 요구를 비효율적으로 처리한다. 이러한 문제를 해결하기 위한 방안으로 제안된 HTTP/1.1 은 TCP연결을 지속적인 연결(Persistent connection)이라는 개념을 도입하여 하나의 TCP 연결 상에서 다중의 요구(Request)를 처리하도록 하고 있다[9]. 네트워크가 발전됨에 따라 사용자가 늘어나고 다양해지면서 서비스의 차별화 문제가 중요한 문제로 대두되었다[3,5]. 본 논문에서 제시하는 Diff(Differentiated)-HTTP은 웹 서버에 서비스를 요청한 클라이언트들에게 차별화 된 서비스를 제공하기 위해서 사용자를 두 등급, 기본 등급과 우선 순위를 고려한 상위 등급으로 구분한다. 각 등급은 제한 시간(Holding Time)으로 차별화 되고 상위 등급에 속한 클라이언트에게 제한된 시간을 증가시켜 지연을 최소로 함으로써 고품질의 서비스를 제공하는 방안을 제안한다.

  • PDF

Modeling and Performance Evaluation of the Web server supporting Persistent Connection (Persistent Connection을 지원하는 웹서버 모델링 및 성능분석)

  • Min, Byeong-Seok;Nam, Ui-Seok;Lee, Sang-Mun;Sim, Yeong-Seok;Kim, Hak-Bae
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.605-614
    • /
    • 2002
  • Amount of the web traffic web server handles are explosively increasing, which requires that the performance of the web server should be improved for the various web services. Although the analysis for the HTTP traffic with the proper tuning for the web server is essential, the research relevant to the subject are insignificant. In particular, although most of applications are implemented over HTTP 1.1 protocol, the researches mostly deal with the performance evaluation of the HTTP 1.0 protocol. Consequently, the modeling approach and the performance evaluation over HTTP 1.1 protocol have not been well formed. Therefore, basing on the HTTP 1.1 protocol supporting persistent connection, we present an analytical end-to-end tandem queueing model for web server to consider the specific hardware configuration inside web server beginning at accepting the user request until completing the service. we compare various performances between HTTP 1.0 and HTTP 1.1 under the overloading condition, and then analyze the characteristics of the HTTP traffic that include file size requested to web server, the OFF time between file transfers, the frequency of requests, and the temporal locality of requests. Presented model is verified through the comparing the server throughput according to varying requests rate with the real web server. Thereafter, we analyze the performance evaluation of the web server, according to the interrelation between TCP Listen queue size, the number of HTTP threads and the size of the network buffers.

Treatment of Gastroesophageal Reflux Disease in 2 Young Dogs

  • Han, Jihee;Kim, Yeonsoo;Seo, Kyoungwon;Song, Kunho
    • Journal of Veterinary Clinics
    • /
    • v.38 no.5
    • /
    • pp.231-234
    • /
    • 2021
  • A 14-month-old, intact female Maltese (case 1) and a 26-month-old, spayed female Dachshund (case 2) had persistent regurgitation over 1 year and 2 years, respectively. In both cases, there were not specific findings in blood examination. Diagnostic imaging and fluoroscopy revealed that gastroesophageal reflux (GER) occurred when the patients ate a barium meal without abdominal contraction. They were treated with proton-pump inhibitor (esomeprazole), sucralfate and prokinetics (cisapride) while in a standing position for an hour after every meal, according to the gastroesophageal disease (GERD) suggested treatment. The case 1 dog was discharged with improved clinical signs, and the case 2 dog also had been improved clinical signs; however, aspiration pneumonia occurred in case 2, which was thought to be a complication from GERD. After receiving treatment for aspiration pneumonia, the case 2 dog was discharged from the hospital. Since there was no further improvement in symptoms after discharge, the case 1 dog was euthanized by owner's request, and the case 2 is alive, having only mild clinical signs upon the writing of this paper.