• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.602-611
• /
• 2011

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.343-351
• /
• 2004

Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidates for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.137-144
• /
• 2022

Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.23-26
• /
• 1998

IP multicasting efficiently delivers a single datagram to multiple hosts. Its benefits have been demonstrated over the past six years on MBONE. Now, as the number of subnets in the MBONE are increased, the MBONE can no longer be managed as a single, flat routing domain. Its routing scalability must be improved. In this paper, to solve problem of routing scalability, serveral new multicast models for the internet are explained.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.27-37
• /
• 2004

The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.240-244
• /
• 2022

The common goals of designing a routing algorithm are not only to reduce control packet overhead, maximize throughput and minimize the end-to-end delay, but also take into consideration the energy consumption. Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSN's). Three metrics (power consumption, time of transmission and packet loss rate) are used in order to compare three routing protocols which are AODV, DSDV and LEACH.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.822-825
• /
• 2007

현재 인터넷 아키텍처가 가지고 있는 가장 큰 문제는 routing과 addressing의 핵심으로 사용되는 IP 주소의 의미의 중복 (overloading semantics)이다. 즉 IP 주소는 라우팅을 위한 정보 (how), 단말의 위치 정보 (where), 그리고 이 외에 전송 계층 상위에서 사용되는 단말의 식별자 정보(who)로 사용되며, 이 의미 중복은 결국 global routing의 scalability문제를 발생시키게 된다. 즉 이러한 IP 주소의 의미 중복을 분리한다면 멀티호밍, Traffic engineering, 그리고 renumbering 등을 scalability에 영향을 주지 않고 이것들을 지원할 수 있게 되는 것이다. IETF는 이러한 라우팅과 어드레싱의 확장성 문제를 해결하기 위하여 68차 IETF 회의에서 ROAP (ROuing and Addressing Problem) BoF (Birds of a Feather) 회의를 공식적으로 개최 하였으며, 이를 통해 결정된 사항은 새로운 인터넷 아키텍처를 설계하기 위해 식별자(Identifier)와 위치정보(locator)를 분리하는 구조(ID/Loc 분리) 또는 다중 계층의 위치정보 획득이 가능한 구조(Multi-level locator design)로의 새로운 아키텍처를 만드는 것이다. 이 작업은 ROPA BoF회의 이후 IRTF의 RRG (Routing Research Group)에서 계속적으로 진행되고 있으며, 현재 관련 많은 솔루션들이 나온 상황이다. 본 논문은 이러한 ROAP에 관한 기본적인 설명과 함께, 문제점 그리고 논의되고 있는 솔루션들의 분류, 목적, 그리고 공통 이슈들에 대한 최근 동향을 설명한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.852-855
• /
• 2007

1990년대 인터넷의 폭발적인 확장은 인터넷의 심각한 scalability 문제를 야기 시켰다. 특히 BGP 테이블의 기하급수적인 성장세를 보였고, 이러한 확정성을 해결하기 위해 새로운 IP 프로토콜인 IP version 6(IPv6)를 표준화하였다. 그러나 IPv6는 실질적으로 인터넷의 scalability를 충분히 해결하지 못했으며, 특히 멀티호밍, Traffic Engineering, PI (Provider Independent) routing 정책들로 인해 다시 한 번 scalability 문제는 크게 이슈화 되었다. 따라서 현재 인터넷의 표준을 제정하는 IETF에서는 장기적인 안목으로 인터넷 아키텍처의 변경을 통해 자연스럽게 해결하려 하고 있다. 현재 인터넷 아키텍처가 가지고 있는 가장 큰 문제는 routing과 addressing의 핵심으로 사용되는 IP 주소의 의미의 중복 (overloading semantics)이며, 라우팅을 위한 정보 (how), 단말의 위치 정보(where), 그리고 이 외에 전송 계층 상위에서 사용되는 단말의 식별자 정보(who)로 사용되는 IP 주소의 의미 중복을 해결하면, 자연스럽게 scalability 문제를 해결함과 동시에 멀티호밍, Traffic engineering, renumbering, 그리고 이동성 지원 등을 지원할 수 있게 되는 것이다. 본 논문은 이와 같이 현재 인터넷이 가지고 있는 확장성 문제를 살펴보고, 이를 해결하기 위해 제시된 IP 주소에서 Identifier와 locator를 분리하는 기술들을 분석한다.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.378-390
• /
• 2006

Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.