A New Scalable Topology for Multihop Optical Networks
TL;DR: The proposed topology adds the advantage of scalability over those in de-Bruijn graph, keeping perturbation in the network to a very low level during insertion of nodes, at the cost of marginal variance in degree of the network.
Abstract: A new scalable logical topology for multihop optical networks has been presented in this paper based on de-Bruijn graph. The de-Bruijn graph having simple routing property is a regular non-scalable logical topology having diameter to be of logarithmic value of number of nodes. The proposed topology adds the advantage of scalability over those in de-Bruijn graph, keeping perturbation in the network to a very low level during insertion of nodes, at the cost of marginal variance in degree of the network.
Citations
More filters
22 Mar 2013
TL;DR: This paper proposes a methodology that involves the Pascal Graph Topology for wireless sensor network which can analyse and represent the network and help in routing and discusses various existing WSN routing protocols and proposes a new WSN energy efficient routing protocol.
Abstract: Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays main area of interest amongst researchers. This research is an effort in designing energy efficient Wireless Sensor Network (WSN) routing protocol under certain parameters consideration. Research report discusses various existing WSN routing protocols and propose a new WSN energy efficient routing protocol. Results show a significant improvement in life cycle of the nodes and enhancement in energy efficiency of WSN. In this paper, an attempt has been made to design a wireless sensor network involving the extraction of Pascal Graph features. The standard task involves designing a suitable topology using Pascal Graph. As per the definition of interconnection network it is equivalent that a suitable graph can represent the different computer network topologies very efficiently. Different characteristics of Pascal Graph Topology has been discovered and used in network topology design. Since Pascal Graph gives better result in terms of finding the dependable and reliable nodes in topology, it has been considered for network analysis. Moreover, we propose a methodology that involves the Pascal Graph Topology for wireless sensor network which can analyse and represent the network and help in routing.
8 citations
Cites background from "A New Scalable Topology for Multiho..."
...Wide varieties of graph model worked as resource to their brainstorming contribution in this field [39]....
[...]
...For reliability or security considerations, some networks may be required to provide more than one distinct path for each node pair, there by resulting in a minimum degree of connectivity between the nodes [39]....
[...]
04 Dec 2009
TL;DR: Comparisons show that the proposed polynomial time routing algorithm for reducing congestion in WDM networks based on unidirectional de Bruijn graphs is the best amongst the three both in the presence and absence of node faults.
Abstract: In this paper the problem of reducing congestion in WDM networks based on unidirectional de Bruijn graphs has been addressed in the presence of node faults. We propose a polynomial time routing algorithm for reducing congestion and analyze its time complexity. Congestion is defined as the maximum of the number of lightpaths propagating through a link over all links in the network. Congestion optimization is important as it leads to optimization of the load λ max an important parameter of a lightpath request. Results of the algorithm are shown for de Bruijn networks with various sizes of lightpath requests both in the presence and absence of node faults. Finally we evaluate the performance of the algorithm by comparing the results with those from two other strategies, the greedy routing algorithm and the graph search routing algorithm. Comparisons show that the proposed routing algorithm is the best amongst the three both in the presence and absence of node faults.
5 citations
26 Jun 2011
TL;DR: A new Mobile Agent Based Intrusion Detection System (IDS) that uses a set of Mobile Agent that can move from one node to another node within a network and reduces network bandwidth consumption by moving the computation for data analysis to the location of the intrusion.
Abstract: Mobile Adhoc Network (MANET) is highly vulnerable to malicious attacks due to infrastructure less network environment, be deficient in centralized authorization. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibit is selfishness. Routing protocol plays a crucial role for effective communication between mobile nodes and operates on the basic assumption that nodes are fully cooperative. Because of open structure and limited battery-based energy some nodes (i.e. selfish or malicious) may not cooperate correctly. There can be two types of selfish attacks –selfish node attack (saving own resources) and sleep deprivation (exhaust others’ resources. In this paper, we propose a new Mobile Agent Based Intrusion Detection System (IDS). The approach uses a set of Mobile Agent (MA) that can move from one node to another node within a network. This as a whole reduces network bandwidth consumption by moving the computation for data analysis to the location of the intrusion. Besides, it has been established that the proposed method also decreases the computation overhead in each node in the network.
5 citations
28 Oct 2002
TL;DR: In this paper, the authors considered the problem of designing the logical topology for any wavelength routed optical network, given the traffic matrix, and proposed a heuristic algorithm for designing topologies based on the De-Bruijn graph.
Abstract: This paper considers the problem of designing the logical topology for any wavelength routed optical network, given the traffic matrix An heuristic algorithm is proposed here for designing topologies based on the De-Bruijn graph and we compare our results with those obtained through the deterministic approach The De-Bruijn graph is selected in this context as the logical topology due to some of its characteristic features like simple routing scheme, low diameter and small degree
4 citations
TL;DR: This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results show its credentials over so many other topologies.
Abstract: Constantly growing demands of high productivity and security of computer systems and computer networks call the interest of specialists in the environment of construction of optimum topologies of computer mediums. In earliest phases of design, the study of the topological influence of the processes that happen in computer systems and computer networks allows to obtain useful information which possesses a significant value in the subsequent design. It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.
4 citations
Cites background from "A New Scalable Topology for Multiho..."
..." # # Pascal Triangle, Pascal Graph, Pascal Matrix, Adjacency Matrix, Dependable Node of Pascal Graph(DNPG), Computer Network Topology....
[...]
References
More filters
TL;DR: The authors derive an upper bound on the carried traffic of connections for any routing and wavelength assignment (RWA) algorithm in a reconfigurable optical network and quantifies the amount of wavelength reuse achievable in large networks as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks.
Abstract: Considers routing connections in a reconfigurable optical network using WDM. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. The authors derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network. The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm. The bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size. The authors illustrate this by comparing the performance of a simple shortest-path RWA (SP-RWA) algorithm via simulation relative to the bound. They also derive a similar bound for optical networks using dynamic wavelength converters, which are equivalent to circuit-switched telephone networks, and compare the two cases. Finally, they quantify the amount of wavelength reuse achievable in large networks using the SP-RWA via simulation as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks. They also quantify the difference in wavelength reuse between two different optical node architectures. >
1,046 citations
"A New Scalable Topology for Multiho..." refers background in this paper
...... by u->v) representing a lightpath from node u to node v. The desirable criterion of this graph is (I) small nodal degree for low cost (ii) simple routing scheme for avoiding the need of complex routing tables (iii) small diameter for faster communication (iv) growth capability with least possible perturbation in the network . The de Bruijn graph being a regular topology and having a structured node-connectivity have simpler routing [ 4 ] ......
[...]
Book•
01 Jan 1997TL;DR: A comprehensive explanation of the newest developments in optical networks in the MCGRAW-HILL COMPUTER COMMUNICATIONS series.
Abstract: A comprehensive explanation of the newest developments in optical networks in the MCGRAW-HILL COMPUTER COMMUNICATIONS series. Case studies and research projects at AT&T, Fujitsu, and NTT are considered in order to provide the reader with hands-on information which can be applied in practice.
852 citations
TL;DR: A survey of wavelength-division-multiplexing (WDM)-based local lightwave networks is presented, and regular topologies that have been studied as candidates for multihop light wave networks, including the perfect shuffle, the de Bruijn graph, the toroid, and the hypercube are discussed.
Abstract: For pt.I see ibid., vol.6, no.3, p.12-27, 1992. A survey of wavelength-division-multiplexing (WDM)-based local lightwave networks is presented. The general characteristics of multihop systems are discussed, and various multihop approaches are reviewed. The construction of optimal structures based on minimizing the maximum link flow and optimizations based on minimization of the mean network packet delay are also reviewed. Regular topologies that have been studied as candidates for multihop lightwave networks, including the perfect shuffle, the de Bruijn graph, the toroid, and the hypercube, are discussed. Near-optimal node placement algorithms and shared-channel multihop systems are also discussed. >
496 citations
TL;DR: In this paper, the authors explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage, and formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the networkwide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands).
Abstract: We explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage. This optical network exploits wavelength multiplexers and optical switches in routing nodes, so that an arbitrary virtual topology may be embedded on a given physical fiber network. The virtual topology, which is used as a packet-switched network and which consists of a set of all-optical "lightpaths", is set up to exploit the relative strengths of both optics and electronics-viz. packets of information are carried by the virtual topology "as far as possible" in the optical domain, but packet forwarding from lightpath to lightpath is performed via electronic switching, whenever required. We formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the network-wide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands). Since simpler versions of this problem have been shown to be NP-hard, we resort to heuristic approaches. Specifically, we employ an iterative approach which combines "simulated annealing" (to search for a good virtual topology) and "flow deviation" (to optimally route the traffic-and possibly bifurcate its components-on the virtual topology). We do not consider the number of available wavelengths to be a constraint, i.e., we ignore the routing of lightpaths and wavelength assignment for these lightpaths. We illustrate our approaches by employing experimental traffic statistics collected from NSFNET.
476 citations
TL;DR: In this article, an architectural approach for very high-capacity wide-area optical networks is presented, and a proposed program of research to address key system and device issues is described, where a distributed optical interconnect that is wavelength-selective and electronically controllable, permitting the same limited set of wavelengths to be reused among other access stations, is employed.
Abstract: An architectural approach for very-high-capacity wide-area optical networks is presented, and a proposed program of research to address key system and device issues is described. The network is based on dense multiwavelength technology and is scalable in terms of the number of networked users, the geographical range of coverage, and the aggregate network capacity. Of paramount importance to the achievement of scalability are the notions of wavelength reuse and wavelength translation. A distributed optical interconnect that is wavelength-selective and electronically controllable, permitting the same limited set of wavelengths to be reused among other access stations, is employed. By exercising the wavelength-selective switches, the wavelength-routed connectivity between stations can be reconfigured as needed. A multihop overlay network involving wavelength translation and self-routing fast packet switches permits full connectivity, if desired among the access stations at the individual virtual circuit level. Using just eight wavelengths, such a network could in principle interconnect a population of 100 million users over a nationwide geography with an expected delay equal to that of 12 hops. >
351 citations
"A New Scalable Topology for Multiho..." refers background in this paper
...... degree for low cost (ii) simple routing scheme for avoiding the need of complex routing tables (iii) small diameter for faster communication (iv) growth capability with least possible perturbation in the network . The de Bruijn graph being a regular topology and having a structured node-connectivity have simpler routing [4] schemes and can support a large number of nodes with a small diameter and small nodal degree . However, scalability [ ......
[...]