• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.312-313
• /
• 2003

최근 인터넷 트래픽의 증가와 음성, 데이터, 동영상과 같은 다양한 멀티미디어 서비스의 영향으로 가입자망의 고속화가 요구되고 있다. 인터넷 트래픽을 효율적으로 가입자에게 제공하기 위해서는 광을 이용한 통신이 이루어져야 한다. 이를 위하여 다양한 기술들이 제시되고 있으며, 경제적인 측면과 구성의 용이성을 고려한 광 가입자망인 PON(Passive Optical Network)에 대한 관심이 고조되고 있다. 본 논문에서는 파장 분할 다중화 방식으로 단심 상하향 동일파장을 사용하여 소요되는 광섬유의 비용을 반으로 줄이고, 채널당 전송용량을 두 배로 높일 수 있는 매트로 이더넷용 단심 양방향 버스형 WDM-EPON 시스템에 대한 연구를 하고자 한다. (중략)

• Electronics and Telecommunications Trends
• /
• v.17 no.4 s.76
• /
• pp.16-28
• /
• 2002

전세계적인 경기 침체에도 불구하고 벤처 캐피탈로부터 수억 달러의 투자 자금을 끌어 모아 2001년 한해 큰 주목을 받았던 메트로 이더넷 서비스 사업자들이 최근 주춤하고 있다. 메트로 이더넷 서비스 시장의 선두 주자였던 Yipes Communications가 2002년 3월 추가적인 투자 자금 모집 실패 및 재무 유동성 악화로 인하여 미국 법원에 파산 보호를 신청한 것을 비롯해, 이보다 앞서 또 다른 메트로 이더넷 서비스 사업자인 Sigma Networks도 불과 창업 1년 만에 문을 닫고 말았기 때문이다. 이로 인해 일각에서는 이제 메트로 이더넷 서비스 비즈니스 모델을 다시 제고해야 할 시점이라면서, 메트로 이더넷 서비스 사업자들도 결국 과거 CLEC들과 같은 전철을 밟게 되지는 않을까 우려하는 목소리가 높다. 이에 본 고에서는 메트로 이더넷 서비스 비즈니스 모델을 현재 시점에서 재조명하고, 최근 시장 현황 그리고 앞으로의 발전 전망에 대하여 간략하게 살펴보았다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.461-471
• /
• 2004

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Motto-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.