• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

• ETRI Journal
• /
• 제16권3호
• /
• pp.27-41
• /
• 1994

This paper provides a performance study of multistage interconnection networks in packet switching environment. In comparison to earlier work, the model is more extensive - it includes several parameters such as multiple-packet messages, variable buffer size, and wait delay at a source. The model is also uniformly applied to several representative networks and thus provides a basis for fair comparison as well as selection of optimal values for parameters. The complexity of the model required use of simulation. However, a partial analytical model is provided to measure the congestion in a network.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
• /
• pp.29-32
• /
• 2000

MPLS stands for “Multi-protocol Label Switching”. It's a layer 3 switching technology aimed at greatly improving the packet forwarding performance of the backbone routers in the Internet or other large networks. We compare the performance of unlabeled IP traffic and labeled IP traffic. In this paper, by varying the packet rate and measuring throughput of the flows we analyze the performance of labeled IP packet traffic and unlabeled IP packet traffic in IP over MPLS.

• 전자공학회논문지S
• /
• 제34S권8호
• /
• pp.45-55
• /
• 1997

To design a ATM Switch which ahs advantages in high sped packet switching, it is essential to set multiple paths between input ports and output ports and to design a new packet transfer technique on that paths for decreasing Packet Loss by conflicts in internal Switch Plane. We propose new packet transfer method, Alternate Path Transfer Mechanism by Dynamic Bypass Transfer Method which can solve conflict problem in Banyan network easily. Proposed ATM Switch consists of Banyan networks, Input/Ouput Port, Bypass Link, and Bypass Link Controller. Packets caused conflicts in SEs have another chances of packet transfer over alternate switching planes by using this mechanism.

• Journal of Communications and Networks
• /
• 제11권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.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2007년도 학술대회
• /
• 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.

• 한국정보처리학회논문지
• /
• 제6권4호
• /
• pp.1045-1057
• /
• 1999

패킷교환식 다단계 상호 연결 망은 디지털 교환시스템과 슈퍼 컴퓨터분야에서 널리 이용되어 왔다. 본 논문에서 교환 요소내부의 여러 개의 패킷이 한 네트워크 주기동안 그 주기의 대역폭을 충분히 사용함으로써 다음 단계의 교환 요소로 전송되어 질 수 있음을 보인다. 기존의 상호 연결 망에서는 보통 하나의 패킷 전송을 가정했다. 다중 패킷 전송방식이 도입된 다단계 상호 연결 망의 분석적 모델이 소개되고, 컴퓨터 시뮬레이션에 의하여 그 모델의 타당성을 입증한다. 단일 패킷 전송방식을 이용한 전형적인 다단계 상호 연결 망과의 비교는 실용적인 크기의 연결 망에 대하여 처리율이 약 30% 정도까지 증가함을 보여준다. 비슷한 결과가 지연시간에 있어서도 얻어진다. 네트워크 전송량이 불균등한 분포를 나타내는 경우의 성능 향상은 더욱 중요하다.

• 대한전자공학회논문지TC
• /
• 제40권10호
• /
• pp.79-88
• /
• 2003

링 구조형 광통신망에 적합한 완전 광 패킷 스위칭 시스템을 실험적으로 검증한다. 실험적 검증을 위해, 비디오 신호는 헤더와 페이로드로 구성된 광 패킷에 실리고, 완전 광 패킷 스위칭 노드에 전달된다. 전달된 광 패킷은 여러가지 완전 광 프로세서에 의해 처리되는데, 그들은 완전 팡 헤더 처리기, 패킷-레벨 클럭 추출기, 비트-레벨 클럭 추출기, 데이타 형태 변환기 등으로 구성되어 있다.

• Journal of Communications and Networks
• /
• 제16권5호
• /
• pp.548-558
• /
• 2014

Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

• 융합보안논문지
• /
• 제12권1호
• /
• pp.35-42
• /
• 2012

데이터 트래픽의 증가와 대용량 실시간 서비스와 관련된 요구사항들의 증가는 음성이나 전용선 서비스를 주된 목적으로 하는 기존의 시간분할 다중화(TDM: Time Division Multiplexing) 기반 네트워크에서 좀 더 유연하고 동적인 구성이 가능한 광 네트워크로의 전환을 요구하고 있다. 이러한 광 네트워크는 데이터, 비디오, 그리고 음성을 전달할 수 있는 다수의 채널을 제공하는 핵심 인프라가 되었다. 이를 위해 차세대 패킷광 통합망은 네트워크 이상이 발생하여도 용인할 수 있는 수준의 서비스를 지속적으로 제공할 수 있어야 한다. 또한 신속하고 최적화된 복구(restoration) 정책은 GMPLS(Generalized Multi-Protocol Label Switching) 기반 제어평면을 사용으로 하는 차세대 패킷광 통합망의 가장 중요한 요구사항이 되었다. 본 논문은 GMPLS 기반 다계층 패킷광 통합망에서 신속하고 일원화된 복구를 지원하기 위한 계층적인 다계층 복구방식을 살펴보고 이를 지원하기 위한 구현방식을 제안하는 것을 목적으로 하고 있다. 또한 본 논문에서는 기존의 신호 및 라우팅 프로토콜을 수정하지 않고 제안한 방식을 구현할 수 있는 방안의 제안을 목적으로 하고 있다.