43,543 Hits in 4.8 sec

Route Research for Ad Hoc Network

Zhengxi Wei
2014 American Journal of Networks and Communications  
We finally present a routing algorithm to select a most economical path among potential routing paths.  ...  By multicasting packets in the intranet, the precious bandwidth over wireless link is saved greatly.  ...  Acknowledgements The research was supported by Artificial Intelligence Key Laboratory of Sichuan Province (No. 2013RYY04) and the Sichuan Provincial Education Department's Key Project (No.14ZA0210).  ... 
doi:10.11648/j.ajnc.20140306.11 fatcat:p5pjdzgkybhppc5s5lrllkj7ee

An algorithm for designing rings for survivable fiber networks

O.J. Wasem
1991 IEEE Transactions on Reliability  
This paper presents an algorithm for routing fiber around a ring in a network, when the network nodes, links, connectivity, and which offices are to be placed on that ring together are known.  ...  Since the largest example network used in these results, 167 offices and 240 links, is the size of a typical large LATA network, the algorithm runs fast enough for the intended application.  ...  Wasem, "An algorithm for designing rings in communication networks", NFOEC'91 Proc., 1991 Apr; Nashville, Tennessee. this increase in computation time should not impose stringent 151 A.  ... 
doi:10.1109/24.93762 fatcat:u4tpjwejejayxbp4dh2x52zcom

Network Synthesis for Database Processing Units

Andrea Lottarini, Stephen A. Edwards, Kenneth A. Ross, Martha A. Kim
2017 Proceedings of the 54th Annual Design Automation Conference 2017 on - DAC '17  
We explore on-chip network topologies for the Q100, an analytic query accelerator for relational databases.  ...  We find our algorithm produces networks that are 1.24× slower than the highest-performance generic topology considered (a fat tree), and 18% smaller than the least expensive (a double ring).  ...  However, unlike the additive state of the art, we introduce dedicated, low-contention links for the most important communication pairs and connect the remainder of the ports through a generic topology.  ... 
doi:10.1145/3061639.3062289 dblp:conf/dac/LottariniERK17 fatcat:ynvvsruzljdzlfw7eduhvhhzvu

Optimal Design of a Wide Area Measurement System for Improvement of Power Network Monitoring Using a Dynamic Multiobjective Shortest Path Algorithm

Amir Ghasemkhani, Hassan Monsef, Ashkan Rahimi-Kian, Amjad Anvari-Moghaddam
2017 IEEE Systems Journal  
In this paper, measurement and communication infrastructures in a wide area network are designed independently from a management viewpoint, considering an adequate level of system observability.  ...  In the next step, new dynamic multiobjective shortest path (MOSP) programming is presented for the optimal design of communication infrastructure.  ...  Security Analysis: One of the most important issues in the communication system design procedure is to find the shortest path in a given network regarding a spanning tree as to provide reliable data transmission  ... 
doi:10.1109/jsyst.2015.2469742 fatcat:hz7agfxe2rd5fekvmqjdycb5hm

Self-Healing Networks: Redundancy and Structure

Walter Quattrociocchi, Guido Caldarelli, Antonio Scala, Yamir Moreno
2014 PLoS ONE  
By exploiting the presence of redundant links in recovering the connectivity of the system, we introduce self-healing capabilities through the application of distributed communication protocols granting  ...  nodes still served for increasing levels of network damages.  ...  AS thanks Claudio Mazzariello for very useful discussions on routing algorithms, Thomas Fink for suggesting the focus on Kirchoff networks, Stefano Sello and Matteo Cantú for discussions on the topology  ... 
doi:10.1371/journal.pone.0087986 pmid:24533065 pmcid:PMC3922772 fatcat:floxqnw4ajgnrollmklwxws3x4

Algorithmic Support of Optimization of Multicast Data Transmission in Networks with Dynamic Routing

Anatoliy Pavlovich Nyrkov, Andrey Sergeevich Belousov, Sergey Sergeevich Sokolov
2015 Modern Applied Science  
Recently there is an increase in price of equipment for building networks and organizational technologies for communication and access channels, loads to the key network nodes increase, as well as the  ...  The possibility of improving the existing algorithms by selecting certain "rendezvous points", as well as the algorithm for reducing the "cost" of the multicast routing tree are analysed.  ...  Networks with dynamic routing use special, pre-defined criteria for the communication links.  ... 
doi:10.5539/mas.v9n5p162 fatcat:5efxpde2pzeelb5wn2lwxgttf4

Analysis, Modeling, and Design of a Reliable Wide Area Network Case Study for Tikrit University Intranet

2018 Tikrit Journal of Engineering Sciences  
A B S T R A C T This work presents the analysis and modeling of communication network used for data transmission with multi-protocols in campus network.  ...  It will be subject to reliability improvement by links addition. Tie-sets method is used to evaluate the network reliability.  ...  To find the network backbone which is the best spanning tree a procedure based on Kruskal algorithm is developed [12]: 1-Create a forest F (a set of trees), where each node in the graph is a separate tree  ... 
doi:10.25130/tjes.25.2.05 fatcat:s7pabvxcdfe5ze77uvoy5hpoja

An Axiomatic Approach to Routing

Omer Lev, Moshe Tennenholtz, Aviv Zohar
2016 Electronic Proceedings in Theoretical Computer Science  
We proceed to fully characterize minimal spanning tree, shortest path, and weakest link routing algorithms, showing a tight set of axioms for each.  ...  Information delivery in a network of agents is a key issue for large, complex systems that need to do so in a predictable, efficient manner.  ...  Aviv Zohar is supported in part by the Israel Science Foundation (Grants 616/13 and 1773/13), and by the Israel Smart Grid (ISG) Consortium.  ... 
doi:10.4204/eptcs.215.14 fatcat:nslia7lynjcdvia7k2qsjqknha

Page 5836 of Mathematical Reviews Vol. , Issue 99h [page]

1999 Mathematical Reviews  
In this paper, we describe an augmented hypercube in which nodes of dis- tance two have extra direct links in addition to the inter-cluster links and intra-cluster links.  ...  Bandwidth allocation algorithms for tree and ring networks.  ... 

Profiling Social Network Users With Machine Learning

Evis Trandafili, Marenglen Biba, Aleksander Xhuvani
2013 Balkan Conference in Informatics  
A user falling under a certain profile could then target with the same products used for other users in the same group.  ...  One of the most important tasks in analyzing social networks is the user profiling (or clustering) which makes possible to design customized marketing strategies based on the type of the user.  ...  An interesting approach is community (cluster) level link prediction method without the need to explicitly identify the communities in a network.  ... 
dblp:conf/bci/TrandafiliBX13 fatcat:gbo5kopbsjfrvfcz74edjgyeeq

Efficient Multicast Algorithms for Mesh and Torus Networks

Hovhannes A. Harutyunyan, Ankit Malani
2014 2014 IEEE International Symposium on Parallel and Distributed Processing with Applications  
Efficient Multicast Algorithms for Mesh and Torus Networks Ankit Malani With the increasing popularity of multicomputers, efficient way of communication within its processors has become a popular area  ...  Mesh and Torus are some of the commonly used network topologies in building multicomputer systems. Their performance highly depends on the underlying network communication such as multicast.  ...  A network in which there is an exclusive link between a node and each of its neighboring nodes is known as direct network. For example: hypercube, mesh.  ... 
doi:10.1109/ispa.2014.39 dblp:conf/ispa/HarutyunyanM14 fatcat:3fmuoxzmlbhcpkdvyxqnzmgpwy

Tree Based Broadcast in Ad Hoc Networks

Alpär Jüttner, Ádám Magi
2005 Journal on spesial topics in mobile networks and applications  
Although broadcasting using tree structure established in a network is a well known and widely used technique, it is typically claimed to be inappropriate for ad hoc networks, being the maintained tree  ...  To achieve this, first, a novel method is presented to maintain a spanning tree in an ad hoc network in a fully distributed, on-line and asynchronous way.  ...  In addition to its TreeID, each nodes stores that from among its links, which ones belong to the Broadcast Tree. For the sake of simplicity, these links are referred as Broadcast Link.  ... 
doi:10.1007/s11036-005-3368-5 fatcat:chmhsictsbb6xjtbrrkyvka7zq

The multimedia multicasting problem

Joseph C. Pasquale, George C. Polyzos, George Xylomenos
1998 Multimedia Systems  
We describe these problems, and identify where the opportunities are for effective solutions, all in the context of providing an overview of the current state of research in multimedia multicasting.  ...  The interaction between multicasting and the delivery of multiple time-correlated continuous-media streams with realtime delay requirements poses various new and interesting problems in research on communication  ...  However, the disadvantages are also important: the algorithm needs to run in addition to the unicast algorithms, and it will itself have scaling problems for large networks.  ... 
doi:10.1007/s005300050075 fatcat:qcy2vnfnxnhknoogjwon46vuky

The impact of point-to-multipoint traffic concentration on multirate networks design

A. Meddeb, A. Girard, C. Rosenberg
2002 IEEE/ACM Transactions on Networking  
We consider the problem of multirate network design with point-to-multipoint communications. We give a mathematical formulation for this problem.  ...  Using approximations, we show that traffic concentration on a small number of links significantly reduces the cost of the network.  ...  In a well-designed network, it is known that the direct link [3] carries most of the traffic.  ... 
doi:10.1109/90.986568 fatcat:pcilqp4ob5cfhilmgvtvnd7pky

Natural communities in large linked networks

John Hopcroft, Omar Khan, Brian Kulis, Bart Selman
2003 Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03  
For such temporal tracking, we require a clustering algorithm that is relatively stable under small perturbations of the input data.  ...  We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities.  ...  In this paper, we illustrate an effective agglomerative algorithm for clustering and a method for identifying stable or natural clusters within the linked network.  ... 
doi:10.1145/956804.956816 fatcat:dpqyp7eipngs5ltuxzwwl2ayfq
« Previous Showing results 1 — 15 out of 43,543 results