• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2492-2512
• /
• 2018

Multicast communication can effectively reduce network resources consumption in contrast with unicast. With the advent of SDN, current researches on multicast traffic are mainly conducted in the SDN scenario, thus to mitigate the problems of IP multicast such as the unavoidable difficulty in traffic engineering and high security risk. However, migration to SDN cannot be achieved in one step, hybrid SDN emerges as a transitional networking form for ISP network. In hybrid SDN, for acquiring similar TE and security performance as in SDN multicast, we redirect every multicast traffic to an appropriate SDN node before reaching the destinations of the multicast group, thus to build up a core-based multicast tree substantially which is first introduced in CBT. Based on the core SDN node, it is possible to realize dynamic control over the routing paths to benefit traffic engineering (TE), while multicast traffic manageability can also be obtained, e.g., access control and middlebox-supported network services. On top of that, multiple core-based multicast trees are constructed for each multicast group by fully taking advantage of the routing flexibility of SDN nodes, in order to further enhance the TE performance. The multicast routing and splitting (MRS) algorithm is proposed whereby we jointly and efficiently determine an appropriate core SDN node for each group, as well as optimizing the traffic splitting fractions for the corresponding multiple core-based trees to minimize the maximum link utilization. We conduct simulations with different SDN deployment rate in real network topologies. The results indicate that, when 40% of the SDN switches are deployed in HSDN as well as calculating 2 trees for each group, HSDN multicast adopting MRS algorithm can obtain a comparable TE performance to SDN multicast.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.97-104
• /
• 2005

The paper proposes an implementation architecture of DiffServ-over-MPLS traffic engineering (TE) on Intel IXP2400 network processor using Intel IXA SDK 4.0 Framework. Program architecture and functions are described. Also fast and scalable range-match classification scheme is proposed for DiffServ-over-MPLS TE that has been integrated with functional blocks from Intel Microblocks library. Performance test shows that application can process packets at approximate data rate of 3.5 Gbps. The proposed implementation architecture of DiffServ-over-MPLS TE on Network processor can provide guaranteed QoS on high-speed next generation Internet, while being flexible and easily modifiable.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.815-820
• /
• 2004

For providing high quality-guaranteed service over Internet, traffic engineering based on an MPLS technology is being introduced. MPLS traffic engineering performs the computation on the path guaranteeing service`s quality and the reservation on network resources by an MPLS signaling protocol. As one of MPLS signaling protocol, RSVP-TE protocol transmits and receives periodic refresh messages for maintaining the path of a traffic flow. Such characteristic gives a heavy processing overhead to routers for maintaining states of large number of paths. In this paper, we propose a scalable implementation approach for RSVP-TE without dramatically increasing processing overhead. And we eval-uate the processing overhead on periodic messages by implementing the RSVP-TE protocol and the reduction mechanism of periodic messages.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.129-137
• /
• 2003

As the Internet is quickly evolving from best-effort networks to a very critical communications infrastructure that requires higher quality Internet services and the delivery of such communications services become competitive, large-scale NSPs or ISPs have to concern much more on the performance and efficient resource usages of their networks. This situation naturally leads the providers to seek a possible solution from traffic engineering (TE) methodologies. In this paper, we propose a TE server solution for a large-scale MPLS-based IP autonomous system, which addresses these TE requirements such as the measurement, characterization, modeling and control of Internet traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.270-281
• /
• 2003

ETF made the RFCs of MPLS technologies for providing the QoS of ATM or Frame Relay and the flexibility&scalability of IP on the Internet services. IETF has been expanding MPLS technologies as a common control component for supporting the various switching technologies called GMPLS. Also, IETF has standardized the signaling protocols based on such technologies, such as LDP, CR-LDP and RSVP-TE. ETRI developed the MPLS system based on ATM switch in order to provide more reliable services, differentiated services and value-added services like the VPN and traffic engineering service on the Korea Public Sector network. We are planning on deploying model services and commercial services on that network. This paper explains the basic functions of LDP, design and development of LDP on our system, and compares with LDP development and operation on other MPLS systems made by Cisco, Juniper, Nortel and Riverstone. In conclusion, this paper deduces the future services and applications by LDP through these explanation and comparison.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.163-165
• /
• 2001

본 논문에서는 먼저 Forwarding 방식의 라우팅 프로토콜인 MPLS(Multi-Protocol Label Switching)와 네트웍에서의 Traffic Engineering(TE)에 대한 개괄적인 설명과 함께, MPLS 네트웍 내에서의 트래픽 엔지니어링에 대해 기술한다. 그리고 MPLS 도메인 양 끝단에서 단일 경로의 패킷에 대한 MPLS 헤더의 레이블 번호를 이용한 동일한 패킷인지에 대한 확인 방안과 MPLS 도메인 내에서 Loss Detection 메커니즘을 이용한 효율적인 트래픽 엔지니어링방안을 제안한다. 향후 본 연구 방안을 적용하게 되면, 차등 서비스(Differentiated Services, Diffserv)를 제공하는 네트웍 환경의 핵심 망과 Mobile IP 기반의 무선 네트웍 환경에서 유선 네트웍의 Quality of Service(QoS)를 향상시킬 수 있을 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2286-2309
• /
• 2016

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.