• Title/Summary/Keyword: Network division

Search Result 3,113, Processing Time 0.029 seconds

Structure and Performance Analysis of SCM-FTTH Network Based on WDM Technology of Next-Generation Optical Access Networks (차세대 광 액세스 네트워크의 WDM 기술을 기반으로 하는 SCM-FTTH 네트워크의 구조 및 성능 분석)

  • Lee, Sang-Wha
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.10
    • /
    • pp.153-162
    • /
    • 2006
  • The WDM/SCM-FTTH is an advanced optical access Network that can efficiently support various kinds of access network requirements using the WDM and SCM technologies in the near future. In this paper, we propose new network structures of the FTTH(Fiber To The Home) in the WDM(Wavelength Division Multiplexing) and WDM/SCM(Sub-Carrier Multiplexing) FTTH, and evaluate its performance with simulation results for the optical characteristics of the network and the dynamic allocation of bandwidth on demand of the users.

  • PDF

Performance Analysis of SyncML Server System Using Stochastic Petri Nets

  • Lee, Byung-Yun;Lee, Gil-Haeng;Choi, Hoon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.360-366
    • /
    • 2004
  • Synchronization Markup Language (SyncML) is a specification of a common data synchronization framework for synchronizing data on networked devices. SyncML is designed for use between mobile devices that are intermittently connected to a network and network services that are continuously available on the network. We have designed and developed a data synchronization system based on the SyncML protocol and evaluated the throughput of the system using the stochastic Petri nets package (SPNP) and analyzed the relationship between the arrival rate and the system resources. Using this model, we evaluate various performance measures in different situations, and we estimate the relationship between the arrival rate and the system resources. From the results, we can estimate the optimal amount of resources due to the arrival rate before deploying the developed system.

  • PDF

A Study on Real-time simulation using Artificial Neural Network (신경회로망을 이용한 실시간 시뮬레이션에 관한 연구 (원자력 발전소 중대사고를 중심으로))

  • Roh, Chang-Hyun;Jung, Kwang-Ho
    • Journal of Korea Game Society
    • /
    • v.2 no.2
    • /
    • pp.46-51
    • /
    • 2002
  • In this study, a real-time simulation method for the phenomena, which are too complex to be simulated during real-time computer games, was proposed based on the neural network. The procedure of proposed method is to 1) obtain correlation data between input parameters and output parameters by mathematical modeling, code analyses, and so on, 2) train the neural network with the correlation data, 3) and insert the trained neural network in a game program as a simulation module. For the case that the number of the input and output parameters is too high to be analyzed, a method was proposed to omit parameters of little importance. The method was successfully applied to severe accidents of nuclear power plants, reflecting that the method was very effective in real time simulation of complex phenomena.

  • PDF

Development of New Algorithm for RWA Problem Solution on an Optical Multi-Networks

  • Tack, Han-Ho;Kim, Chang-Geun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.2 no.3
    • /
    • pp.194-197
    • /
    • 2002
  • This paper considers the problem of routing connections in a optical multi tree networks using WDM (Wavelength Division Multiplexing), where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, so that connections whose paths share a common link in the network are assigned different wavelengths. The problem of optimal coloring of the paths on the optical multi-networks is NP-hard[1], but if that is the coloring of all paths, then there exists efficient polynomial time algorithm. In this paper, using a "divide & conquer" method, we give efficient algorithm to assign wavelengths to all the paths of a tree network based on the theory of [7]. Here, our time complexity is 0(n4log n).

Design and fabrication of IEEE-802.15.4 protocol based universal sensor node platform with good extensity (확장성이 고려된 IEEE-802.15.4 기반의 저전력 범용 센서노드 설계 및 제작)

  • Chung, Wan-Young;Shin, Kwang-Sig;Jang, Sung-Gyun
    • Journal of Sensor Science and Technology
    • /
    • v.16 no.4
    • /
    • pp.247-253
    • /
    • 2007
  • Low power consumption sensor network platform (sensor node) for sensor networking with IEEE 802.15.4 protocol was fabricated. The sensor node used ceramic bar type antenna for increasing RF signal performance and decreasing PCB size occupied by antenna. The communication range of the fabricated sensor node was about $20{\sim}30$ m in open environment with 915 MHz frequency bandwidth and well supported by Tiny OS. The sensor node have good connectivity with various external devices by RS-232, I2C, analogue and digital expansion board, hence, this sensor node can be applied to various applications in wireless sensor network and ubiquitous sensor network.

Proportional-Fair Downlink Resource Allocation in OFDMA-Based Relay Networks

  • Liu, Chang;Qin, Xiaowei;Zhang, Sihai;Zhou, Wuyang
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.633-638
    • /
    • 2011
  • In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

Multi-Task Network for Person Reidentification (신원 확인을 위한 멀티 태스크 네트워크)

  • Cao, Zongjing;Lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.472-474
    • /
    • 2019
  • Because of the difference in network structure and loss function, Verification and identification models have their respective advantages and limitations for person reidentification (re-ID). In this work, we propose a multi-task network simultaneously computes the identification loss and verification loss for person reidentification. Given a pair of images as network input, the multi-task network simultaneously outputs the identities of the two images and whether the images belong to the same identity. In experiments, we analyze the major factors affect the accuracy of person reidentification. To address the occlusion problem and improve the generalization ability of reID models, we use the Random Erasing Augmentation (REA) method to preprocess the images. The method can be easily applied to different pre-trained networks, such as ResNet and VGG. The experimental results on the Market1501 datasets show significant and consistent improvements over the state-of-the-art methods.

A Study on Aids to Navigation Service Communications Network based on AIS (AIS 기반의 항로표지 서비스 통신망에 대한 연구)

  • Park, In-Hwan;Hwang, Seung-Wook;Lee, Seo-Jeong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2010.04a
    • /
    • pp.143-144
    • /
    • 2010
  • Recently, IALA has introduced AIS AtoN and standardized Aids to Navigation communication system and the World-wide IALA-Net has announced plans to build the system. Systematic beacon network may offer opportunities to make infrastructure for information service and upgrade AtoN service performance. This paper proposes Aids to Navigation information service network for e-NAV. Network based on AIS is consist of AIS AtoN channels as Real, Synthetic or Virtual AIS AtoN. And inner network is consist of Wireless networks as AIS, WCDMA, WIFI, WlBRO, USN or VSAT. Introducing of various network systems can lead to combine and design among land, beacon and service network infrastructures.

  • PDF

The Study of Transmission Speed Analysis In Multimedia Access Network by Environmental Variation (단말의 환경변수에 의한 멀티미디어 가입자망의 전송속도 분석에 관한 연구)

  • Kim, Hyoung-Bae;Park, In-Jung;Chae, Soo-Ik;Park, Dong-Sun;Song, Sang-Seob;Lee, Jae-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.7
    • /
    • pp.1-5
    • /
    • 2001
  • This study accomplish comparison and analysis multimedia access network speed configuration which is effected by different environmental variation. For this testing. Not only LAN configuration which is symmetric network, But also the ADSL which is asymmetric network is tested by network speed checking software which is designed by our lab in a 10BaseT environment. In the case of TCP receive speed, we find out the network speed is changed according to bands of network to 90% of CPU load. Also, If the TCP receive windows's size became 2 times rate more than MTU, it reduced the relation of speed rate.

  • PDF

Road network data matching using the network division technique (네트워크 분할 기법을 이용한 도로 네트워크 데이터 정합)

  • Huh, Yong;Son, Whamin;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.285-292
    • /
    • 2013
  • This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.