• Title/Summary/Keyword: Internet topology model

Search Result 71, Processing Time 0.027 seconds

Jellyfish: A Conceptual Model for the AS Internet Topology

  • Siganos Georgos;Tauro Sudhir Leslie;Faloutsos Michalis
    • Journal of Communications and Networks
    • /
    • v.8 no.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.

Prediction of the Future Topology of Internet Reflecting Non-monotony (비단조 변화성을 이용한 인터넷의 미래 위상 예측)

  • 조인숙;이문호
    • Journal of Information Technology Applications and Management
    • /
    • v.11 no.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.

  • PDF

A Literature Survey of the Internet Topology Generation Models (인터넷 토폴로지 생성 모델에 관한 문헌조사 연구)

  • Lee, Kang Won;Kook, Kwang Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.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.

An Internet Topology Generator Applying DEVS Modeling (DEVS 모델링을 적용한 인터넷 위상 생성기)

  • Sohn Juhang;Park Sangjoon;Han Jungahn;Kim Hyungjong;;Kim Byunggi
    • Journal of the Korea Society for Simulation
    • /
    • v.13 no.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.

  • PDF

Network Topology Generation Algorithms Reflecting Internet Evolution (인터넷의 변화성을 고려한 네트워크 위상 생성 알고리즘)

  • 조인숙;김병기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10B
    • /
    • pp.938-946
    • /
    • 2003
  • 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. 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 the power-laws better than those generated by existing ones. These algorithms are also expected to be helpful in predicting future topologies of Internet.

Delivering IPTV Service over a Virtual Network: A Study on Virtual Network Topology

  • Song, Biao;Hassan, Mohammad Mehedi;Huh, Eui-Nam
    • Journal of Communications and Networks
    • /
    • v.14 no.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.

A study of Internet Topology Modeling Reflecting Evolution (변화성을 고려한 인터넷 위상 모델링에 관한 연구)

  • 조인숙;손주항;김병기
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2003.11a
    • /
    • 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.

  • PDF

Streaming of Solid Models Using Cellular Topology (셀룰러 토폴로지를 이용한 솔리드 모델 스트리밍)

  • Lee, Jae-Yeol;Kim, Hyun
    • IE interfaces
    • /
    • v.16 no.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.

Generation and Transmission of Progressive Solid Models U sing Cellular Topology (셀룰러 토폴로지를 이용한 프로그레시브 솔리드 모델 생성 및 전송)

  • Lee, J.Y.;Lee, J.H.;Kim, H.;Kim, H.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.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/.

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.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.