• Journal of Communications and Networks
• /
• 제8권3호
• /
• pp.339-350
• /
• 2006

Several novel concepts and tools have revolutionized our understanding of the Internet topology. Most of the existing efforts attempt to develop accurate analytical models. In this paper, our goal is to develop an effective conceptual model: A model that can be easily drawn by hand, while at the same time, it captures significant macroscopic properties. We build the foundation for our model with two thrusts: a) We identify new topological properties and b) we provide metrics to quantify the topological importance of a node. We propose the jellyfish as a model for the inter-domain Internet topology. We show that our model captures and represents the most significant topological properties. Furthermore, we observe that the jellyfish has lasting value: It describes the topology for more than six years.

• Journal of Information Technology Applications and Management
• /
• 제11권2호
• /
• pp.205-214
• /
• 2004

Internet evolves into the huge network with new nodes inserted or deleted depending on specific situations. A new model of network topology is needed in order to analyze time-varying Internet more realistically and effectively. In this study the non-monotony models are proposed which can describe topological changes of Internet such as node insertion and deletion, and can be used for predicting its future topology. Simulation is performed to analyze the topology generated by our model. Simulation results show that our proposed model conform the power law of realistic Internet better than conventional ones. The non-monotony model can be utilized for designing Internet protocols and networks with better security.

• 대한산업공학회지
• /
• 제33권1호
• /
• pp.138-152
• /
• 2007

There has been much effort to improve the accuracy of the Internet topology model and include its quantitativeand/or qualitative effects on studies of a variety of network problems. Such improvement is the primarymotivation of this paper in listing and classifying the body of literature addressing the Internet topology. Themetrics, which characterize the fundamental properties of the Internet, are also divided into five categories andtheir importance and applications are discussed. Finally, we suggest several future research topics for theInternet topology models to be more realistic and applicable.

• 한국시뮬레이션학회논문지
• /
• 제13권3호
• /
• pp.43-54
• /
• 2004

Studies of Internet algorithms or policies require experiments on the real large-scale networks. But practical problems with large real networks make them difficult. Instead many researchers use simulations on the Internet topology models. So, It is Important that study about topology model that reflect characteristic of the internet exactly. We propose new topology model which reflect of hierarchical network and addition, removal of nodes and accompanied change of topologies. In the modeling scheme for network generation, we applied DEVS formalism and analyzed the topologies generated by our algorithms.

• 한국통신학회논문지
• /
• 제28권10B호
• /
• pp.938-946
• /
• 2003

인터넷에 관련된 알고리즘이나 정책에 관한 연구는 대형 네트워크 상에서 실험을 해야 하지만 현실적인 어려움 때문에 네트워크 위상 모델을 많이 사용하고 있다. 이런 면에서 정확하게 인터넷의 특성을 반영하는 네트워크 위상 모델에 대한 연구는 매우 중요하다. 이러한 위상 모델을 생성하는 방법에 관한 기존 연구는 인터넷의 특성을 파악하고 이를 잘 반영하기 위한 여러 가지 방법을 제안하고 있다. 그러나 인터넷이 시간에 따라 변화하는 특성에 대해서는 충분히 연구가 이루어지지 않고 있다. 따라서 본 논문에서는 시간이 경과함에 따라 노드가 생성되고 소멸되며 이에 따라 위상이 변화하는 현상을 모델링하기 위한 알고리즘들을 제안한다. 제안된 알고리즘에 의해 생성된 위상을 분석한 결과 기존 방식에 비해 power-law를 더 잘 만족함을 확인하였다. 이 알고리즘은 미래의 인터넷 위상을 예측하는데 도움이 될 것으로 생각된다.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 추계학술대회 및 정기총회
• /
• pp.113-117
• /
• 2003

Studies of Internet algorithms or policies require experiments on the real large-scalenetworks. But practical problems with large real networks make them difficult Instead many researchers use simulations on the Internet topology models. Some tried to find out abstract topological properties of Internet. And several models are proposed to reflect Internet's topological characteristics better. But few studies have been performed on how to model the evolution of Internet. We propose algorithms for modeling addition and removal of nodes and accompanied change of topologies. We analyze the topologies generated by our algorithms to observe that they obey power-laws better than those generated by existing ones. These algorithms are also expected to be helpful in predicting future topologies of Internet.

• 산업공학
• /
• 제16권spc호
• /
• pp.87-92
• /
• 2003

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size.

• 한국CDE학회논문집
• /
• 제9권2호
• /
• pp.122-132
• /
• 2004

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size. Thus, an arbitrary solid model SM designed by a set of design features is stored as a much coarser solid model SM/sup 0/ together with a sequence of n detail records that indicate how to incrementally refine SM/sup 0/ exactly back into the original solid model SM = SM/sup 0/.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2473-2489
• /
• 2022

Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.