• Title/Summary/Keyword: Internet Topology

Search Result 282, Processing Time 0.023 seconds

Study on the Embedded SPC System Bused on LAN

  • Yin, Jianjun;Yu, Zhonghua;Wu, Zhaotong
    • International Journal of Quality Innovation
    • /
    • v.4 no.1
    • /
    • pp.205-212
    • /
    • 2003
  • Statistical Process Control (SPC) is recognized as one of the most important tool of quality control (QC), and is one research focus in order to implement SPC quickly and effectively using computer technology and network environments. This paper proposes the principle and topology of embedded SPC based on the Internet/lntranet, emphatically discusses the embedded data sampling block, embedded network interface and SPC strategy. An example of application is given.

On Inferring and Characterizing Internet Routing Policies

  • Wang, Feng;Gao, Lixin
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.350-355
    • /
    • 2007
  • Border gateway protocol allows autonomous systems(ASes) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASes. Although a significant number of studies have been focused on the Internet topology, little is known about what routing policies network operators employ to configure their networks. In this paper, we infer and characterize routing policies employed in the Internet. We find that routes learned from customers are preferred over those from peers and providers, and those from peers are typically preferred over those from providers. We present an algorithm for inferring and characterizing export policies. We show that ASes announce their prefixes to a selected subset of providers to perform traffic engineering for incoming traffic. We find that the selective announcement routing policies imply that there are much less available paths in the Internet than shown in the AS connectivity graph, and can make the Internet extremely sensitive to failure events. We hope that our findings will help network operators in designing routing policies.

Assessing Resilience of Inter-Domain Routing System under Regional Failures

  • Liu, Yujing;Peng, Wei;Su, Jinshu;Wang, Zhilin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1630-1642
    • /
    • 2016
  • Inter-domain routing is the most critical function of the Internet. The routing system is a logical network relying on the physical infrastructure with geographical characteristics. Nature disasters or disruptive accidents such as earthquakes, cable cuts and power outages could cause regional failures which fail down geographically co-located network nodes and links, therefore, affect the resilience of inter-domain routing system. This paper presents a model for regional failures in inter-domain routing system called REFER for the first time. Based on REFER, the resilience of the inter-domain routing system could be evaluated on a finer level of the Internet, considering different routing policies of intra-domain and inter-domain routing systems. Under this model, we perform simulations on an empirical topology of the Internet with geographical characteristics to simulate a regional failure locating at a city with important IXP (Internet eXchange Point). Results indicate that the Internet is robust under a city-level regional failure. The reachability is almost the same after the failure, and the reroutings occur at the edge of the Internet, hardly affecting the core of inter-domain routing system.

CLASSIFICATION OF SPACES IN TERMS OF BOTH A DIGITIZATION AND A MARCUS WYSE TOPOLOGICAL STRUCTURE

  • Han, Sang-Eon;Chun, Woo-Jik
    • Honam Mathematical Journal
    • /
    • v.33 no.4
    • /
    • pp.575-589
    • /
    • 2011
  • In order to examine the possibility of some topological structures into the fields of network science, telecommunications related to the future internet and a digitization, the paper studies the Marcus Wyse topological structure. Further, this paper develops the notions of lattice based Marcus Wyse continuity and lattice based Marcus Wyse homeomorphism which can be used for studying spaces $X{\subset}R^2$ in the Marcus Wyse topological approach. By using these two notions, we can study and classify lattice based simple closed Marcus Wyse curves.

Differentiated Quality of Service Model in the Internet (인터넷에서의 차별화된 서비스품질 제공 방안)

  • Kim, Dong-Chul;Jang, Hee-Seon
    • IE interfaces
    • /
    • v.23 no.2
    • /
    • pp.193-202
    • /
    • 2010
  • The quality of service(QoS) model should be presented with the optimal network design to effectively provide the multimedia data services between users and converged services with mobile or TV in the next-generation Internet. In specific, the method to provide differentiated services for each user is needed in the given Internet node to offer the previously negotiated QoS with the user. In this paper, the performance of the QoS enabling technologies in the differentiated services(DiffServ) network domain is analyzed. The QoS offering model and QoS metrics are presented to analyze the performance of the major scheduling algorithms. Under the real network topology and virtual service scenarios in the university, the NS-2 network simulation based on the discrete-event is performed. The results show that the ratio-based scheduling method is more effective rather than the bandwidth-assignment method.

Connectivity properties of real BitTorrent swarms

  • Ruben, Cuevas;Michal, Kryczka;Angel, Cuevas;Carmen, Guerrero;Arturo, Azcorra
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2246-2267
    • /
    • 2013
  • BitTorrent is one of the most important applications in the current Internet. Despite of its interest, we still have little knowledge regarding the connectivity properties of real BitTorrent swarms. In this paper we leverage a dataset including the connectivity information of 250 real torrents and more than 150k peers to carefully study the connectivity properties of peers. The main topology parameters of the studied swarms suggest that they are significantly less resilient than random graphs. The analysis of the peer level connectivity properties reveals that peers continuously change more than half of their neighbours. Furthermore, we also find that a leecher typically keeps stable connections with a handful of neighbours with which it exchanges most of its traffic whereas seeders do not establish long-term connections with any peer so that they can homogeneously distribute chunks among leechers. Finally, we have discovered that a significant portion of the studied peers (45%) have an important locality-biased neighbourhood composition.

Reaching Byzantine Agreement underlying VANET

  • Wang, Shu-Ching;Lin, Ya-Jung;Yan, Kuo-Qin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3351-3368
    • /
    • 2019
  • The Internet of Things (IoT) enables machines and devices in a global network to connect and provide applications. The Vehicular Ad-hoc NETwork (VANET) allows vehicles in the network to communicate with each other as an application of the IoT. The safety and comfort of passengers can be improved through VANET related applications. In order to be able to provide related applications, there must be a reliable VANET topology. As a result of the Byzantine agreement (BA), fault tolerance can be solved in VANET. In order to improve the reliability of the system, even if some components in the system are damaged, a protocol is needed to assist the system to perform normally. Therefore, the BA problem in VANET with multiple impairments is revisited in this research. The proposed protocol allows all normal processing elements (PEs) to reach agreement using the least amount of information exchange. Moreover, the proposed protocol can tolerate the largest number of damaged PEs in VANET.

Design of a Fault-Tolerant Routing Protocol for USN (USN을 위한 결함허용 라우팅 프로토콜의 설계)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.51-57
    • /
    • 2009
  • Ubiquitous sensor network is the communication environment where sensor nodes move freely and construct network to get the services from the system. So, it does not need fixed infrastructure and can easily be placed in unaccessible regions like war or calamity area. Wireless sensor network protocol has self-organizing capability, need to adapt topology change flexibly and also has technique that sensor nodes work cooperatively, because network disconnection is frequently occurred due to the active mobility of sensor nodes. In this paper, we design a cluster based fault-tolerant routing protocol for the efficient topology construction and to guarantee stable data transmission in USN. The performance of the proposed protocol is evaluated by an analytic model.

  • PDF

A Hierarchical Model for Mobile Ad Hoc Network Performability Assessment

  • Zhang, Shuo;Huang, Ning;Sun, Xiaolei;Zhang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3602-3620
    • /
    • 2016
  • Dynamic topology is one of the main influence factors on network performability. However, it was always ignored by the traditional network performability assessment methods when analyzing large-scale mobile ad hoc networks (MANETs) because of the state explosion problem. In this paper, we address this problem from the perspective of complex network. A two-layer hierarchical modeling approach is proposed for MANETs performability assessment, which can take both the dynamic topology and multi-state nodes into consideration. The lower level is described by Markov reward chains (MRC) to capture the multiple states of the nodes. The upper level is modeled as a small-world network to capture the characteristic path length based on different mobility and propagation models. The hierarchical model can promote the MRC of nodes into a state matrix of the whole network, which can avoid the state explosion in large-scale networks assessment from the perspective of complex network. Through the contrast experiments with OPNET simulation based on specific cases, the method proposed in this paper shows satisfactory performance on accuracy and efficiency.

Clustering Routing Algorithms In Wireless Sensor Networks: An Overview

  • Liu, Xuxun;Shi, Jinglun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1735-1755
    • /
    • 2012
  • Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.