• Title/Summary/Keyword: 단일 노드

Search Result 490, Processing Time 0.028 seconds

Two-phase Multicast in Wormhole-switched Bidirectional Banyan Networks (웜홀 스위칭하는 양방향 베니언 망에서의 두 단계 멀티캐스트)

  • Kwon, Wi-Nam;Kwon, Bo-Seob;Park, Jae-Hyung;Yun, Hyeon-Su
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.255-263
    • /
    • 2000
  • A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

  • PDF

Application of Neural Network Self Adaptative Control System for A.C. Servo Motor Speed Control (A.C. 서보모터 속도 제어를 위한 신경망 자율 적응제어 시스템의 적용)

  • Park, Wal-Seo;Lee, Seong-Soo;Kim, Yong-Wook;Yoo, Seok-Ju
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.7
    • /
    • pp.103-108
    • /
    • 2007
  • Neural network is used in many fields of control systems currently. However, It is not easy to obtain input-output pattern when neural network is used for the system of a single feedback controller and it is difficult to get satisfied performance with neural network when load changes rapidly or disturbance is applied. To resolve these problems, this paper proposes a new mode to implement a neural network controller by installing a real object in place of activation function of Neural Network output node. As the Neural Network self adaptive control system is designed in simple structure neural network input-output pattern problem is solved naturally and real tin Loaming becomes possible through general back propagation algorithm. The effect of the proposed Neural Network self adaptive control algorithm was verified in a test of controlling the speed of a A.C. servo motor equipped with a high speed computing capable DSP (TMS320C32) on which the proposed algorithm was loaded.

The Design of Real-Time Full Accounting Management System in a Broadband Access Network (광대역 액세스망의 실시간 과금 관리 시스템 설계)

  • Shim, Jea-Chan;Chang, Beom-Hwan;Hong, Seong-Sun;Ko, Byung-Do;Chung, Tai-Myoung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2663-2675
    • /
    • 1998
  • The billing manabement techniques for multiple services in the B-ISDN network have been rarely developed. In fact, the management techniques including billing manabement only focus on a single service environment. In this paper, we propose a billing management system architecture for the multiple services in a Broadband access network. The architecture is based in OSI system management infrastruture and TMN Q3 interface to exchange and process the billing information from access node that is an ATM Cross connecter. The system is designed to actively adopt the rapidly changing service environments and B-ISDN network management techniques. Futhermore, this system supports multiple services providers by real-time collector and charging functions for their requirements compared to the previous methodologies tat only use the statistical data.

  • PDF

Network-Based Partially-Distributed Mobility Management Mechanism and Performance Evaluation (망기반 부분분산형 이동성 관리 메커니즘 및 성능분석)

  • Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.75-84
    • /
    • 2014
  • In order to solve the problems such as overload, single point of failure, non-optimized data path, and network scalability in conventional central mobility management protocols, distributed mobility management schemes have been continually studied in and around the IETF. In this paper, a network-based partially-distributed mobility management mechanism, pDMMv6, is suggested and the performance comparison with traditional protocols such as PMIPv6 and MIPv6 is made through simulation under the various user traffic environment. The simulation results include UDP packet delivery ratio, end-to-end packet delay, binding delay for registration signaling, CPU utilization in each node, and response delays in several server-client TCP applications such as web browsing, e-mail, telnet remote login, FTP file up/down-load, and database access.

Efficient Internet Traffic Engineering based on Shortest Path Routing (최단경로 라우팅을 이용한 효율적인 인터넷 트래픽 엔지니어링)

  • 이영석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.183-191
    • /
    • 2004
  • Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

Design and Fabrication of the 94 GHz Branch-line Bandpass Filter using CPW structure (CPW 구조를 이용한 94 GHz Branch-line 대역통과 여파기의 설계 및 제작)

  • Kwon, Hyuk-Ja;Bang, Suk-Ho;Lee, Sang-Jin;Yoon, Jin Seob;Rhee, Jin-Koo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.5
    • /
    • pp.36-41
    • /
    • 2007
  • We report the 94 GHz CPW branch-line bandpass filter for planar integrated millimeter-wave circuits. The branch-line coupler operates as a transversal filtering section by connecting the coupling ports to the open load stubs and taking the isolation port as the output node. For design of the 94 GHz branch-line bandpass filter, we built the CPW library and optimized the characteristic impedances and the lengths of the branch-line coupler and the open load stubs. The fabricated 94 GHz bandpass filter exhibits an insertion loss of 2.5 dB with an 11.7 % 3 dB relative bandwidth and the return loss is -18.5 dB at a center frequency of 94 GHz.

Efficient Processing of Multipoints MAX/MIN Queries in OLAP Environment (OLAP 환경에서 다중점 MAX/MIN 질의의 효율적인 처리기법)

  • Yang, Woo-Suk;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.27 no.1
    • /
    • pp.13-21
    • /
    • 2000
  • Online analytical processing (OLAP) systems are introduced to support decision support systems. Many researches focussed on efficient processing of aggregate functions that usually occur in OLAP queries. However, most previous researches in the literature are deal with the situation in which aggregate functions arc applied to all the values in a given range. Since those approaches utilize characteristic of aggregate functions applied to a range, they are difficult to be applied to a muitipoint query that is a query considering only some points in a given range. In this paper, we propose the Ranking Index and the flanking Decision Tree (RDT) for efficient evaluation of multipoints MAX/MIN queries. The ranking of possible MAX/MIN values are computed with RDT Then MAX/MIN values can be acquired from the Ranking Index. We show through experiments that our method provides high performance in most situations. In other words, the proposed method is robust as well as efficient. A single common set of precomputed results for both MAX and MIN values is another advantage of the proposed method.

  • PDF

Real-Time Full Accounting Management System in Multi-services Access Integrated Network : Design and Implementation (다중 서비스망 환경에서의 실시간 과금 관리 시스템설계 및 구현)

  • Chang, Beom-Hwan;Kim, Jong-Min;Go, Byung-Do;Chung, Tai-Myoung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.254-264
    • /
    • 2000
  • The billing techniques to support multiple services in an ATM based broadband access network have been rarely developed. In fact, the management techniques including accounting management have only focused on a single service environment such as PSTN thus far. In this paper, we present an accounting management system, called rtFAMS, designed and implemented to provide multiple Value Added Service Providers (VASPS) the charging records for the multiple services in a broadband access network. The architecture is based on OSI system management infrastructure and TMN Q3 interface to acquire accounting information from agents in the ATM cross-connecters as well as to process the billing mechanisms in the manager. This system Is designed to actively adopt the rapidly changing service environments and B-ISDN network management techniques. It also provides real-time accounting information to users using Web in addition to supplying the billing records to VASPs.

  • PDF

QoS Supporting Scheme Considering Service-Differentiation Ratio in Optical Burst Switching Networks (광 버스트 스위칭 망에서 서비스 차등률을 고려한 QoS 제공 기법)

  • 소원호;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.12C
    • /
    • pp.1197-1206
    • /
    • 2002
  • Recently, the research on the construction of optical Internet backbone networks using WDM has been actively progressed. In this paper, we propose the offset based service-differentiation scheme in optical burst switching (OBS) networks. We classify the services into two classes; high class and low class. The proposed scheme decides the offset time of high class so as to satisfy the required burst loss rate (BLR) of services according to the service-differentiation ratio (SDR). The SDR may be set depending on the environment of OBS network and user's requirements, our scheme decides the BLR of high class by using the required SDR and conservation law. Finally, we use the offset time decision (OTD) algorithm to determine the offset time of high class. The proposed scheme is evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.

A Study on Network Hierarchy Model which uses a Dynamic Segmentation Technique (동적 분할 기법을 이용한 네트워크 계층 모델에 관한 연구)

  • Joo, Yong-Jin;Lee, Yong-Ik;Moon, Kyung-Ky;Park, Soo-Hong
    • Spatial Information Research
    • /
    • v.14 no.2 s.37
    • /
    • pp.245-260
    • /
    • 2006
  • A practical use of the location information and user requirement are increased in a mobile environment which supports the portability. And Various service which GIS is related with a Spatial DB have been processed. Generally, logical relation of a traffic network which organizes the Road DB uses a basic node-link structure. In this way, Designed structure can not be flexible at various model apply and are not efficient with a database retrieval in a maintenance management side. In this research, We supplement with the problem of a existing network model and the limitation of the building through the design of a network model which uses dynamic segmentation. And we tried to implement efficient hierarchy model at the retrieval of the network and presentation. Designed model supports a stage presentation of various level and a hierarchy entity relation and We are expected to supplement a network spatial modelling function which the GIS has.

  • PDF