• Title/Summary/Keyword: Internet topology

Search Result 283, Processing Time 0.028 seconds

S-FEAR: Secure-Fuzzy Energy Aware Routing Protocol for Wireless Sensor Networks

  • Almomani, Iman;Saadeh, Maha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1436-1457
    • /
    • 2018
  • Secure routing services in Wireless Sensor Networks (WSNs) are essential, especially in mission critical fields such as the military and in medical applications. Additionally, they play a vital role in the current and future Internet of Things (IoT) services. Lightness and efficiency of a routing protocol are not the only requirements that guarantee success; security assurance also needs to be enforced. This paper proposes a Secure-Fuzzy Energy Aware Routing Protocol (S-FEAR) for WSNs. S-FEAR applies a security model to an existing energy efficient FEAR protocol. As part of this research, the S-FEAR protocol has been analyzed in terms of the communication and processing costs associated with building and applying this model, regardless of the security techniques used. Moreover, the Qualnet network simulator was used to implement both FEAR and S-FEAR after carefully selecting the following security techniques to achieve both authentication and data integrity: the Cipher Block Chaining-Message Authentication Code (CBC-MAC) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The performance of both protocols was assessed in terms of complexity and energy consumption. The results reveal that achieving authentication and data integrity successfully excluded all attackers from the network topology regardless of the percentage of attackers. Consequently, the constructed topology is secure and thus, safe data transmission over the network is ensured. Simulation results show that using CBC-MAC for example, costs 0.00064% of network energy while ECDSA costs about 0.0091%. On the other hand, attacks cost the network about 4.7 times the cost of applying these techniques.

Distributed Virtual Topology Adaptation Method to Support IP Traffic in WDM Mesh Networks (WDM Mesh 네트워크에서 IP 트래픽을 수용하기 위한 분산형 가상토폴로지 적응 기법)

  • Kim, Eal-Lae;Lee, Sung-Kuen;Lee, Yong-Won;Chang, Sun-Hyok;Lee, Myung-Moon;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.1-10
    • /
    • 2007
  • We propose a new approach to accommodate bidirectional asymmetric traffic demands as well as unexpected dynamic internet traffic variation in the WDM mesh network by using optical networking technologies. In the proposed scheme, an intermediate node determines the optical path based on the switching statistics of IP router of the node which characterizes the Internet traffic variation, which in effect provides a dynamic and distributed traffic control over the network. It is expected to reduce the efficiency deterioration of RWA(Routing and Wavelength Assignment) due to the real-time variation of Internet traffic so that expandability and flexibility of the network can be enhanced. In this paper, we describe a methodology for traffic behavior analysis at a node, and the decision policy of the establishment/release of optical path. In addition, we evaluate the performance of the proposed scheme through the computer simulations.

An Impact of Addressing Schemes on Routing Scalability

  • Ma, Huaiyuan;Helvik, Bjarne E.;Wittner, Otto J.
    • 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.

An ICN In-Network Caching Policy for Butterfly Network in DCN

  • Jeon, Hongseok;Lee, Byungjoon;Song, Hoyoung;Kang, Moonsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1610-1623
    • /
    • 2013
  • In-network caching is a key component of information-centric networking (ICN) for reducing content download time, network traffic, and server workload. Data center network (DCN) is an ideal candidate for applying the ICN design principles. In this paper, we have evaluated the effectiveness of caching placement and replacement in DCN with butterfly-topology. We also suggest a new cache placement policy based on the number of routing nodes (i.e., hop counts) through which travels the content. With a probability inversely proportional to the hop counts, the caching placement policy makes each routing node to cache content chunks. Simulation results lead us to conclude (i) cache placement policy is more effective for cache performance than cache replacement, (ii) the suggested cache placement policy has better caching performance for butterfly-type DCNs than the traditional caching placement policies such as ALWASYS and FIX(P), and (iii) high cache hit ratio does not always imply low average hop counts.

Loadbalancing for WDM Network using Dynamic Watermarks (WDM 네트워크에서 동적 워터마크 결정을 이용한 로드벨런싱)

  • Nahm, Jung-Joo;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.2
    • /
    • pp.1-5
    • /
    • 2007
  • Wavelength-division multiplexed (WDM) networks are emerging to be the right choice for the future transport networks. In WDM networks, the optical layer provides circuit-switched lightpath services to the client layer such as IP, SONET and ATM. The set of lightpaths in the optical layer defines the virtual topology. Since the optical switches are reconfigurable, the virtual topology can be reconfigured in accordance with the changing traffic demand pattern at theclient layer in order to optimize the network performance. We present a new approach to the virtual topology reconfiguration and loadbalancing problem for wavelength-routed, optical wide-area networks under dynamic traffic demand. By utilizing the measured Internet backbone traffic characteristics, our approach follows the changes in traffic without assuming that the future traffic pattern is known. For the simulation traffic modeling, we collected the data from real backbone traffic. Experiments show that the standard deviation compared to previous technique is reduced.

A New framework for IP Traceback : Inference of Logical Topology by Measuring Packet Losses (IP 역추적을 위한 새로운 접근 : 패킷 손실 기반의 논리적 전송 경로 추정)

  • 이준엽;이승형;양훈기;고재영;강철오;정주영
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.39-47
    • /
    • 2002
  • This paper deals with study of a new framework for the traceback of distributed DoS(Denial of Service) attacks in the Internet, in which many sources flood "spoofed" IP packets towards a single victim. In our scheme, the destination host traces those anonymous packets' losses, and infers the logical end-to-end paths back towards the sources. This method is based on the fact that there is a strong correlation between packet losses when those packets traverse along a same route, and the simulation results show high probabilities of detecting the topology under a certain condition. Compared with previous approaches, our scheme has a number of distinct features: It can be performed in realtime or non-realtime, without any supports of routers or ISPs. Our results may be applied to the inference of physical topology and to support previous approaches.pproaches.

Analysis of Spare Capacity Ratio in Optical Internet using Cut-Set (광인터넷망에서 Cut-Set을 이용한 예비대역폭 비율 분석)

  • Kim, Taehyoun;Hwang, Hoyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.5
    • /
    • pp.197-203
    • /
    • 2012
  • This paper studies network recovery method using logical multiple ring architecture embedded in WDM optical Internet environment. The multiple ring-based recovery method provides fast and simple network restoration operation, and performs local recovery that is detouring the failed link. The multiple ring architecture can provide higher resource efficiency by sharing the backup routes and reducing the number of spare wavelengths. This paper calculates the required spare capacity ratio using Cut-Sets in the given network topology and performs simulation for comparative analysis.

A Dynamic Data Grid Replication Strategy Based on Internet Architecture (인터넷 구조 기반의 동적 데이터 그리드 복제 정책)

  • Kim, Jun-Sang;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.1-6
    • /
    • 2008
  • Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

Implementation of Policy Based Network Management System with COPS-PR for MANET (MANET에서 COPS-PR을 이용한 정책 기반 망 관리 시스템의 구현)

  • Huh, Jee-Wan;Lee, Sung-Hwa;Song, Wang-Cheol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.1-6
    • /
    • 2009
  • MANET(Mobile Ad-hoc NETwork), a network characterized that its moving nodes freely constructs Network topology, has other different characteristics. Because Policy based Network Management in MANET guarantees QoS between nodes, it is essential in applied areas like VANET which targets safety and convenience. In this paper, we use COPS-PR which is appropriate Policy Exchange Protocol for MANET, and implement DiffServ-based QoS in the real networks and experiment its capability.

  • PDF

The Design and Implementation of a Web-Based Authoring Tool for Cellular Phones (웹 기반 휴대폰용 홈페이지 저작도구 설계 및 구현)

  • 봉태구;박종태
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.105-108
    • /
    • 2000
  • The number of cellular phone users has exceeded over twenty million recently. Some researches show that people in the twenties to thirtieth usually regard the cellular as an instrument for not only call but also Internet. It means the cellular is being highlighted as a mediator for transmitting information. Therfore it'll play an essential role soon as a gateway for unifying wire and wireless services if we can browse Internet sites, for example our own homepage or commercial site, with the cellular. This paper explain WAP topology which enable the mobile terminal to access to the Web and show a method of designing and realizing WML document on the Web.

  • PDF