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

검색결과 53건 처리시간 0.025초

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.

Design and Analysis of Ethernet Aggregation to XGMII Framing Procedure

  • Kim, You-Jin;Huh, Jae-Doo
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.331-334
    • /
    • 2005
  • This paper suggests the Ethernet aggregation to XGMII framing procedure (EAXFP) mechanism to economically combine the traffic adaptation technology with the link aggregation method in designing 10 Gigabit Ethernet (10 GbE) interfaces. This design sidesteps the data-loss issues that can result from designing an interface with only one link. The most critical issue in relation to the link aggregation interface is the algorithm used to control frame distribution between the ten ports. The proposed EAXFP mechanism offers an efficient link aggregation method as well as an efficient frame distribution algorithm, which maximize the throughout of the 10 GbE interface. In the experiment and analysis of the proposed mechanism, it was also discovered that the 10 GbE interface that uses the proposed EAXFP mechanism significantly reduced the packet loss rate. When there will be heavy traffic loads come about in the future, the proposed EAXFP mechanism assures an efficient and economical transmission performance on the router system.

  • PDF

네트워크 보안 기능을 갖는 패킷처리 기반의 링크 통합 장비 설계 (The Design of a Link Aggregation Equipment Based on Packet Processing with Network Security Capability)

  • 신재흥;김홍렬;이상하;허용민;이상철
    • 전기학회논문지P
    • /
    • 제60권3호
    • /
    • pp.150-154
    • /
    • 2011
  • The technology to build high speed network using low cost DSL in the areas where the cost to build high speed network is high and the network environment is not very accommodating is important in providing the high speed network that meets the user demand and utilizing the network resources in an efficient way. This study presents development of the link aggregation equipment that performs the access control and firewall functions for packet processing based LAN users. The equipments developed support up to 5 line link aggregation as opposed to current 2 line link aggregation. The equipments also allow the use of high speed network in the areas where the network environment is not very accommodating. Also, the fail-over function is added to each line to provide reliability and the self-security function is enhanced to protect the network from unauthorized use and prevents waste of network resources by authorized users.

Advanced Frame Distribution Method Using Padding for Link Aggregation between 10GbE Switches

  • Lee Soong-Hee;Jeon Hyoung-Goo
    • Journal of information and communication convergence engineering
    • /
    • 제3권1호
    • /
    • pp.13-17
    • /
    • 2005
  • The link e daggregation between 10GbE switches requires an advanced framistribution method to be properly and efficiently applied. The fixed or dynamic frame distribution methods, formerly proposed, cannot fully utilize the aggregated links, where the receiving terminal only attaches to a pre-specified link among multiple physical links. A frame distribution method using padding is proposed for the link aggregation between 10GbE switches to solve this problem. We compared the performance of the proposed method with those of the static and dynamic frame distribution methods. As a result, the proposed method shows a better performance when the offered load is below 0.7 and the average length of the frames is longer than 954 bytes.

10GbE 스위치간 링크 집합을 위한 프레임 분배방식 (Frame Distribution Methods for Link Aggregation between 10GbE Switches)

  • 이호영;이숭희;이종협
    • 한국통신학회논문지
    • /
    • 제28권12A호
    • /
    • pp.945-950
    • /
    • 2003
  • 10GbE 스위치간 링크 집합 기술은 프레임 분배 알고리즘의 설계에 따라 스위치에서 성능의 차이를 가져오므로 링크 집합의 장점을 살리려면 좋은 성능을 가지는 프레임 분배 알고리즘이 필요하다. 기존에 제시된 스위치와 스위치 사이에서의 프레임 분배 방식으로 정적 / 동적 프레임 분배 방식이 있으나 이 방식은 수신단말이 여러 개의 물리적인 링크 중 하나의 링크에 고정이 되어 프레임을 전송하기 때문에 집합된 링크를 모두 사용하지 못해 링크 집합의 이점을 충분히 활용하지 못한다. 이 문제점을 해결하기 위해 스위치간 링크 합에 패딩을 이용한 분배 방식의 적용을 제안하고 성능 측면에서 정적 / 동적 분배 방식과 비교하였다. 그 결과 제안된 패딩 방식의 성능이 부하가 0.7이하이고 프레임 평균 길이가 954 바이트보다 더 긴 경우에 더 우수한 성능을 보였다.

IP 기반 전술네트워크를 위한 효율적인 Link-K 메시지 통합 및 전송기법 (An Efficient Link-K Message Aggregation and Transmission Method for IP-based Tactical Networks)

  • 윤선중;성윤경;조윤철;고영배
    • 한국군사과학기술학회지
    • /
    • 제13권6호
    • /
    • pp.1064-1070
    • /
    • 2010
  • Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

A New Fast P2P Video Transmission Method Applied in Asymmetrical Speed Channel Environment

  • Wang, Zhang;Zhang, Jixian;Li, Haitao;Liu, Jian
    • Journal of Communications and Networks
    • /
    • 제12권3호
    • /
    • pp.209-215
    • /
    • 2010
  • In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

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.

다중 무선랜 인터페이스 전송을 위한 결합 방식의 성능 연구 (A Comparative Study of Aggregation Schemes for Concurrent Transmission over Multiple WLAN Interfaces)

  • 유리스;황환웅;윤지훈
    • 전자공학회논문지
    • /
    • 제51권7호
    • /
    • pp.18-25
    • /
    • 2014
  • 무선 전송 용량의 향상을 위해 다른 주파수 대역을 사용하는 복수 개의 무선 인터페이스를 결합하여 동시에 사용하는 것을 고려할 수 있다. 본 논문에서는 복수 개의 Wi-Fi 인터페이스를 갖는 시스템을 대상으로, 인터페이스 결합 사용을 위한 링크 결합과 다중경로 TCP(MPTCP)의 두 기법을 실험을 통해 성능을 비교, 분석한다. 실험은 트래픽 종류, 네트워크 지연 시간, 무선 채널 품질, 인터페이스 장애 등의 다양한 조건이 고려되었다. 실험 결과, 인터페이스 결합을 통한 다중 전송은 큰 수율 이득이 있었다. 하지만, 링크 결합 기법은 패킷 전달 순서의 변경으로 중복 TCP 응답이 발생하여 MPTCP보다 낮은 수율을 보였고, 이의 개선을 위해 응답 필터링이 적용될 경우 이득이 있음을 확인하였다. 또, 링크 결합 기법에서 스케줄링 가중치의 조합에 따른 성능 차이가 있으므로 시공간에 따라 적응적으로 가중치를 조절할 필요가 있음을 보였다. 한편, 링크 결합 기법은 MPTCP 대비 빠른 반응으로 인해 긴 네트워크 지연 시간 및 인터페이스 장애 시 더 나은 성능을 보였다. 끝으로, 평균 소비 전력 계산을 위한 수학 모델을 제시하고, 이를 통해 각 기법의 소비 전력을 비교, 분석하였다.

통행시간 산정 및 예측을 위한 최적 집계시간간격 결정에 관한 연구 (Determining Optimal Aggregation Interval Size for Travel Time Estimation and Forecasting with Statistical Models)

  • Park, Dong-Joo
    • 대한교통학회지
    • /
    • 제18권3호
    • /
    • pp.55-76
    • /
    • 2000
  • 실시간 통행시간관련자료의 집계시간간격은 보다 신뢰성있는 통행시간정보제공과 교통정보센터의 효율적인 운영을 위해 매우 중요한 요소이다. 그러나 대부분의 기존 VDS 및 TCS교통정보 데이터는 통계학적·공학적 차원에서의 합리적인 연구나 검증없이 경험적 간격으로 집계되고 있다. 본 연구의 목적은 링크 및 교통축(Corridor) 통행시간 산정 및 예측시의 최적 집계 시간간격을 결정할 수 있는 통계학적 모형을 개발하고 실제 도로망에서 수집되는 통행시간자료에 적용하는 것이다 첫째로, 본 연구는 링크 및 교통축 통행시간 산정 및 예측으로 인한 오차를 계량화하는 통계학적 모형을 제시하고, 제시된 모형의 의미를 교통류이론 측면과 통행시간정보 이용자측면에서 살펴보았다. 둘째로, 미국 Texas, Houston의 도시고속도로에서 AVI시스템을 통해 수집된 통행시간자료를 제시된 모형에 적용하였다. 적용결과 링크통행시간 산정을 위한 최적 집계시간간격보다 링크통행시간예측을 위한 최적 집계시간간격이 큰 것으로 나타났으며, 교통축 통행시간 산정 및 예측을 위한 최적 집계시간간격은 교통축을 구성하는 링크간의 상관관계 (Correlation)에 큰 영향을 받는 것으로 분석되었다.

  • PDF