• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.12-21
• /
• 2000

Arrangement graph has desirable properties for design requirements of a multihop lightwave network, such as node and edge symmetry, low diameter, simple routing, etc. In this paper, arrangement lightwave network based on arrangement graph model is proposed as new logical topology of multihop lightwave network. In the proposed scheme, multistar and grouping of network are used for improving reusability of wavelength and scalability. Also, this paper shows that the proposed scheme is an alternative logical topology for application requiring more nodes with limited wavelengths by evaluating performance with related works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.41-49
• /
• 2010

Faloustsos et al.[1,2] showed successfully that the power-laws describe the heavy-tailed distributions of the AS level Internet topology properties such as node degree. This result allows us to represent the characteristics of AS-level Internet topology using some power-law exponents with elegant and simple. In this paper, we obtained the power-law exponents of the domestic AS-level Internet topology properties - the node degree, the number of pairs within hops, and eigenvalues of the graph - based on the valley-free BGP routing policy. We used the real data sets from UCLA IRL laboratory, and showed that these power-laws fit the real data pretty well resulting in correlation coefficient of 90.7%, 96.5%, and 97%, respectively. In particular, rounding the effective diameter to three, approximately 91% of the pairs of nodes are within this distance; that is, we might conclude our topology is pretty well organized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1009-1012
• /
• 1998

An efficient algorithm for clock skew optimization is proposed in this paper. It construct a new clock routing topology which is the generalized graph model while previous methods uses tree-structured routing topology. Edge-insertion technique is used in order to reduce the clock skew. A link-edge is inserted repeatedly between two sinks whose delay difference is large and the distance is small. As a result, the delay of a sink which has the longer delay is decreased and the clock skew is reduced. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the total wire length minimization under the given skew bound.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1479-1503
• /
• 2007

In this paper, we study a strong k-deformation retract derived from a relative k-homotopy and investigate its properties in relation to both a k-homotopic thinning and the k-fundamental group. Moreover, we show that the k-fundamental group of a wedge product of closed k-curves not k-contractible is a free group by the use of some properties of both a strong k-deformation retract and a digital covering. Finally, we write an algorithm for calculating the k-fundamental group of a dosed k-curve by the use of a k-homotopic thinning.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.27-34
• /
• 2008

In this paper, We propose a new parallel computer topology, called the Postorder Fibonacci Circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes is kept the same of comparable one. Its diameter is improved from n-2 to $[\frac{n}{3}]$ and its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning graph.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.232-235
• /
• 2006

일반적으로 선형 토폴로지 (chain topology) 무선메쉬네트워크의 종단간 최대 전송률은 경쟁관계 그래프 (contention graph)에 기반하여 트래픽 병목 구간의 노드 개수와 1 홉 링크의 평균 전송률을 결정하여 계산하는 방식이 널리 이용된다. 본 논문은 평균을 이용한 방법은 IEEE 802.11 DCF (Distributed Coordination Function)를 MAC 프로토콜로서 사용하는 무선메쉬네트워크에서 정확성에 한계가 있음을 보이며, 이와 같은 정확성의 한계를 유도하는 인자로서 전송률의 편차를 소개한다. 또한 전송률 편차를 고려하여, 단일 선형 토폴로지에서 종단간 최대 전송률을 구하는 방법을 ns2 시뮬레이션을 통해 검증한다.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.602-608
• /
• 2015

In this paper, the limited error tracking problem is investigated for distributed leader-following wireless sensor networks (LFWSNs), where all sensors share data by the local communications, follower sensors are influenced by leader sensors directly or indirectly, but not vice versa, all sensor nodes track a reference state that is determined by the states of all leader sensors, and tracking errors are limited. In a LFWSN, the communicating graph is mainly expressed by some complete subgraphs; if we fix subgraphs that are composed of all leaders while all nodes in complete subgraphs of followers run on the sleeping-awaking method, then the fixed leaders and varying followers topology is obtained, and the switching topology is expressed by a Markov chain. It is supposed that the measurements of all sensors are corrupted by additive noises. Accordingly, the limited error tracking protocol is proposed. Based on the theory of asymptotic boundedness in mean square, it is shown that LFWSN keeps the limited error tracking under the designed protocol.