• 제목/요약/키워드: Packet Switching Networks

검색결과 89건 처리시간 0.035초

IPOA 망에서 DiffServ를 이용한 QoS 메커니즘의 성능분석 (Performance Analysis of QoS Mechanism Using DiffServ in IPOA Networks)

  • 문규춘;최현호;박광채
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
    • /
    • pp.307-310
    • /
    • 2000
  • ATM is the switching and multiplexing technology chosen by the ITU-T for the operation of B-lSDN. Basically, ATM technology is designed to combine the reliability of circuit switching with the efficiency and flexibility of packet switching technology. For servicing QoS in IPOA(IP over ATM) when the larger effort is given, it will be the good method that the original QoS benefits having ATM switching have in ATM layer underlying layer. The IETF has recently proposed Differentiated Services framework for provision of QoS. In this paper we analyse performance of two Diffserv mechanism. Threshold Dropping and Priority Scheduling. Threshold Dropping and Priority Scheduling can be regarded as basic mechanisms from which the other mechanisms have been derived. Hence comparative performance of these two mechanisms in providing required QoS is an important issue. In this Paper we carry out a performance comparison of the TD and PS mechanisms with the aim of providing the same level of packet loss to the preferred flow. Our comparison of the TD and PS allows us to determine resultant packet loss for the non-preferred flows as a function of various parameters of the two mechanisms.

  • PDF

Protection Switching Methods for Point-to-Multipoint Connections in Packet Transport Networks

  • Kim, Dae-Ub;Ryoo, Jeong-dong;Lee, Jong Hyun;Kim, Byung Chul;Lee, Jae Yong
    • ETRI Journal
    • /
    • 제38권1호
    • /
    • pp.18-29
    • /
    • 2016
  • In this paper, we discuss the issues of providing protection for point-to-multipoint connections in both Ethernet and MPLS-TP-based packet transport networks. We introduce two types of per-leaf protection-linear and ring. Neither of the two types requires that modifications to existing standards be made. Their performances can be improved by a collective signal fail mechanism proposed in this paper. In addition, two schemes - tree protection and hybrid protection - are newly proposed to reduce the service recovery time when a single failure leads to multiple signal fail events, which in turn places a significant amount of processing burden upon a root node. The behavior of the tree protection protocol is designed with minimal modifications to existing standards. The hybrid protection scheme is devised to maximize the benefits of per-leaf protection and tree protection. To observe how well each scheme achieves an efficient traffic recovery, we evaluate their performances using a test bed as well as computer simulation based on the formulae found in this paper.

CLSR: Cognitive Link State Routing for CR-based Tactical Ad Hoc Networks

  • Ahn, Hyochun;Kim, Jaebeom;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.50-67
    • /
    • 2015
  • The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

Design of MPLS-based micro-mobility management protocol with QoS support

  • Kim, Byung-Chul;Lee, Jae-Yong
    • 한국통신학회논문지
    • /
    • 제28권1B호
    • /
    • pp.64-70
    • /
    • 2003
  • In order to provide seamless wireless Internet service, the basic mobile IP protocol should be enhanced to solve packet loss problem from large registration latency because frequent handoffs occur in cellular networks. In this paper, we suggest a new micro-mobility management protocol based on MPLS while supporting Qos, and evaluate its performance using simulation. We use MPLS label switching techniuqe in cellular access networks to simplify location management and speed up packet transmission. We adopt context transfer procedure to minimize the delay needed to attain prior level of service after handoff Packet loss can be minimized during handoff by transmitting received packets from old BSLER to new BSLER using a spliced LSP between them. Simulation results show that the proposed MPLS-based micro-mobility management protocol provides a seamless handoff and supports QoS of user traffic.

제한된 수의 튜닝 가능한 파장변환기와 내부파장을 갖는 하이브리드 버퍼 구조의 광 패킷 스위치 (Hybrid Buffer Structured Optical Packet Switch with the Limited Numbers of Tunable Wavelength Converters and Internal Wavelengths)

  • 임헌국
    • 인터넷정보학회논문지
    • /
    • 제10권2호
    • /
    • pp.171-177
    • /
    • 2009
  • 광 패킷 스위칭 기술은 대용량 인터넷 트래픽을 패킷레벨에서 보다 유동적인 대역폭으로 전송해 줄 수 있으며, WDM 계층과 I P 계층을 유연하게 통합 해 줄 수 있기 때문에 차세대 광 인터넷을 위한 가장 강력한 스위칭 기술 중 하나이다. 광 패킷 스위칭 기술의 연구는 동기식 망 안에서의 연구와 비동기식 망 안에서의 연구로 나뉘며 본 논문에서는 인터넷 트래픽과 같은 비동기 가변길이 패킷들을 위한 광 패킷 스위치 내부에 경합해결 이슈에 초점이 맞추어져 있다. 하이브리드 버퍼는 광 지연 선로 버퍼와 전자 버퍼로 구성 되어 비동기 가변길이 패킷들의 경합 해결을 위한 하나의 대체 버퍼로서 패킷 손실 확률을 감소시키기 위해 소개된바 있다. 그런데 스위치 내부의 자원 중 튜닝 가능한 파장 변환기의 개수와 내부 파장 개수를 고려한 광 패킷 스위치의 디자인은 스위치 비용과 자원 이용 효율을 결정짓는 매우 중대한 이슈이다. 따라서 본 논문에서는 한정된 수의 튜닝 가능한 파장 변환기와 내부 파장 개수를 고려한 하이브리드 버퍼 구조형 광 패킷 스위치를 설계하고 그것의 스케쥴링 알고리즘을 소개하고자 한다. 제안한 스케쥴링 알고리즘은 광 지연 선로 버퍼만을 갖는 기존의 LAUC-VF 알고리즘과 비교하여 더 나은 패킷 손실 확률을 제공해 줄 수 있었다.

  • PDF

고속의 패킷 교환망에서 패킷 손실율을 최소화하기 위한 경로 제어 알고리즘 (A Routing Algorithm for Minimizing Packet Loss Rate in High-Speed Packet-Switched Networks)

  • 박성우
    • 한국통신학회논문지
    • /
    • 제19권1호
    • /
    • pp.66-74
    • /
    • 1994
  • 고속의 패킷 교환망에서 최적 경로 제어 문제(ORP: Optical Routing Poblem)를 해결하기 위해 gradient projection (GP) 기법을 적용하였따. 망 평균 패킷의 손실율을 최소화하는 ORP는 교환 노드들에서 패킷들이 손실됨으로써 non-convex가 되어, GP 알고리즘에 의해서는 그 경로해를 직접 구할 수가 없다. 따라서, 이 non-convex ORP를 reduced ORP (R-ORP)라 불리는 convex 문제로 변형시킨후, 그 경로해를 구하고자 GP 알고리즘을 이용하였다. 컴퓨터 모의 실험에 의해서는 R-ORP를 통해 얻어진 경로해가 원래 ORP의 최적 경로해에 아주 근사함을 보여준다. 또한 ORP 와 R-ORP들을 통해 얻어진 두 경로해간의 차이에 있어서의 이론적인 상한이 유도된다.

  • PDF

ATM망에서의 IP스위칭 기술의 과제 (IP Switching Issues in the ATM Networks)

  • 홍석원;이근구;김장경
    • 한국정보통신학회논문지
    • /
    • 제2권4호
    • /
    • pp.575-581
    • /
    • 1998
  • 현재의 인터넷은 대역폭의 확대, 망 규모의 확장, 그리고 새로운 서비스의 제공이라는 과제를 안고 있다. 본 논문에서는 이러한 현재의 인터넷 백본망의 과제를 해결하기 위하여 ATM 스위치를 기반으로 IP 패킷을 전달하는 ATM 망에서의 IP 스위칭 기술을 적용할 경우 고려해야 할 기술적인 과제와 그 해결 방향을 제시하고 있다. 기술적인 과제로 확장성(scalability), ATM VC 설정과 패킷 흐름과의 매핑, 트래픽 관리와 트래픽 엔지니어링의 과제, 멀티캐스트, 그리고 ATM 스위치에서 멀티서비스의 수용의 필요성에 대해서 언급하였다.

  • PDF

An Enhanced Dynamic Multilayer Routing for Networks with Protection Requirements

  • Urra, Anna;Calle, Eusebi;Marzo, Jose L.;Vila, Pere
    • Journal of Communications and Networks
    • /
    • 제9권4호
    • /
    • pp.377-382
    • /
    • 2007
  • This paper presents a new enhanced dynamic and multilayer protection(DMP) routing scheme that considers cooperation between packet and wavelength switching domain in order to minimize the resource consumption. The paper describes the architecture of the multilayer network scenario and compares the proposed algorithm with other routing mechanisms applying protection at the IP/multi-protocol label switching(MPLS) layer or at the optical layer. Simulation results show that DMP reduces the number of optical-electrical-optical(o-e-o) operations and makes an efficient use of the network resources compared to non-multilayer proposals.

ASYMPTOTIC MAXIMUM PACKET SWITCH THROUGHPUT UNDER NONUNIFORM TRAFFIC

  • JEONG-HUN PARK
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.43-58
    • /
    • 1998
  • Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

  • PDF