Filters








227,218 Hits in 2.9 sec

Uncovering the Useful Structures of Complex Networks in Socially-Rich and Dynamic Environments

Jie Wu
2017 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)  
Uncovering a useful global structure of complex networks is important for understanding system behaviors and in providing global guidance for application designs.  ...  We discuss opportunities to uncover the structural properties of complex networks, especially in a mobile environment, and we summarize three promising approaches for uncovering useful structures: trimming  ...  Although partial link reversal [16] improves performance by reversing a subset of links at each reversal, it does not reduce the overall complexity.  ... 
doi:10.1109/icdcs.2017.129 dblp:conf/icdcs/Wu17 fatcat:3hxeuebdrzex3mhdzdsfr7m6cm

Partial is Full [chapter]

Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
2011 Lecture Notes in Computer Science  
Link reversal is the basis of several well-known routing algorithms [10, 16, 12] .  ...  Prior work [7] has introduced a generalization, called LR, of link-reversal routing, including FR and PR that uses binary labels on links and has given an exact analysis of the work complexity of this  ...  The link-reversal approach to routing is the basis of a couple of well-known routing protocols for mobile ad hoc networks [16, 12] .  ... 
doi:10.1007/978-3-642-22212-2_11 fatcat:c7rgphx4onfmvnmmmbdicn4i7m

Integrated Evacuation Network Optimization and Emergency Vehicle Assignment

Chi Xie, Mark A. Turnquist
2009 Transportation Research Record  
A brief description is provided of the Lagrangian relaxation and tabu search method that solves the evacuation network optimization problem.  ...  a two-stage solution strategy is described, where the emergency vehicle assignment constrains subsequent decisions on lane reversal and intersection use.  ...  ι → ς t ις = travel time on link ι → ς, where t ις is a function of x ις and n ις y ηι = connectivity indicator of link η → ι, where η → ι is an intersection link y l ηι = connectivity indicator of link  ... 
doi:10.3141/2091-09 fatcat:wjmqc4qfznc3zipheiqlphzfgu

Performance analysis of alternate routing with trunk reservation in multirate switched networks

Joonhwan Kim, Donghwan Lee, Saewoong Bahk
2002 Computer Communications  
In this paper we model the system of dynamic alternate routing with trunk reservation for multirate switched networks where the Markov chain is not time reversible, and analyze it by using an iteration  ...  The complexity of the modified approximation is the same as that of the Kaufman's method.  ...  Approximate Performance of Alternate Routing with Trunk Reservation The performance of alternate routing (no trunk reservation) which is time reversible can be obtained by applying Kaufman's formula  ... 
doi:10.1016/s0140-3664(02)00052-x fatcat:2mcpbiyl3fgahe253oudb4rhgm

Multicast QoS Routing Using Collaborative Path Exploration

Jaipal Singh
2010 2010 24th IEEE International Conference on Advanced Information Networking and Applications  
Analysis of this method shows that the path search time and message overhead is lower than other similar schemes. Keywords-quality of service (QoS); multicast; computer networks I.  ...  Quality of Service (QoS) is one of the most active research areas in networking.  ...  or on the reverse path of the EBPM.  ... 
doi:10.1109/aina.2010.165 dblp:conf/aina/Singh10 fatcat:ica6k7tiorgj7edb2s7axpvhqy

Brief announcement

Bernadette Charron-Bost, Matthias Fuegger, Jennifer L. Welch, Josef Widder
2011 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11  
Although substantial analysis has been done on the Full Reversal (FR) routing algorithm since its introduction by Gafni and Bertsekas in 1981, a complete understanding of its functioning-especially its  ...  In this paper, we derive the first exact formula for the time complexity of FR: given any (acyclic) graph the formula provides the exact time complexity of any node in terms of some simple properties of  ...  sinks only reverse those incident links that have not been reversed since the last time this node was a sink.  ... 
doi:10.1145/1989493.1989510 dblp:conf/spaa/Charron-BostFWW11 fatcat:vlb4wd3dbzerhdja76ytglyjuy

Efficient Recovery from False State in Distributed Routing Algorithms [chapter]

Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose, Gerome Miklau
2010 Lecture Notes in Computer Science  
Through simulation, we evaluate our algorithms -in terms of message and time overhead -when applied to removing false state in distance vector routing.  ...  yields superior performance when using the poison reverse optimization.  ...  Brian DeCleene of BAE Systems, who initially suggested this problem area.  ... 
doi:10.1007/978-3-642-12963-6_16 fatcat:vl5ndb34fja33jg57kiv4uphbq

Performance Study on Multipath Routing Algorithm using Temporarily Ordered Routing Algorithm TORA using Link – Reversal in Wireless Networks

Dr. K. Kumaravel, Dr. M. Sengaliappan
2017 International Journal of Trend in Scientific Research and Development  
We present new distributed routing protocol Multipath Routing wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms.  ...  The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals.  ...  LINK REVERSAL ALGORITHM Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems.  ... 
doi:10.31142/ijtsrd5951 fatcat:2mh4x2ug75cfhnymshdyjwbmwi

Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures

Pallab Datta, Arun K. Somani
2008 Computer Networks  
The generalized diverse routing problem has been proved to be NP-Complete. The proposed transformation techniques however provides a polynomial time solution for certain restrictive failure sets.  ...  Multiple link failure models, in the form of Shared-Risk Link Groups (SRLG's) and Shared Risk Node Groups (SRNG's) are becoming critical in survivable optical network design.  ...  Complexity Analysis of SRLG Routing We evaluate the overall complexity of the SRLG disjoint routing algorithm using our technique.  ... 
doi:10.1016/j.comnet.2008.04.017 fatcat:xjcm42t5o5gejozptiajsoodwu

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Istikmal, Adit Kurniawan, Hendrawan
2017 Journal of Computer Networks and Communications  
This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV). This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism.  ...  We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead.  ...  Conflicts of Interest The authors declare that there are no conflicts of interest regarding the publication of this paper.  ... 
doi:10.1155/2017/1378374 fatcat:w76wctb6hbewzb7xxffxp65vwq

Page 724 of The Journal of the Operational Research Society Vol. 50, Issue 7 [page]

1999 The Journal of the Operational Research Society  
For the case (TYPE-II, TYPE-II), more complex opera- tions in checking time feasibility are needed because of the presence of a generalised customer and of a reversed generalised customer.  ...  ™ +t, ,<LT is In case of considering the reversed generalised customer of an arbitrary route, we need first see whether the correspond- ing route examined in a reverse direction is still time- feasible  ... 

Mobile Adhoc Network (MANET) Routing Protocols Analytical Study

Sd Salman Ali Sd Salman Ali
2013 IOSR Journal of Computer Engineering  
In this paper on "MOBILE ADHOC INETWORKS" the writer makes an attempt to explain MANET's in terms of its definition, characteristics, routing, protocols, dynamic source routing and its characteristics  ...  So sometimes he wants to connect with himself and most of the other times he wishes to be connected with others at other places through one means or the other.  ...  next path available Route Table Link reversal and Route repair Table: Complexity Comparison of DSR, AODV and TORA Protocol Time Complexity for Route Discovery Time Complexity for Route  ... 
doi:10.9790/0661-01042532 fatcat:tcxrimhuxzglnhk7xtuwjncgxy

Circuit-switched on-chip photonic interconnection network

Lei Zhang, Xianfang Tan, Mei Yang, Yingtao Jiang, Peng Liu, Jianyi Yang
2012 The 9th International Conference on Group IV Photonics (GFP)  
The analysis based on the synthesis result of the CSPIN router shows that significant savings in power and pathsetup latency are achieved by the proposed CSPIN architecture.  ...  The tradeoff is the increased complexity of the control circuit and longer setup time at each node.  ...  The RCU controls the tuning of MRRs to set the route from an input link to an output link. At any time, only one output can be assigned to one input, and vice versa.  ... 
doi:10.1109/group4.2012.6324160 fatcat:dxqsfo255venfboulyrniy2gou

Global data computation in chordal rings

Xianbing Wang, Yong Meng Teo
2009 Journal of Parallel and Distributed Computing  
Analysis and comparison with two virtual links approaches show that our protocol reduces message complexity significantly.  ...  The main advantage of the protocol is that there is no notion of rounds.  ...  Acknowledgment This work is partially supported by the National University of Singapore under Academic Research Fund R-252-000-180-112.  ... 
doi:10.1016/j.jpdc.2009.04.007 fatcat:yyhod7nvknflhbr5eo77yy2deu

The UniMIN switch architecture for large-scale ATM switches

Sung Hyuk Byun, Dan Keun Sung
2000 IEEE/ACM Transactions on Networking  
ATM cells are routed to their destination using a two-level routing strategy.  ...  We also propose a "fair virtual FIFO" to provide fairness between input links while preserving cell sequence.  ...  The Clos-type Growable switch [16] reduces the module size to at the expense of complex per-cell routing at every cell time.  ... 
doi:10.1109/90.836482 fatcat:wriqmuaobbe35gzdtzifz6wtim
« Previous Showing results 1 — 15 out of 227,218 results