• 제목/요약/키워드: Traffic core

Search Result 285, Processing Time 0.073 seconds

An Anycast Routing Algorithm by Estimating Traffic Conditions of Multimedia Sources

  • Park, Won-Hyuck;Shin, Hye-Jin;Lee, Tae-Seung;Kim, Jung-Sun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.213-215
    • /
    • 2003
  • Multimedia has to carry data of heterogeous types. Multicast communication techniques can supply the most appropriate infrastructures to such multimedia. Of many multicast protocols, the core based tree (CBT) protocol is the most concentrative studies are conducted on. The CBT places a core router at center of the shared tree and transfers data through the tore router. However, the CBT has two problems due to centralizing all network traffics into a core router. First it can raise bottleneck effect at a core router. Second, it is possible to make an additive processing overhead when core router is distant from receivers. To cope with the problems, this paper proposes an intelligent anycast routing protocol. The anycast routing attempts to distribute the centralized traffic into plural core routers by using a knowledge-based algorithm. The anycast routing estimates the traffic characteristics of multimedia data far each multicast source, and achieves effectively the distributing that places an appropriate core router to process the incoming traffic based on the traffic information in the event that request of receivers are raised. This method prevent the additional overhead to distribute traffic because an individual core router uses the information estimated to multicast sources connected to oneself and the traffic processing statistics shared with other core neuters.

  • PDF

Traffic Engineering and Manageability for Multicast Traffic in Hybrid SDN

  • Ren, Cheng;Wang, Sheng;Ren, Jing;Wang, Xiong
    • 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.

Welcome the Challenges and Imaging the Sky Town

  • Cheng, Jiang Huan
    • International Journal of High-Rise Buildings
    • /
    • v.6 no.3
    • /
    • pp.271-277
    • /
    • 2017
  • Safety, livability, and efficiency are the three prominent problems of tall buildings, which are also the severe challenges to designers. We proposed the idea of building the sky town to solve these problems, which can be summarized in two sentences, one is tall building multi-storised, and another one is vertical facilities municipal-infrastructurised. The tall building can be horizontally cut into several multi-storey buildings by some large platforms. The platform extends a certain width to block the fire from spreading. Tall buildings are connected together as a group. One of them is a traffic core, which is used for vertical transportation and MEP. It connects to traffic center such as metro, while most of the other tall buildings' cores can be very much released, so as to achieve maximum efficiency of floor usable area and to give good traffic organization. By combining traffic core, platforms, and multi-storey buildings' inner traffic, a transportation network is formed. Finally, we refer to the design of Raffles City Chongqing to make a sketch of sky town.

Multicast Routing Strategy Based on Game Traffic Overload (게임 트래픽 부하에 따른 멀티캐스트 라우팅 전략)

  • Lee Chang-Jo;Lee Kwang-Jae
    • Journal of Game and Entertainment
    • /
    • v.2 no.1
    • /
    • pp.8-16
    • /
    • 2006
  • The development of multicast communication services in the Internet is expected to lead a stable packet transfer even though On-Line Games generate heavy traffic. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibits two major deficiencies traffic concentration or poor core placement problem. Thus, measuring the bottleneck link bandwidth along a path is important to understand the performance of multicast. We propose a method in which the core router's state is classified into SS(Steady State), NS(Normal State) and BS(Bottleneck State) according to the estimated link speed rate, and also the changeover of multicast routing scheme for traffic overload. In addition, we introduce Anycast routing tree, an efficient architecture for constructing shard multicast trees.

  • PDF

Traffic Engineering Based on Local States in Internet Protocol-Based Radio Access Networks

  • Barlow David A.;Vassiliou Vasos;Krasser Sven;Owen Henry L.;Grimminger Jochen;Huth Hans-Peter;Sokol Joachim
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.377-384
    • /
    • 2005
  • The purpose of this research is to develop and evaluate a traffic engineering architecture that uses local state information. This architecture is applied to an Internet protocol radio access network (RAN) that uses multi-protocol label switching (MPLS) and differentiated services to support mobile hosts. We assume mobility support is provided by a protocol such as the hierarchical mobile Internet protocol. The traffic engineering architecture is router based-meaning that routers on the edges of the network make the decisions onto which paths to place admitted traffic. We propose an algorithm that supports the architecture and uses local network state in order to function. The goal of the architecture is to provide an inexpensive and fast method to reduce network congestion while increasing the quality of service (QoS) level when compared to traditional routing and traffic engineering techniques. We use a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm. We use the network simulator ns-2 as the core of our simulation environment. Around this core we built a system of pre-simulation, during simulation, and post-processing software that enabled us to simulate our traffic engineering architecture with only very minimal changes to the core ns-2 software. Our simulation environment supports a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm.

Performance Evaluation of Signaling and Data Traffic in UMTS Packet Core Networks (UMTS 패킷 코아 망에서 신호 및 데이터 트래픽 성능 분석)

  • Kim, Byung-Chul;Lee, Jae-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.4
    • /
    • pp.25-34
    • /
    • 2004
  • UMTS network, evolved from GSM, includes packet core network that consists of SGSNS and GGSNs. Service providers should consider subscriber mobility, location registration, and subscriber distribution when designing packet core networks and network elements. Since one of the major traffic sources for IMT-2000 will be data which has bursty characteristics, new design guidelines for dimensioning of SGSN and GGSN should be proposed under various constraints of system parameters. In this paper, we first evaluate the performance of signaling traffic for packet call subscribers. After that, we also obtain the impact of bursty data traffic on the SGSN and GGSN by simulation, and suggest new dimensioning guidelines for packet core network of UMTS under various environments.

Determination of Multicast Routing Scheme for Traffic Overload in On-Line Game (온라인 게임에서 트래픽 부하 상태에 따른 멀티캐스트 라우팅 방식의 결정)

  • Lee, Kwang-Jae;Doo, Gil-Soo;Seol, Nam-O
    • Journal of Korea Game Society
    • /
    • v.2 no.1
    • /
    • pp.30-35
    • /
    • 2002
  • The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

  • PDF

Determination of Multicast Routing Scheme for Traffic Overload in network system (네트워크 시스템에서 트래픽 부하에 따른 멀티캣트 라우팅 방식)

  • Seul, Nam-O
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2936-2938
    • /
    • 2005
  • The deployment of multicast communication services in the internet is expected to lead a stable packet transfer even in heavy traffic as in network system environment. The core based tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. so, measuring the bottleneck link bandwidth along a path is important for understanding th performance of multicast. We propose not only a definition of CBT's core link state that Steady-State, Normal-State and Bottleneck State according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construst shard multicast trees.

  • PDF

High Performance QoS Traffic Transmission Scheme for Real-Time Multimedia Services in Wireless Networks

  • Kang, Moonsik
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.3
    • /
    • pp.182-191
    • /
    • 2012
  • This paper proposes a high performance QoS (Quality of Service) traffic transmission scheme to provide real-time multimedia services in wireless networks. This scheme is based on both a traffic estimation of the mean rate and a header compression method by dividing this network model into two parts, core RTP/UDP/IP network and wireless access parts, using the IEEE 802.11 WLAN. The improvement achieved by the scheme means that it can be designed to include a means of provisioning the high performance QoS strategy according to the requirements of each particular traffic flow by adapting the header compression for real-time multimedia data. A performance evaluation was carried out to show the effectiveness of the proposed traffic transmission scheme.

  • PDF

Congestion Control of CBT Multicast Routing Mechanism with load balancing methods (로드 밸런싱을 이용한 CBT 멀티캐스트 라우팅 프로토콜의 혼잡제어기법)

  • Yoe, Hyun;So, Sun-Hwe;Lee, Yoon-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.6
    • /
    • pp.1083-1088
    • /
    • 2001
  • In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

  • PDF