• 제목/요약/키워드: Packet switching

Search Result 265, Processing Time 0.03 seconds

Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm (우선순위 제어기법을 기반으로 한 재순환 Shuffle-Exchage 상호연결 ATM 스위치)

  • Park, Byeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1949-1955
    • /
    • 2000
  • This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

  • PDF

Evaluation of Packet Loss Rate in Optical Burst Switching equipped with Optic Delay Lines Buffer

  • To, Hoang-Linh;Bui, Dang-Quang;Hwang, Won-Joo
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.166-167
    • /
    • 2012
  • High packet loss rate and impatience of messages passing through optical switches are essential characteristics in Optical Burst Switching system equipped with Optic Delay Lines buffer, which have not been solved efficiently yet by current existing models. In order to capture both effects, this paper introduces an analytical model from the viewpoint of classical queuing theory with impatient customers. We then apply it to evaluate and compare two wavelength-sharing cases, (1) all delay lines share a common wavelength resource and (2) each wavelength is associated with a number of delay lines. Our numerical results suggest to implement the first case because of lower packet loss rate for a fairly broad range of traffic load.

  • PDF

파켓트 교환시스템에 관한 연구

  • 정광수;김태근;이재을;이경근;백제인;김재균
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1982.10a
    • /
    • pp.22-24
    • /
    • 1982
  • A small packet switching netwok is studied and designed in compliance with the CCITT recommendation X.25. Basic algorithms are investigated for the terminal interface and PAD, packet control and link connection.

  • PDF

On the Technology for High-speed Router Design (고속 라우터 기술)

  • 주성순
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.105-108
    • /
    • 1999
  • In this paper, we define the high-speed router as a router, which can support aggregated ports over 25Gbps, and provide issues and trends in high-speed router design. We propose design considerations on IP packet forwarding, switching fabric, packet scheduling and buffer management, network resource reservation, and router operation and administration.

  • PDF

End-to-End Quality of Service Constrained Routing and Admission Control for MPLS Networks

  • Oulai, Desire;Chamberland, Steven;Pierre, Samuel
    • Journal of Communications and Networks
    • /
    • v.11 no.3
    • /
    • pp.297-305
    • /
    • 2009
  • Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

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

  • Lim, Huhn-Kuk
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.171-177
    • /
    • 2009
  • Optical packet switching(OPS) is a strong candidate for the next-generation internet, since it has a fine switching granularity at the packet level for providing flexible bandwidth, and provides seamless integration between WDM layer and IP layer. Optical packet switching have been studied in two categories: OPS in synchronous and OPS in asynchronous networks. In this article we are focused on contention resolution of OPS in asynchronous networks. The hybrid buffer have been addressed, to reduce packet loss further as one of the alternative buffer structures for contention resolution of asynchronous and variable length packets, which consists of the FDL buffer and the electronic buffer. The OPS design issue for the limited number of TWCs and internal wavelengths is important in the aspect of switch cost and resource efficiency. Therefore, an hybrid buffer structured optical packet switch and its scheduling algorithm is presented for considering the limited number of TWCs and internal wavelengths, for contention resolution of asynchronous and variable length packets. The proposed algorithm could lead to the packet loss improvement compared to the legacy LAUC-VF algorithm with only the FDL buffer.

  • PDF

Performance Evaluation of CDMA Network with DiffServ (DiffServ를 사용한 CDMA Network의 성능평가)

  • 김재철;최양희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.79-81
    • /
    • 2002
  • 현재의 이동전화망의 연결 방식은 Circuit Switching에 가깝다고 할 수 있다. 이것을 Fully Packet Switching 방식으로 변경했을 경우, 현재의 Channel Utilization Model로 원하는 음성통화의 품질을 제공할 수 있을 지에 대해서는 아직 충분한 검증이 이뤄진 바가 없다. DiffServ를 적용하는 것이 하나의 해결책이 될 수 있는데. 본 논문에서는 Simulation을 통해 이 방법의 효용성을 보였다.

  • PDF

The study on effective operation of ToP (Timing over Packet) (ToP (Timing over Packet)의 효과적인 운용 방안)

  • Kim, Jung-Hun;Shin, Jun-Hyo;Hong, Jin-Pyo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.136-141
    • /
    • 2007
  • The frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) for applications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the telecom network. As telecom networks evolve from circuit to packet switching, proper synchronization algorithm should be meditated for IP networks to achieve performance quality comparable to that of legacy circuit-switched networks. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. But, The ToP can be affected by impairments of a network such as packet delay variation. This paper proposes the efficient method to minimize the expectable delay variation when ToP synchronizes the distributed clocks. The simulation results are presented to demonstrate the improved performance case when the efficient ToP transmit algorithm is applied.

  • PDF

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

  • Oh, Se-Yoon;Hong, Hyun-Ha;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.4
    • /
    • pp.311-322
    • /
    • 2002
  • Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

  • PDF