• 제목/요약/키워드: star aggregation

검색결과 10건 처리시간 0.01초

향상된 Star Topology Aggregation 기법 (Improved Star Topology Aggregation Scheme)

  • 김남희;조해성
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2005년도 추계 종합학술대회 논문집
    • /
    • pp.601-607
    • /
    • 2005
  • 본 논문에서는 대역폭과 지연 파라미터를 참조하여 PG내의 토폴로지 정보를 요약하는 기법으로 라인 세그먼트를 이용하여 경계노드 사이의 다중 경로 정보를 요약하였다. 이를 위해 토폴로지 요약 정보를 줄이고 다중링크 요약에 유연성을 부여하기 위하여 대역폭과 지연의 한 쌍으로 구성된 두 개의 라인 세그먼트를 이용하는 수정된 라인 세그먼트 기법을 제안하였다. 시뮬레이션 분석결과 제안된 star TA 기법이 기존의 기법보다 성능이 향상됨을 알 수 있었다.

  • PDF

라인 세그먼트를 이용한 향상된 Star Topology Aggregation (Improved Star Topology Aggregation using Line Segment)

  • 김남희
    • 정보처리학회논문지C
    • /
    • 제11C권5호
    • /
    • pp.645-652
    • /
    • 2004
  • 본 논문에서는 대역폭과 지연 파라미터를 참조하여 PG내의 토폴로지 정보를 하는 기법으로 라인 세그먼트를 이용하여 경계노드 사이의 다중 경로 정보를 하였다. 제안된 star 토폴로지 기법에서는 모든 경로를 찾는 대신 홉 카운트 기반의 깊이 우선 방식을 사용하여 효율적으로 다중 경로를 탐색할 수 있도록 하였다. 이를 위해 토폴로지 정보를 줄이고 다중링크 에 유연성을 부여하기 위하여 대역폭과 지연의 한 쌍으로 구성된 두 개의 라인 세그먼트를 이용하는 수정된 라인 세그먼트 기법을 제안하였다. 그리고, 이를 기존의 star 토폴로지에 적용한 효율적인 토폴로지 기법을 제안하였다. 제안된 기법의 성능을 평가하기 위해 기존의 star 기법과 호 성공율, 접근시간 및 크랭크 백율에 대하여 컴퓨터 시뮬레이션을 통해 비교 분석하였다. 시뮬레이션 분석결과 제안된 star TA 기법이 기존의 기법보다 성능이 향상됨을 알 수 있었다.

Bypass-Based Star Aggregation Using Link Attributes for Improving the Information Accuracy

  • Kwon, Sora;Jeon, Changho
    • Journal of Communications and Networks
    • /
    • 제17권4호
    • /
    • pp.428-439
    • /
    • 2015
  • In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O($N^3$) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권2호
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

계층적 QoS 라우팅을 위한 스타 기반의 노드 집단화 (Star-Based Node Aggregation for Hierarchical QoS Routing)

  • 권소라;전창호
    • 정보처리학회논문지C
    • /
    • 제18C권5호
    • /
    • pp.361-368
    • /
    • 2011
  • 본 논문에서는 계층적 QoS 라우팅을 위해 소스 라우팅 방식을 채택하고 있는 전달망에서 적정 경로를 배정하기 위해 필요로 하는 망의 상태 정보를 효율적으로 집단화하는 방법을 제안한다. 이것은 비대칭망에서 집단화 할 링크의 QoS 파라미터가 두 개 이상일 때 기존 스타 집단화 방법이 갖는 집단화된 정보의 부정확성을 줄이기 위한 방법으로, 서비스경계라인을 논리 링크로 갖는 풀 메쉬 토폴로지를 스타 토폴로지로 변형한다. 이를 위해 본 논문에서는 서비스경계라인의 3가지 속성인 분할, 조인 그리고 통합을 정의하며 이 속성들을 이용한 스타 토폴로지로의 변형과 풀 메쉬로의 복원 방법을 제시한다. 제안 방법은 기존 방법과 유사한 공간 복잡도와 시간 복잡도를 갖지만 집단화된 정보의 정확도와 질의 응답 정확도는 기존 방법보다 높다는 것을 실험을 통해 알 수 있었다.

Synthesis and Surface Relief Gratings of Three-Armed Star-Shaped Molecules Bearing 4-(N,N-Diphenyl)Amino-4'-Nitroazobenzene Chromophores

  • Lee, Jung-Eun;Jung, Kyung-Moon;Cho, Min-Ju;Kim, Kyung-Hwan;Choi, Dong-Hoon
    • Macromolecular Research
    • /
    • 제16권5호
    • /
    • pp.434-440
    • /
    • 2008
  • Three-armed, star-shaped molecules containing 4-(N,N-diphenyl)amino-4'-nitroazobenzene chromophores were synthesized to study the diffraction behavior after inscribing surface relief gratings. The two molecules differed in terms of their mode of chromophore attachment to the core. In compound 5, they were bound to the core laterally through alkylene spacers, whereas the chromophores were tethered perpendicularly to the core in compound 4. Although 60 wt% of the polar azobenzene chromophores was comprised of large molecules, no aggregation behavior was observed in the absorption spectra of the thin films. The surface relief gratings were elaborated on the surface of the molecular films by the two-beam interference method. The dynamics of grating formation were studied in terms of the diffraction efficiency using two different film samples made up of two star-shaped molecules. The maximum diffraction efficiency of D-$(ENAZ)_3$, compound 4, was measured to be about 30%, which was significantly high. The mode of chromophore attachment affected the dynamic properties of the diffraction gratings.

ATM망에서의 효율적인 토폴로지 집단화 방법 (Efficient Topology Aggregation in ATM Networks)

  • 유영환;안상현;김종상
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (3)
    • /
    • pp.171-173
    • /
    • 2000
  • 본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

  • PDF

수산 음향 기법을 이용한 연안 저서 어군의 시.공간 분포 및 안정성 조사 (Hydroacoustic Survey of Spatiotemporal Stability and Distribution of Demersal Fish Aggregations in the Coastal Region)

  • 강돈혁;이창원;조성호;명정구
    • Ocean and Polar Research
    • /
    • 제30권1호
    • /
    • pp.79-87
    • /
    • 2008
  • Hydroacoustic technique was used to analyze spatiotemporal stability and distribution of demersal fish aggregations in the coastal region to overcome some limitations of the existing methods such as net and diving. The survey was carried out in the Baekeum Bay on the south coast of Korea in January 2007. The bottom depth in the study site ranges from 7 to 25 m. In order to outline aggregations of demersal fish initial scanning using 200 kHz split-beam transducer was randomly conducted over the large area. Having detected fish aggregation in the specific region, intensive acoustic survey of irregular star pattern was carried out along 14 transects across the area in question. The results of the acoustic survey show that all demersal fish aggregations are concentrated about 5 m from sea bottom having a slight slope and remain steady with no spatial or temporal variations during acoustic survey. The hydroacoustic method used in this study offers a new approach to understand vertical and horizontal distribution, spatiotemporal stability, and biomass estimate of demersal fish aggregations in coastal regions. Additionally, the number of individual fish estimated from in situ acoustic target strength data can be used to understand the standing stock of demersal fish aggregation.

제주 바다목장 해역의 인공어초에 유집된 어군 분포의 공간적 특성 (Spatial characteristics of fish distribution lured by artificial reefs in Jeju marine ranching area)

  • 황보규;장호영
    • 수산해양기술연구
    • /
    • 제50권1호
    • /
    • pp.30-38
    • /
    • 2014
  • Hydro-acoustic survey was carried out to investigate the spatial characteristics of fish distribution near two artificial reefs (AO: large octagonal semi-sphere and AC: combined custom built) having different types in Jeju marine ranching area. The survey system consisted of scientific echo sounder (EK60), DGPS system, and ECDIS (Mecys). Field survey was conducted on August and October 2012 with star survey and line transect survey line method, and species composition was investigated from gill net fishing survey. The acoustic signals from individual fishes and small fish schools were mainly recorded around AO, but large and strong signals from large fish school were mainly detected in the top layer of and the water column near AC. The echogram suggest that the fish aggregation for the two types of AO and AC exist the significant difference in fish species and spatial distribution pattern.

Topology Aggregation Schemes for Asymmetric Link State Information

  • Yoo, Young-Hwan;Ahn, Sang-Hyun;Kim, Chong-Sang
    • Journal of Communications and Networks
    • /
    • 제6권1호
    • /
    • pp.46-59
    • /
    • 2004
  • In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.