• Title/Summary/Keyword: network computing

Search Result 3,187, Processing Time 0.033 seconds

Efficient Link Aggregation in Delay-Bandwidth Sensitive Networks (지연과 대역폭이 민감한 망에서의 효율적인 링크 집단화 방법)

  • Kwon, So-Ra;Jeon, Chang-Ho
    • Journal of Internet Computing and Services
    • /
    • v.12 no.5
    • /
    • pp.11-19
    • /
    • 2011
  • In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information for source routing in transport networks that conduct hierarchical QoS routing. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. This method selects the main path weight in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some path weight during aggregation process. In this paper, the main path weight is defined as outlier. Service Boundary Line has 2k+5parameters. k is the number of outliers. The number of storage spaces of Service Boundary Line changes according to the number of outliers. Simulation results show that our approximation method requires a storage space that 1.5-2 times larger than those in other known techniques depending on outlier selection method, but its information accuracy of proposed method in the ratio between storage space and information accuracy is higher.

An Adaptive Buffer Tuning Mechanism for striped transport layer connection on multi-homed mobile host (멀티홈 모바일 호스트상에서 스트라이핑 전송계층 연결을 위한 적응형 버퍼튜닝기법)

  • Khan, Faraz-Idris;Huh, Eui-Nam
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.199-211
    • /
    • 2009
  • Recent advancements in wireless networks have enabled support for mobile applications to transfer data over heterogeneous wireless paths in parallel using data striping technique [2]. Traditionally, high performance data transfer requires tuning of multiple TCP sockets, at sender's end, based on bandwidth delay product (BDP). Moreover, traditional techniques like Automatic TCP Buffer Tuning (ATBT), which balance memory and fulfill network demand, is designed for wired infrastructure assuming single flow on a single socket. Hence, in this paper we propose a buffer tuning technique at senders end designed to ensure high performance data transfer by striping data at transport layer across heterogeneous wireless paths. Our mechanism has the capability to become a resource management system for transport layer connections running on multi-homed mobile host supporting features for wireless link i.e. mobility, bandwidth fluctuations, link level losses. We show that our proposed mechanism performs better than ATBT, in efficiently utilizing memory and achieving aggregate throughput.

  • PDF

Property-based Hierarchical Clustering of Peers using Mobile Agent for Unstructured P2P Systems (비구조화 P2P 시스템에서 이동에이전트를 이용한 Peer의 속성기반 계층적 클러스터링)

  • Salvo, MichaelAngelG.;Mateo, RomeoMarkA.;Lee, Jae-Wan
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.189-198
    • /
    • 2009
  • Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

  • PDF

A Study of Factors Affecting Attitude Towards Using Mobile Cloud Service (모바일 클라우드 서비스 이용태도에 영향을 미치는 요인 연구)

  • Kim, Su-Yeon;Lee, Sang Hoon;Hwang, Hyun-Seok
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.6
    • /
    • pp.83-94
    • /
    • 2013
  • As smart devices have proliferated and mobile networks have accelerated, various wired IT(Information Technology) services are transplanted in wireless environments. Cloud computing service, enabling individual users or firm users to download data from a server and upload data after manipulating data, is also available in mobile devices. Unlike cloud service in wired network environments, mobile cloud service provides differentiated aspects in mobility, security issues caused by persistent connection to networks. In this paper we aim to analyze the factors affecting the user attitude and their structural relationships towards mobile cloud service use. We extend TAM(Technology Acceptance Model) to consider the characteristics of mobile environments. Research findings, analyzed by SEM(Structural Equation Model), are explained and practical implications are presented with concluding remarks.

Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network (MPLS 망에서 칼라 스레드의 루프방지 알고리즘 개선)

  • 전환식;김한경
    • Journal of Internet Computing and Services
    • /
    • v.3 no.1
    • /
    • pp.41-49
    • /
    • 2002
  • Ohba has suggested the Colored Thread Algorithm to prevent looped path when LSP is to be setup. M immediate node sends thread information such as color, hop count. ill, to downs1ream node via LDP message for the set-up of LSP. Afterward, decides that the looped path is formed when it receives a message with a same colored thread that was sent to downs1ream node, and it searches another path. If the message reaches to the egress node, then acknowledged message is sent to upstream node as reverse direction to the ingress node to set up loop-free path. For the algorithm, Ohva has defined three thread states as Null, Colored, Transparent. In this paper, the state of thread is extended to 5 states such as Extending, Merging, Stalling, Null, and Transparent. By the way, related FSM and TCB was redefined to make clear the ambiguity of thread states which causes faulty actions and to remove overhead. And, to improve performance, it limits to generate a thread in the state of Stalling.

  • PDF

Multiple Access Scheme Using Modified Hermite Polynomial Pulse and Ternary code for Out-Body WBAN (신체 외부 통신에서 MHP 펄스와 터너리 코드를 이용한 다중접속 기법)

  • Shim, Jae-Joon;Hwang, Jae-Ho;Kim, Jae-Moung
    • Journal of Internet Computing and Services
    • /
    • v.12 no.1
    • /
    • pp.27-38
    • /
    • 2011
  • In this paper, we propose a multiple access scheme using MHP(Modified Hermite Polynomial) pulse and ternary code for high-data and low-data rate for Out-body WBAN(Wireless Body Area Network). To satisfy the requirement of WBAN system, UWB-IR has been considered as a promising candidate for Out-body WBAN. The proposed multiple access scheme, using orthogonal MHP pulse and ternary code sets, reduces multi-user interference and distinguishes user signal from multi-user signals. We propose two algorithms for synchronous and asynchronous WBAN system. The symbol is constructed by MHP pulses and time hopping duration to reduce multi-user interference in the synchronous WBAN system. The symbol also is constructed by ternary code to avoid collision between pulse trains in the asynchronous WBAN system. The results of the proposed multiple access scheme show a clear improvement of BER.

Design and Application of Multi Concept Keyword Model based on Web-using Information (웹 사용 정보에 기반한 다중 성향 키워드 모델의 설계와 응용)

  • Yoon, Tae-Bok;Lee, Seung-Hoon;Yoon, Kwang-Ho;Lee, Jee-Hyong
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.95-105
    • /
    • 2009
  • There are various studies to provide useful information for users on huge data of web-sites. Web usage mining among them is a method to extract meaningful patterns based on web users' log data. Most of existing patterns of web usage mining, however, had not considered users' diverse inclination but created general models. Web users' keywords can have various meaning upon their tendency and background knowledge. This study is for generating Multi Concept Keyword Model (MCK-Model) by analyzing web usage information on users' keywords of interest. MCK-Model can supply web page network for various inclination based on users' keywords of interest. Also, MCK-Model can be used to recommend the most proper web pages and it has been confirmed that the suggested method is useful enough.

  • PDF

Study of Document Distribution System Architecture for Digital Secret Document Leakage Prevention (전자기밀문서 유출봉쇄 유통시스템 구조 연구)

  • Choi, Cheong-Hyeon
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.143-158
    • /
    • 2010
  • The illegal leakage of enterprise digital confidential information will threaten the enterprise with bankruptcy. Today since most small-and-medium companies have no capability to fight against illegally compromising their critically confidential documents in spite of knowing the leakage of them, strongly safe distribution system of the digital confidential documents should be designed so in secure as to prevent any malicious intent of embezzlement from accessing the critical information. Current DRM-based protection system is not always perfect to protect the digital secrets, even seems to leave the secrets open. Therefore our study has analyzed the illegal leakage paths that hackers attack against and the vulnerability of the current protection systems. As result, we study the group communication based system architecture satisfying the security conditions to make even legitimate working employee keep out of the confidential documents, without performance degradation. The main idea of this architecture is to stay every secrets in encrypted form; to isolate the encrypted documents from the crypto-key; to associate every entity with one activity and to authenticate every entity with DSA-based public key system; multiple authentication method make hackers too busy to get a privilege to access the secrets with too many puzzle pieces. This paper deal with the basic architectural structure for the above issues.

An App Visualization design based on IoT Self-diagnosis Micro Control Unit for car accident prevention

  • Jeong, YiNa;Jeong, EunHee;Lee, ByungKwan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.1005-1018
    • /
    • 2017
  • This paper proposes an App Visualization (AppV) based on IoT Self-diagnosis Micro Control Unit (ISMCU) for accident prevention. It collects a current status of a vehicle through a sensor, visualizes it on a smart phone and prevents vehicles from accident. The AppV consists of 5 components. First, a Sensor Layer (SL) judges noxious gas from a current vehicle and a driver's driving habit by collecting data from various sensors such as an Accelerator Position Sensor, an O2 sensor, an Oil Pressure Sensor, etc. and computing the concentration of the CO collected by a semiconductor gas sensor. Second, a Wireless Sensor Communication Layer (WSCL) supports Zigbee, Wi-Fi, and Bluetooth protocol so that it may transfer the sensor data collected in the SL to ISMCU and the data in the ISMCU to a Mobile. Third, an ISMCU integrates the transferred sensor information and transfers the integrated result to a Mobile. Fourth, a Mobile App Block Programming Tool (MABPT) is an independent App generation tool that changes to visual data just the vehicle information which drivers want from a smart phone. Fifth, an Embedded Module (EM) records the data collected through a Smart Phone real time in a Cloud Server. Therefore, because the AppV checks a vehicle' fault and bad driving habits that are not known from sensors and performs self-diagnosis through a mobile, it can reduce time and cost spending on accidents caused by a vehicle's fault and noxious gas emitted to the outside.

Performance Analysis of Fractional Frequency Reuse Scheme for Enterprise Femtocell Networks (기업형 펨토셀 네트워크에서 부분 주파수 재사용 방법의 성능분석)

  • Kim, Se-Jin
    • Journal of Internet Computing and Services
    • /
    • v.19 no.1
    • /
    • pp.11-17
    • /
    • 2018
  • In this paper, we propose a novel frequency reuse method using the fractional frequency reuse (FFR) for enterprise femtocell networks (EFNs) in which a lot of femtocell base stations (fBSs) are deployed in a buinding, e.g., business companies, department stores, etc, and evaluate the system performance for the downlink of EFNs. First, we introduce the concept of the split reuse method to allocate the frequency bandwidth with considering the interference between the macrocell and femtocell. Then, we propose the resource allocation with the FFR for fBSs of EFNs to reduce the interference and increase the system capacity. Through simulations, we show that the proposed FFR method outperforms a traditional resource allocation method with frequency reuse factor 4 in terms of the mean fUE capacity, total EFN capacity, and outage probability.