• Title/Summary/Keyword: multi-service and multi-user

Search Result 436, Processing Time 0.032 seconds

A Study for a Secure User Authentication System on Multi-Screen Services (멀티-스크린 환경에서 안전한 사용자 인증시스템에 관한 연구)

  • Kim, JinMook;Lee, JongSub
    • Convergence Security Journal
    • /
    • v.14 no.2
    • /
    • pp.11-16
    • /
    • 2014
  • Recently, request of IPTV was increase. It is a multi-screen service by used TV, PC, and smart-phones. Especially, IPTV and smart-phone linked multi-screen service are very growth by user's recommends. Now, IPTV have a security service partial and multi-screen service. But smart-phone and multi-screen service don't have security service. And authentication service for smart-phone and IPTV linked multi-screen service is don't.. Therefore, We propose that user authentication system for multi-screen service with IPTV and multi-device linked authentcation services. Our proposed system base on Kerberos, so proposal is easy and fast about user authentication. This have simple procedures and more secure services against of PKI. So, our system can support secure multi-screen services against various security threats in multi-screen environments.

Analysis of the performances of random access channels in multi-service multi-user OFDMA systems according to resource management schemes (다중 서비스 다중 사용자 OFDMA 시스템에서의 자원할당방식에 따른 임의접근 채널 성능 분석)

  • Koo, In-Soo;Lee, Young-Du
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.237-239
    • /
    • 2007
  • In the paper, we analyze the performances of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems is the nubmer of available sub-channels and PN-codes. For given available sub-channels and PN-codes. we analyze the performances of the random access channels of OFDMA systems according to three resource allocation methods (resource full sharing, resource partial sharing, resource partition) in tenus of the access success probability, the blocking probability, the access delay and the throughput of each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be utilized to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations.

  • PDF

Performance Analysis of random access channels in multi-service multi-user OFDMA systems (다중 서비스 다중 사용자 OFDMA 시스템에서의 임의접근 채널 성능 분석)

  • Koo, In-Soo;Pham, Thi Hong Chau
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.141-151
    • /
    • 2008
  • In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.

  • PDF

Design of network for data interaction between Robot Agents in Multi Agent Robot System (MARS) (Multi Agent Robot System(MARS)의 Robot Agent 간 정보교환을 위한 네트워크 프로그램 구현)

  • Ko, Kwang-Eun;Lee, Jeong-Soo;Jang, In-Hun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.5
    • /
    • pp.712-717
    • /
    • 2007
  • Using home network system including home server, home service robot, a variety of device, it is generally known that application of Multi Agent System for performing variously distributed process that can be occur in home environment, is efficient method. In this system, it is intelligent service robot that a key of human interface and physical service offer Therefore, using application of established multi agent system, we can defined Multi Agent Robot System. In 'open' home environment, between all agent data interaction and cooperation are needed for Multi Agent System offer to user that more efficient service. For this, we focus our attention on define as agent that can autonomic drive and offer to user that physical service robots and, design, suggest the simulator can display that between robot agents communication or between other agents, like home server, and robot agents communication information to user interface.

Protection Management for Guaranteed User-Driven Virtual Circuit Services in Dynamic Multi-domain Environments: Design Issues and Challenges

  • Lim, Huhnkuk
    • ETRI Journal
    • /
    • v.37 no.2
    • /
    • pp.369-379
    • /
    • 2015
  • Fault management of virtualized network environments using user-driven network provisioning systems (NPSs) is crucial for guaranteeing seamless virtual network services irrespective of physical infrastructure impairment. The network service interface (NSI) of the Open Grid Forum reflects the need for a common standard management API for the reservation and provisioning of user-driven virtual circuits (VCs) across global networks. NSI-based NPSs (that is, network service agents) can be used to compose user-driven VCs for mission-critical applications in a dynamic multi-domain. In this article, we first attempt to outline the design issues and challenges faced when attempting to provide mission-critical applications using dynamic VCs with a protection that is both user-driven and trustworthy in a dynamic multi-domain environment, to motivate work in this area of research. We also survey representative works that address inter-domain VC protection and qualitatively evaluate them and current NSI against the issues and challenges.

Mobility Process Orchestration for Multi-Device Environment (멀티 디바이스 환경을 위한 모빌리티 프로세스 오케스트레이션)

  • Kim, Svetlana;Chung, Man-Soo;Yoon, YongIk
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.3
    • /
    • pp.91-96
    • /
    • 2015
  • Recently, the 'mobility' is one of the essential item in the field of IT. This means that 'mobility' are good mediators to get collecting user's behavior and provide freedom of mobility service for user's. This paper is proposed a mobility process orchestration(MPO) model that provide multimedia to various devices. The orchestration model provides the structure and function that can be objectify a physical devices in a user's environment to provide orchestrated service of various devices to user using a concept of MSMP(Multi Source Multi Platform). Also, using the concept of Choreography can be extracted appropriate device of the various media formats for harmonious service.

An Extended Multi-Server-Based User Authentication and Key Agreement Scheme with User Anonymity

  • Li, Chun-Ta;Lee, Cheng-Chi;Weng, Chi-Yao;Fan, Chun-I
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.1
    • /
    • pp.119-131
    • /
    • 2013
  • With the explosive growth of computer networks, many remote service providing servers and multi-server network architecture are provided and it is extremely inconvenient for users to remember numerous different identities and passwords. Therefore, it is important to provide a mechanism for a remote user to use single identity and password to access multi-server network architecture without repetitive registration and various multi-server authentication schemes have been proposed in recent years. Recently, Tsaur et al. proposed an efficient and secure smart card based user authentication and key agreement scheme for multi-server environments. They claimed that their scheme satisfies all of the requirements needed for achieving secure password authentication in multi-server environments and gives the formal proof on the execution of the proposed authenticated key agreement scheme. However, we find that Tsaur et al.'s scheme is still vulnerable to impersonation attack and many logged-in users' attack. We propose an extended scheme that not only removes the aforementioned weaknesses on their scheme but also achieves user anonymity for hiding login user's real identity. Compared with other previous related schemes, our proposed scheme keeps the efficiency and security and is more suitable for the practical applications.

Multi-homing in Heterogeneous Wireless Access Networks: A Stackelberg Game for Pricing

  • Lee, Joohyung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.1973-1991
    • /
    • 2018
  • Multimedia applications over wireless networks have been evolving to augmented reality or virtual reality services. However, a rich data size compared to conventional multimedia services causes bandwidth bottlenecks over wireless networks, which is one of the main reasons why those applications are not used widely. To overcome this limitation, bandwidth aggregation techniques, which exploit a multi-path transmission, have been considered to maximize link utilization. Currently, most of the conventional researches have been focusing on the user end problems to improve the quality of service (QoS) through optimal load distribution. In this paper, we address the joint pricing and load distribution problem for multi-homing in heterogeneous wireless access networks (ANs), considering the interests of both the users and the service providers. Specifically, we consider profit from resource allocation and cost of power consumption expenditure for operation as an utility of each service provider. Here, users decide how much to request the resource and how to split the resource over heterogeneous wireless ANs to minimize their cost while supporting the required QoS. Then, service providers compete with each other by setting the price to maximize their utilities over user reactions. We study the behaviors of users and service providers by analyzing their hierarchical decision-making process as a multileader-, multifollower Stackelberg game. We show that both the user and service provider strategies are closed form solutions. Finally, we discuss how the proposed scheme is well converged to equilibrium points.

Multi-Parameter Based Scheduling for Multi-user MIMO Systems

  • Chanthirasekaran, K.;Bhagyaveni, M.A.;Parvathy, L. Rama
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2406-2412
    • /
    • 2015
  • Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

Many-objective joint optimization for dependency-aware task offloading and service caching in mobile edge computing

  • Xiangyu Shi;Zhixia Zhang;Zhihua Cui;Xingjuan Cai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1238-1259
    • /
    • 2024
  • Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.