• Title/Summary/Keyword: Virtual Path Method

Search Result 159, Processing Time 0.032 seconds

Failure Detection and Resilience in HRing Overlay Network (HRing 오버레이 네트워크에서 실패 탐지 및 회복)

  • Gu, Tae-Wan;Lee, Kwang-Mo
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.21-33
    • /
    • 2007
  • An overlay network is a virtual network which is constructed on top of a physical computer network. A node in the overlay network is connected through virtual or logical links, where each link corresponds to a path of the links in the underlying physical network. Overlay networks are suitable for sharing heterogeneous resources in distributed environments, However, overlay networks are limited for achieving reliable communication that failure detection in overlay networks is a very important issue. In this paper, we review conditions of conventional failure detection and propose a new approach to failure detection and resilience which can be applied to HRing (Hierarchical Ring) overlay networks. The proposed method consists of the failure detection and the failure resilience phases. Because it utilizes the characteristics of the HRing overlay network for failure detection, it can reduce unnecessary network traffic and provide better scalability and flexibility. We also analyzed and evaluated the performance of the proposed approach through simulations.

  • PDF

A Study on the Bandwidth Allocation Control of Virtual Paths in ATM Networks for Multimedia Service (멀티미디어 서비스를 위한 ATM망에서 가상경로의 대역폭 할당 제어에 관한 연구)

  • Jang, Yung-Chul;Lee, Jung-Jei;Oh, Moo-Song
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1433-1442
    • /
    • 1997
  • Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

  • PDF

An Adaptive Distributed Wavelength Routing Algorithm in WDM Networks (파장분할 다중화 (WDM) 망을 위한 적응 분산 파장 라우팅 알고리즘)

  • 이쌍수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1395-1404
    • /
    • 2000
  • In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

  • PDF

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

A Study on the protection of personal information using a Virtual IDs in an anonymous bulletin board (익명 게시판 환경에서 가상 아이디를 이용한 개인정보보호에 관한 연구)

  • Min, So-Yeon;Jang, Seung-Jae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.9
    • /
    • pp.4214-4223
    • /
    • 2012
  • The argument related to the use of real and anonymous names on the Internet bulletin board has recently become a main issue. When using real names, it is possible to violate free discussion and privacy. Also, when using anonymous names, it is possible to have the reverse function of the Internet in regard to the use of malicious replies or the distribution of false ideas. Therefore, this paper has made it possible to prevent the spread of the user's personal information and execute the single log-in process by using the XML-token method which is one of the SSO technologies. Also, by issuing virtual IDs and forming the path when establishing tokens, the anonymous bulletin board which provides anonymity with a conditional tracing process has been suggested. After analyzing the performance of visitor numbers at authentication time, the anonymous bulletin board based on the group signature method showed the average response rate of 0.72 seconds, 0.18 seconds, which was suggested scheme. In the authentication time 4-5 times faster response speed, respectively. Also, since the suggested system does not have to provide a single authentication process or make the user provide his or her signature, the level of user's convenience seems to be much higher. Such a result shows that the system suggested on the anonymous bulletin board has a more appropriate level of user's convenience.

A phase synthesis time reversal impact imaging method for on-line composite structure monitoring

  • Qiu, Lei;Yuan, Shenfang
    • Smart Structures and Systems
    • /
    • v.8 no.3
    • /
    • pp.303-320
    • /
    • 2011
  • Comparing to active damage monitoring, impact localization on composite by using time reversal focusing method has several difficulties. First, the transfer function of the actuator-sensor path is difficult to be obtained because of the limitation that no impact experiment is permitted to perform on the real structure and the difficulty to model it because the performance of real aircraft composite is much more complicated comparing to metal structure. Second, the position of impact is unknown and can not be controlled as the excitation signal used in the active monitoring. This makes it not applicable to compare the difference between the excitation and the focused signal. Another difficulty is that impact signal is frequency broadband, giving rise to the difficulty to process virtual synthesis because of the highly dispersion nature of frequency broadband Lamb wave in plate-like structure. Aiming at developing a practical method for on-line localization of impact on aircraft composite structure which can take advantage of time reversal focusing and does not rely on the transfer function, a PZT sensor array based phase synthesis time reversal impact imaging method is proposed. The complex Shannon wavelet transform is presented to extract the frequency narrow-band signals from the impact responded signals of PZT sensors. A phase synthesis process of the frequency narrow-band signals is implemented to search the time reversal focusing position on the structure which represents the impact position. Evaluation experiments on a carbon fiber composite structure show that the proposed method realizes the impact imaging and localization with an error less than 1.5 cm. Discussion of the influence of velocity errors and measurement noise is also given in detail.

Grouping-based 3D Animation Data Compression Method (군집화 기반 3차원 애니메이션 데이터 압축 기법)

  • Choi, Young-Jin;Yeo, Du-Hwan;Klm, Hyung-Seok;Kim, Jee-In
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.461-468
    • /
    • 2008
  • The needs for visualizing interactive multimedia contents on portable devices with realistic three dimensional shapes are increasing as new ubiquitous services are coming into reality. Especially in digital fashion applications with virtual reality technologies for clothes of various forms on different avatars, it is required to provide very high quality visual models over mobile networks. Due to limited network bandwidths and memory spaces of portable devices, it is very difficult to transmit visual data effectively and render realistic appearance of three dimensional images. In this thesis, we propose a compression method to reduce three dimensional data for digital fashion applications. The three dimensional model includes animation of avatar which require very large amounts of data over time. Our proposed method utilizes temporal and spatial coherence of animation data, to reduce the amount. By grouping vertices from three dimensional models, the entire animation is represented by a movement path of a few representative vertices. The existing three dimensional model compression approaches can get benefits from the proposed method by reducing the compression sources through grouping. We expect that the proposed method to be applied not only to three dimensional garment animations but also to generic deformable objects.

  • PDF

A Genetic Algorithm for the Chinese Postman Problem on the Mixed Networks (유전자 알고리즘을 이용한 혼합 네트워크에서의 Chinese Postman Problem 해법)

  • Jun Byung Hyun;Kang Myung Ju;Han Chi Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.181-188
    • /
    • 2005
  • Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

  • PDF

Progressive fracture analysis of concrete using finite elements with embedded displacement discontinuity

  • Song, Ha-Won;Shim, Byul;Woo, Seung-Min;Koo, Ja-Choon
    • Structural Engineering and Mechanics
    • /
    • v.11 no.6
    • /
    • pp.591-604
    • /
    • 2001
  • In this paper, a finite element with embedded displacement discontinuity which eliminates the need for remeshing of elements in the discrete crack approach is applied for the progressive fracture analysis of concrete structures. A finite element formulation is implemented with the extension of the principle of virtual work to a continuum which contains internal displacement discontinuity. By introducing a discontinuous displacement shape function into the finite element formulation, the displacement discontinuity is obtained within an element. By applying either a nonlinear or an idealized linear softening curve representing the fracture process zone (FPZ) of concrete as a constitutive equation to the displacement discontinuity, progressive fracture analysis of concrete structures is performed. In this analysis, localized progressive fracture simultaneous with crack closure in concrete structures under mixed mode loading is simulated by adopting the unloading path in the softening curve. Several examples demonstrate the capability of the analytical technique for the progressive fracture analysis of concrete structures.

A Study on Design of Visual Sensor Using Scanning Beam for Shape Recognition of Weld Joint. (용접접합부의 형상계측을 위한 주사형 시각센서의 설계에 관한 연구)

  • 배강열
    • Journal of Welding and Joining
    • /
    • v.21 no.2
    • /
    • pp.102-110
    • /
    • 2003
  • A visual sensor consisted of polygonal mirror, laser, and CCD camera was proposed to measure the distance to the weld joint for recognizing the joint shape. To scan the laser beam of the sensor onto an object, 8-facet polygonal mirror was used as the rotating mirror. By locating the laser and the camera at axi-symmetrical positions around the mirror, the synchronized-scan condition could be satisfied even when the mirror was set to rotate through one direction continuously, which could remove the inertia effect of the conventional oscillating-mirror methods. The mathematical modelling of the proposed sensor with the optical triangulation method made it possible to derive the relation between the position of an image on the camera and the one of a laser light on the object. Through the geometrical simulation of the proposed sensor with the principal of reflection and virtual image, the optical path of a laser light could be predicted. The position and direction of the CCD camera were determined based on the Scheimpflug's condition to fit the focus of any image reflected from an object within the field of view. The results of modelling and simulation revealed that the proposed visual sensor could be used to recognize the weld joint and its vicinity located within the range of the field of view and the resolution. (Received February 19, 2003)