• Title/Summary/Keyword: Service Request

Search Result 767, Processing Time 0.021 seconds

Spreading Codes Based Multicast Feedback Scheme for Reliable Multicast Services (신뢰성 있는 멀티캐스트 서비스를 위한 스프레딩 코드 기반 피드백 기법)

  • Lee, Howon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.787-793
    • /
    • 2015
  • In order to support reliable medium access control (MAC) layer multicast services in Broadband Wireless Access (BWA) networks, we here propose spreading codes (Cumulative ACK (CA) code and ARQ Feedback Request (AFR) code) based reliable multicast feedback scheme. The status indications based on the automatic repeat request (ARQ) mechanism are needed in some multicast services. In accordance with various wireless channel environments, we demonstrate the performance excellency of our proposed scheme with respect to required uplink resources compared with the original feedback scheme based on unicast ARQ feedback messages. In addition, we analyze packet error rate (PER) against the various wireless channel environments.

A study on the Phase Noise Performance of CATV Transmission System (CATV 전송시스템 위상잡음성능에 관한 연구)

  • Lee, Yong-Woo;Oh, Seung-Hyeub
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.4
    • /
    • pp.199-204
    • /
    • 2010
  • Recently, the transmission amount of information that each single person requires is growing by development of electron information communication technology. So in this paper we analysis the phase noise characteristics to obtain a most suitable of SNR performance request characteristic by BER on CATV transmission system that satisfy performance request DOCSIS 2.0 standard. Especially we get the parameter value of PLL that satisfy phase noise characteristic request standard using developed simulator. Presented method can be used to obtain a performance request standard connection performance request standard of high speed CATV transmission system in the future.

A study on the phase noise performance improvement of CATV transmission system using the simulator (시뮬레이터를 이용한 CATV 전송시스템 위상잡음성능 개선에 관한 연구)

  • Lee, Yong-Woo;Oh, Seung-Hyeub;Chang, Sang-Hyun;Lee, Il-Kyoo
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.1-5
    • /
    • 2010
  • Recently, the transmission amount of information that each single person requires is growing by development of electron information communication technology. So in this paper we analysis the phase noise characteristics to obtain a most suitable of SNR performance request characteristic by BER on CATV transmission system that satisfy performance request DOCSIS 2.0 standard. Especially we get the parameter value of PLL that satisfy phase noise characteristic request standard using developed simulator. Presented method can be used to obtain a performance request standard connection performance request standard of high speed CATV transmission system in the future.

An Efficient PFMIPv6 and WLAN Interworking Scheme for Fast Handover (고속 핸드오버를 위한 PFMIPv6와 무선랜의 효율적인 연동 방안)

  • Park, Min-Ji;Min, Sang-Won;Kim, Bok-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.174-180
    • /
    • 2012
  • As the number of a smart phone user over the world surprisingly grows and a wireless Internet market expands, service requirement of a mobile terminal is increasing. However, because there is no consideration of mobility in the early standard step, it is difficult to expect to improve the service performance in handover procedure. This paper proposes a PFMIPv6 handover scheme by using probe request message and authentication message and by using buffering scheme in IEEE 802.11. In addition, we simulated this proposal scheme and verified that the proposed handover scheme is improved in terms of handover delay, and average FTP throughput during the handover period.

Ensuring Anonymity for LBSs in Smartphone Environment

  • Alzaabi, Mohammed;Yeun, Chan-Yeob;Martin, Thomas Anthony
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.121-136
    • /
    • 2011
  • With the rapid growth of GPS-enable Smartphones, the interest on using Location Based Services (LBSs) has increased significantly. The evolution in the functionalities provided by those smartphones has enabled them to accurately pinpoint the location of a user. Because location information is what all LBSs depend on to process user's request, it should be properly protected from attackers or malicious service providers (SP). Additionally, maintaining user's privacy and confidentiality are imperative challenges to be overcome. A possible solution for these challenges is to provide user anonymity, which means to ensure that a user initiating a request to the SP should be indistinguishable from a group of people by any adversary who had access to the request. Most of the proposals that maintain user's anonymity are based on location obfuscation. It mainly focuses on adjusting the resolution of the user's location information. In this paper, we present a new protocol that is focused on using cryptographic techniques to provide anonymity for LBSs users in the smartphone environment. This protocol makes use of a trusted third party called the Anonymity Server (AS) that ensures anonymous communication between the user and the service provider.

A Scheduling of the Multimedia Contents Processing in LMS for E-Learning System (E-Learning 시스템을 위한 LMS의 멀티미디어 콘텐츠 처리 스케줄링)

  • Jeong, Hwa-Young;Kim, Eun-Won;Hong, Bong-Hwa
    • 전자공학회논문지 IE
    • /
    • v.45 no.1
    • /
    • pp.50-57
    • /
    • 2008
  • It is applying the various teaming contents to improve learner's studying desire and effect in E-Learning system. In this learning contents, there are text animation, sound and picture etc. But, multimedia teaming contents which has big file size need much transmission service times. In this paper, I proposed a scheduling technique of LMS to be faster and service efficiently the multimedia learning contents which was managed and processed it in LMS. for this purpose, I used message and scheduler at LMS. While loaming was processed, it saved the result information of learning contents request to LMS. In this case, if the learner request loaming contents request, it could be possible to support the learning contents efficiently to use learning contents information in LMS without connecting to LCMS. As application result of this techniques, at the first learning course, existent techniques displayed faster learning contents service than proposal techniques. But the more learning process, proposal technique is faster service than existent.

Design of a Data Grid Model between TOS and HL7 FHIR Service for the Retrieval of Personalized Health Resources (개인화된 건강 자원 조회를 위한 TOS 와 HL7 FHIR 서비스간의 데이터그리드 모델 설계)

  • Jeon, Young-Jun;Im, Seok-Jin;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.4
    • /
    • pp.139-145
    • /
    • 2016
  • On the ICT healing platform designed to issue early disease alerts, TOS connected between the provider of personal health-related data and the service provider and relayed personalized health data. In the previous study, TOS proposed how to monitor the retrieval and management of document/measurement resources by taking mobile devices into account. Recently the healthcare field, however, defined the standard items needed for communication and data exchanges with a mobile device through HL7 FHIR. This study designed a data grid model between TOS and FHIR to provide personal health resources relayed through TOS in FHIR bundle search sets. The proposed design was organized as follows: first, it stated similarities between the method of TOS resource request and that of FHIR observation request. Then, it designed an eventbus module to process a retrieval request for FHIR service based on the imdb and cluster technologies. The proposed design can be used to expand the old service terminals of ICT healing platform to mobile health devices capable of using FHIR resources.

A History Check System of Public Electronic Certificate using OCSP Service (OCSP 서비스를 이용한 공인인증서 사용이력 확인 시스템)

  • Kim, Nam-Gon;Cho, Beom-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.543-548
    • /
    • 2016
  • Public electronic certificates, as an important means for identification, have been used as the main economic transactions, including banking, e-government, e-commerce. identification. However, damage cases of certificates have been increased by Illegally issued and by hacking practices. Also the users have a difficult in ensuring that their certificates when and where to use. Therefore, the proposed system gives the organization code for the Institutions using OCSP services in advance, the organization code embedded in extensions of OCSP request message structure when institutions ask the validation of certificate to CA(Certificate Authority). Also, OCSP server can extract the organization code from OCSP request message, confirm the institution, and record it in certificate history management table of DB. In this paper, we presented a system that could determine the certificate history check using OCSP service, public electronic certificate validation service, and implemented to prevent and cope immediately with financial incidents.

QoS and SLA Aware Web Service Composition in Cloud Environment

  • Wang, Dandan;Ding, Hao;Yang, Yang;Mi, Zhenqiang;Liu, Li;Xiong, Zenggang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5231-5248
    • /
    • 2016
  • As a service-oriented paradigm, web service composition has obtained great attention from both academia and industry, especially in the area of cloud service. Nowadays more and more web services providing the same function but different in QoS are available in cloud, so an important mission of service composition strategy is to select the optimal composition solution according to QoS. Furthermore, the selected composition solution should satisfy the service level agreement (SLA) which defines users' request for the performance of composite service, such as price and response time. A composite service is feasible only if its QoS satisfies user's request. In order to obtain composite service with the optimal QoS and avoid SLA violations simultaneously, in this paper we first propose a QoS evaluation method which takes the SLA satisfaction into account. Then we design a service selection algorithm based on our QoS evaluation method. At last, we put forward a parallel running strategy for the proposed selection algorithm. The simulation results show that our approach outperforms existing approaches in terms of solutions' optimality and feasibility. Through our running strategy, the computation time can be reduced to a large extent.

A Dynamic Placement Mechanism of Service Function Chaining Based on Software-defined Networking

  • Liu, Yicen;Lu, Yu;Chen, Xingkai;Li, Xi;Qiao, Wenxin;Chen, Liyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4640-4661
    • /
    • 2018
  • To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.