• Title/Summary/Keyword: Network Server

Search Result 2,377, Processing Time 0.034 seconds

Agent for Home Server Management in Intelligent Smart Home Network

  • Moon, Seok-Jae;Shin, HyoYoung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.225-230
    • /
    • 2022
  • The intelligent home network system integrates various devices in the home into one communication network to provide information sharing, control, and operation environment between devices. This intelligent home network system operates around a home server. Home appliances in the era of the 4th industrial revolution will have numerous home servers in logical areas as the intelligent home network in the home accelerates. Therefore, the need for systematic management of home servers is emerging. We propose an agent system for efficient intelligent smart home server management. The agent system monitors the home server and operating environment for home server management of the intelligent smart home network. By referring to this monitored information, the service module of the home server is managed, and the home server is dealt with whether it is normal or not. In addition, by referring to the information collected by the service agent created in the group management server while migrating the home server, it is possible to deal with integrated meter reading, crime prevention, and topics. And when a new service is applied to the home server, it is registered in the management server and distributed to the home server through the agent, so that the intelligent smart home network can be efficiently managed.

Design of a Protected Server Network with Decoys for Network-based Moving Target Defense

  • Park, Tae-Keun;Park, Kyung-Min;Moon, Dae-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.9
    • /
    • pp.57-64
    • /
    • 2018
  • In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. In this paper, we design a protected server network with a large number of decoys to anonymize the protected servers that dynamically mutate their IP address and port numbers according to Hidden Tunnel Networking, which is a network-based moving target defense scheme. In the network, a protected server is one-to-one mapped to a decoy-bed that generates a number of decoys, and the decoys share the same IP address pool with the protected server. First, the protected server network supports mutating the IP address and port numbers of the protected server very frequently regardless of the number of decoys. Second, it provides independence of the decoy-bed configuration. Third, it allows the protected servers to freely change their IP address pool. Lastly, it can reduce the possibility that an attacker will reuse the discovered attributes of a protected server in previous scanning. We believe that applying Hidden Tunnel Networking to protected servers in the proposed network can significantly reduce the probability of the protected servers being identified and compromised by attackers through deploying a large number of decoys.

An Expanded Patching Technique using Four Types of Streams for True VoD Services

  • Ha, Sook-Jeong;Bae, Ihn-Han;Kim, Jin-Gyu;Park, Young-Ho;Oh, Sun-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.444-460
    • /
    • 2009
  • In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

Home Server Development for Home Networking (Home 종합 정보화를 위한 Home Server 개발)

  • 김동택;이원종;박정남;이종혁
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.755-759
    • /
    • 2004
  • 인터넷의 확산으로 인해 가정의 정보화 필요성이 급증함에 따라 Home Network를 위한 Home Server의 개발이 요구되고 있다. 이에 본 논문에서는 가정에서 손쉽게 Home Network를 구축할 수 있는 Home Server를 개발함으로써 가정 정보화에 기여하고자 한다.

  • PDF

Research of Intelligent Home Robot based on Home Network

  • Choi, Dong-Suk;Park, Jin-Hyun;Kim, Hun-Mo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1575-1579
    • /
    • 2003
  • This paper present the control of an intelligent home robot based on home network. The existing research is almost research of independent robot. home network will be a way that equipments in home exchange information. As robot combine home network, robot will be more intelligent and more powerful. We benefit for that load is divided in home network environment. The robot which has ultrasonic sensors performs obstacle avoidance with the Fuzzy Algorithm. Ethernet serial converter transmit the measuring data of home to a home server and the home server accumulates data. The home server controls the robot and manages home according to the acquired data. This paper supposed the home network system that consist of home server, embedded robot and intelligent home robot.

  • PDF

Network-based Feature Modeling in Distributed Design Environment (네트워크 기반 특징형상 모델링)

  • Lee, J.Y.;Kim, H.;Han, S.B.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.1
    • /
    • pp.12-22
    • /
    • 2000
  • Network and Internet technology opens up another domain for building future CAD/CAM environment. The environment will be global, network-centric, and spatially distributed. In this paper, we present an approach for network-centric feature-based modeling in a distributed design environment. The presented approach combines the current feature-based modeling technique with distributed computing and communication technology for supporting product modeling and collaborative design activities over the network. The approach is implemented in a client/server architecture, in which Web-enabled feature modeling clients, neutral feature model server, and other applications communicate with one another via a standard communication protocol. The paper discusses how the neutral feature model supports multiple views and maintains naming consistency between geometric entities of the server and clients. Moreover, it explains how to minimize the network delay between the server and client according to incremental feature modeling operations.

  • PDF

WWW Cache Replacement Algorithm Based on the Network-distance

  • Kamizato, Masaru;Nagata, Tomokazu;Taniguchi, Yuji;Tamaki, Shiro
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.238-241
    • /
    • 2002
  • With the popularity of utilization of the Internet among people, the amount of data in the network rapidly increased. So that, the fall of response time from WWW server, which is caused by the network traffic and the burden on m server, has become more of an issue. This problem is encouraged the rearch by redundancy of requesting the same pages by many people, even though they browse the same the ones. To reduce these redundancy, WWW cache server is used commonly in order to store m page data and reuse them. However, the technical uses of WWW cache that different from CPU and Disk cache, is known for its difficulty of improving the cache hit rate. Consecuently, it is difficult to choose effective WWW data to be stored from all data flowing through the WWW cache server. On the other hand, there are room for improvement in commonly used cache replacement algorithms by WWW cache server. In our study, we try to realize a WWW cache server that stresses on the improvement of the stresses of response time. To this end, we propose the new cache replacement algorithm by focusing on the utilizable information of network distance from the WWW cache server to WWW server that possessing the page data of the user requesting.

  • PDF

A study on congesting control scheme for LAN interworkding in connectionless data service (비연결형 데이터 서비스에서 LAN연동을 위한 폭주 제어에 관한 연구)

  • 박천관;전병천;김영선
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.29-38
    • /
    • 1998
  • This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

  • PDF

Interworking between PPP CHAP and RADIUS Authentication Server on GPRS Network (GPRS 망에서 PPP CHAP과 RADIUS 인증 서버 연계 방안)

  • 박정현;이상호
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.5
    • /
    • pp.567-577
    • /
    • 2003
  • We usually applied PPP CHAP (Point-to-Point Protocol Challenge Handshake Authentication Protocol) when the visited ISP subscriber accesses to authentication server in own home ISP network and IP Assignment for remote Internet service. But PPP CHAP doesn't support in case of visited ISP subscriber in GPRS network accesses to authentication server in own home ISP network for wireless Internet service. We suggest solution this problem with PPP CHAP improvement. For this we propose the modified PPP CHAP message format, PCO Message format at MT, and interworking message and format between GGSN and RADIUS in home ISP network for wireless internet service of mobile ISP subscriber at GPRS network in this paper. We also show authentication results when visited mobile ISP subscriber via PPP CHAP at GPRS network accesses the RADIUS server in home ISP network.

The Server Disconnection Problem on a Ring Network (링 네트워크에서의 서버 단절문제에 대한 해법)

  • Myung, Young-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.87-91
    • /
    • 2009
  • In the server disconnection problem, a network with m servers and their users is given and an attacker is to destroy a set of edges to maximize his net gain defined as the total disconnected utilities of the users minus the total edge-destruction cost. The problem is known to be NP-hard. In this paper, we study the server disconnection problem restricted to a ring network. We present an efficient combinatorial algorithm that generates an optimal solution in polynomial time.