• Title/Summary/Keyword: Network Overload

Search Result 238, Processing Time 0.021 seconds

A study on the Stress of Using Social Networking Services and Its Discontinuance Intention (소셜네트워크서비스(Social Network Service) 사용의 스트레스와 사용중단의도에 관한 연구)

  • Park, Kyung-Ja;Park, Seung-Bong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.275-285
    • /
    • 2014
  • The development of ICT has promoted the infusion of 'social,' which is not only 'personal,' but also strengthens social connection and communication; and SNS lies in the center of the infusion. Although SNS has been positioning itself as a significant domain in our lives based on the developed technologies, such as openness, extendibility and real-time, it has caused social concerns due to unexpected side effects. Therefore, this study aims to identify the stressors causing SNS stress and the factors influencing discontinuance of SNS. As a result, 5 factors including 'techno-overload,' 'techno-invasion,' 'techno-insecurity,' 'techno-complexity' and 'pace of change' were found to be SNS stressors. It is thought that this study would provide an academic implication for the future studies of stress and discontinuance related to SNS and a guideline for establishing practical strategies.

A Study on Effective Peer Search Algorithm Considering Peer's Attribute using JXTA in Peer-to-Peer Network (JXTA를 이용한 Peer-to-Peer 환경에서 Peer의 성향을 고려한 Peer 탐색 알고리즘의 연구)

  • Lee, Jong-Seo;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.632-639
    • /
    • 2011
  • Searching distributed resource efficiently is very important in distributed computing, cloud computing environment. Distributed resource searching may have system overheads and take much time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. The open-source community project JXTA defines an open set of standard protocols for ad hoc, pervasive, peer-to-peer computing as a common platform for developing a wide variety of decentralized network applications. In this paper, we proposed peer search algorithm based on JXTA-Sim. original JXTA peer searching algorithm selected a loosely-consistent DHT. Our Lookup algorithm decreases message number of WALK_LOOKUP and reduce the network system overload, and we make a result of same performance both original algorithm and our proposed algorithm.

A Context-based Adaptive Multimedia Streaming Scheme in IoT Environments (IoT 환경에서 컨텍스트 기반 적응적 멀티미디어 스트리밍 기법)

  • Seong, Chaemin;Hong, Seongjun;Lim, Kyungshik
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.7
    • /
    • pp.1166-1178
    • /
    • 2016
  • In Internet of Things (IoT) environments, billions of interconnected devices and multimedia sensors generate a huge amount of multimedia traffic. Since the environment are in general deployed as a server-centric architecture wireless sensor networks could be bottlenecks between IoT gateways and IoT devices. The bottleneck causes high power consumption of the device and triggers very heavy network overload by transmission of sensing data. The deterioration could decrease the quality of multimedia streaming service due to delay, loss, and waste of device power. Thus, in this paper, we propose a context-based adaptive multimedia streaming scheme to support enhanced QoS and low power consumption in IoT environments. The goal of the scheme is to increase quality score per voltage of the streaming service, given an adaptation algorithm with context that are classified network and hardware such as throughput, RTT, and CPU usage. From the both context, the quality score per voltage is used in the comparison of a only network context-based adaptive multimedia streaming scheme, a fixed multimedia streaming and our scheme. As a result, we achieves a high improvement that means the quality score per voltage is increased up to about 4, especially in case of resolution change.

Collaborative Filtering for Recommendation based on Neural Network (추천을 위한 신경망 기반 협력적 여과)

  • 김은주;류정우;김명원
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.457-466
    • /
    • 2004
  • Recommendation is to offer information which fits user's interests and tastes to provide better services and to reduce information overload. It recently draws attention upon Internet users and information providers. The collaborative filtering is one of the widely used methods for recommendation. It recommends an item to a user based on the reference users' preferences for the target item or the target user's preferences for the reference items. In this paper, we propose a neural network based collaborative filtering method. Our method builds a model by learning correlation between users or items using a multi-layer perceptron. We also investigate integration of diverse information to solve the sparsity problem and selecting the reference users or items based on similarity to improve performance. We finally demonstrate that our method outperforms the existing methods through experiments using the EachMovie data.

Design and Implementation of Event-driven Real-time Web Crawler to Maintain Reliability (신뢰성 유지를 위한 이벤트 기반 실시간 웹크롤러의 설계 및 구현)

  • Ahn, Yong-Hak
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.4
    • /
    • pp.1-6
    • /
    • 2022
  • Real-time systems using web cralwing data must provide users with data from the same database as remote data. To do this, the web crawler repeatedly sends HTTP(HtypeText Transfer Protocol) requests to the remote server to see if the remote data has changed. This process causes network load on the crawling server and remote server, causing problems such as excessive traffic generation. To solve this problem, in this paper, based on user events, we propose a real-time web crawling technique that can reduce the overload of the network while securing the reliability of maintaining the sameness between the data of the crawling server and data from multiple remote locations. The proposed method performs a crawling process based on an event that requests unit data and list data. The results show that the proposed method can reduce the overhead of network traffic in existing web crawlers and secure data reliability. In the future, research on the convergence of event-based crawling and time-based crawling is required.

Design of Thin-Client Framework for Application Sharing & Optimization of Data Access (애플리케이션 공유 및 데이터 접근 최적화를 위한 씬-클라이언트 프레임워크 설계)

  • Song, Min-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.5
    • /
    • pp.19-32
    • /
    • 2009
  • In this paper, we design thin-client framework capable of application sharing & data access on the Internet, and apply related skills, such as X windows system, pseudo server, CODA file system, MPI(Message Passing Interface). We suggest a framework for the thin client to access data produced by working on a server optimally as well as to run server side application, even in the case of network down. Additionally, it needed to reflect all local computing changes to remote server when network is restored. To design thin client framework with these characteristics, in this paper, we apply distributed pseudo server and CODA file system to our framework, also utilize MPI for the purpose of more efficient computing & management. It allows for implementation of network independent computing environment of thin client, also provide scalable application service to numerous user through the elimination of bottleneck on caused by server overload. In this paper, we discuss the implementing method of thin client framework in detail.

Hybrid Centralized-Distributed Mobility Management Scheme in SDN-Based LTE/EPC Networks (SDN 기반 LTE/EPC 네트워크에서 하이브리드 중앙-분산 이동성 관리 기법)

  • Lim, Hyun-Kyo;Kim, Yong-hwan;Han, Youn-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.768-779
    • /
    • 2017
  • Recently, the great number of mobile devices causes excessive data/control traffic problems in the centralized LTE/EPC network and such dramatically increased traffic is emerging as a critical issue. In the Centralized Mobility Management (CMM) based LTE/EPC network, the Packet Data Network Gateway (P-GW) plays the centralized mobility anchor role and it accommodates most of data traffic. To solve this problem, the IETF has proposed the Distributed Mobility Management (DMM) scheme, but it has only focused on the data traffic load balancing and could not solve the control traffic overload problem. In this paper, therefore, we propose a new SDN based hybrid CMM/DMM Mobility Management (C-DMM) architecture based on Packet Network Edge Gateway (P-EGW), and introduce a selection scheme between CMM and DMM according to a device's mobility and the number of PDN connections. In order to prove the efficiency of the proposed architecture and scheme, we compare the data traffic processing load and the control traffic processing load over each scheme by emulating them in the ONOS controller and the Mininet environment.

A Study on Improving HTTP latency for the Latency Web Document Processing (효율적인 웹문서 처리를 위한 HTTP 지연 개선에 관한 연구)

  • 고일석;최우진;나윤지;류승렬
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.2
    • /
    • pp.47-52
    • /
    • 2002
  • Recently, network overload is greatly increased with explosive use of internet. So the Hyper-Text Transfer Protocol(HTTP) is required improve of performance for decreasing of latency on the web document processing. The P-HTTP is one of the improved mood of He HTTP and has pipeline structure, but performance of the P-HTTP is decreased on interaction between the TCP and P-HTTP. Modification of structural design of the HTTP is not enough to improvement this problem. In this paper, we analyse performance of the HTTP and P-HTTP, and propose a new method on improving HTTP latency for the efficient web document processing.

  • PDF

Features Reduction using Logistic Regression for Spam Filtering (로지스틱 회귀 분석을 이용한 스펨 필터링의 특징 축소)

  • Jung, Yong-Gyu;Lee, Bum-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.13-18
    • /
    • 2010
  • Today, The much amount of spam that occupies the mail server and network storage occurs the lack of negative issues, such as overload, and for users to delete the spam should spend time, resources have a problem. Automatic spam filtering on the incidence to solve the problem is essential. A lot of Spam filters have tried to solve the problem emerged as an essential element automatically. Unlike traditional method such as Naive Bayesian, PCA through the many-dimensional data set of spam with a few spindle-dimensional process that narrowed the operation to reduce the burden on certain groups for classification Logistic regression analysis method was used to filter the spam. Through the speed and performance, it was able to get the positive results.

Resource Manager of QoS Supporting of Q-MOTP for Multimedia Object Data Transfer in MPLS Network Using Q-CBQ (Q-CBQ기반 MPLS망에서 Q-MOTP의 멀티미디어 객체 데이터 전송 QoS 지원을 위한 자원 관리자)

  • Choi, Won-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.12
    • /
    • pp.962-966
    • /
    • 2013
  • The internet will should require the QoS(quality of service) guarantees that the real-time traffic like as audio and video data will be operated well in the future. We had designed Q-MOTP which transfer multimedia object data and proved excellent performance. This paper describes an adaptive QoS management architecture and mechanism based on the information of system resources. Resource manager reports the system resource information periodically or when resources are in the overload state, or on demand by the QoS manager. By using this information, the QoS manager can predict QoS degradation and perform CAC.