A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
A study of the routing capacity regions of networks
2008
2008 42nd Asilomar Conference on Signals, Systems and Computers
Preserved Fulltext
In this paper this result is sharpened by exploiting properties of the solution satisfied by each rate-tuple on the boundary of the capacity region, and a finite description of the routing capacity region ...
The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas' lemma as an infinite set of linear inequalities. ...
ACKNOWLEDGMENT The inequality elimination technique which is the foundation of this work was developed as part of the derivation of two network coding capacity regions. ...
doi:10.1109/acssc.2008.5074831
fatcat:dluqjvmfavf3nmn3gcg2mivtum
Capacity regions for wireless ad hoc networks
2003
IEEE Transactions on Wireless Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. ...
Numerical results indicate that multihop routing, the ability for concurrent transmissions, and SIC significantly increase the capacity of ad hoc and multihop cellular networks. ...
Such techniques will allow us to study capacity regions of larger networks, and if simple enough could also be integrated to the study of medium access control and routing protocols in ad hoc networks. ...
doi:10.1109/twc.2003.814342
fatcat:jl6i2moy2ndhzgob4c2nagw4pe
Achieving 100% Throughput in Reconfigurable Optical Networks
2008
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We characterize the stability region of the reconfigurable network, employing both single-hop and multihop routing, in terms of the RWA problem applied to the same physical topology. ...
We study the maximum throughput properties of dynamically reconfigurable optical networks having wavelength and port constraints. ...
A major accomplishment of our work is a characterization of the capacity region for single-wavelength optical networks through a linkage to the Routing and Wavelength Assignment (RWA) problem for WDM networks ...
doi:10.1109/tnet.2007.905603
fatcat:kjkmss5hwbh63l3pkctnyvs5am
Nonlinear Min-Cost-Pursued Route-Swapping Dynamic System
2013
Discrete Dynamics in Nature and Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This study proposes a nonlinear min-cost-pursued swapping dynamic (NMSD) system to model the evolution of selfish routing games on traffic network where travelers only swap from previous costly routes ...
The second one aims to explore the impacts of network scale on the stability of route-swaps conducted by pairwise and min-cost-pursed swapping behaviors. ...
Numerical Study II In this section, we discuss the influence of network scale on the convergence of route-swaps through a numerical comparison between two hypothetical networks. ...
doi:10.1155/2013/162128
fatcat:vklzndc6pzhjveot3cvfzbs5gm
Achieving 100% Throughput in Reconfigurable Optical Networks
2006
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We characterize the stability region of the reconfigurable network, employing both single-hop and multihop routing, in terms of the RWA problem applied to the same physical topology. ...
We study the maximum throughput properties of dynamically reconfigurable optical networks having wavelength and port constraints. ...
A major accomplishment of our work is a characterization of the capacity region for single-wavelength optical networks through a linkage to the Routing and Wavelength Assignment (RWA) problem for WDM networks ...
doi:10.1109/infocom.2006.12
dblp:conf/infocom/BrzezinskiM06
fatcat:qckt2ykct5cq5neebcc4geqwtq
Disaster-Resilient Optical Network Survivability: A Comprehensive Survey
2018
Photonics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Such network failures may lead to a section of a network to cease to function, resulting in non-availability of services and may increase the congestion within the rest of the network. ...
Network survivability endeavors to ensure the uninterrupted provisioning of services by the network operators in case of a disaster event. ...
The region of a failure can be of a circular geometry of a radius r centered at point O in the network layout. ...
doi:10.3390/photonics5040035
fatcat:r5giwfj5tnau7axrcse675alxe
Achievable rate regions for network coding
2012
2012 Information Theory and Applications Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. ...
We describe the achievable rate regions for three interesting networks and show that achievable rate regions for linear codes need not be convex. ...
ACKNOWLEDGMENT This paper appears in the proceedings of the Information Theory and its Applications Workshop (ITA), held in San Diego, CA, February 2012. ...
doi:10.1109/ita.2012.6181807
dblp:conf/ita/DoughertyFZ12
fatcat:7f7sft5rirdnne6jjntaqkfdhi
Achievable Rate Regions for Network Coding
2015
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. ...
We describe the achievable rate regions for three interesting networks and show that achievable rate regions for linear codes need not be convex. ...
ACKNOWLEDGMENT This paper appears in the proceedings of the Information Theory and its Applications Workshop (ITA), held in San Diego, CA, February 2012. ...
doi:10.1109/tit.2015.2403315
fatcat:622pdcogxjaqrjub2s4ofia5lm
Capacity Regions of Wireless Multi-Channel Ad Hoc Networks
2011
2011 IEEE Vehicular Technology Conference (VTC Fall)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the influence of FDMA on the capacity region of wireless ad hoc networks with a small number of nodes. ...
It is found that FDMA offers an additional degree of freedom that is beneficial in interference-limited networks. ...
To study the design trade-offs in networks with a small number of nodes, Toumpis and Goldsmith introduced the concept of capacity regions [1] 1 . ...
doi:10.1109/vetecf.2011.6093044
dblp:conf/vtc/ElsnerMJ11
fatcat:nrdgecbhx5fi3gy2ycbicj7poq
Computing bounds on network capacity regions as a polytope reconstruction problem
2011
2011 IEEE International Symposium on Information Theory Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and ...
We show that the network routing capacity region is a computable rational polytope and provide exact algorithms and approximation heuristics for computing the region. ...
This material is based upon work supported by the Air Force Office of Scientific Research (AFOSR) under award No. 016974-002. ...
doi:10.1109/isit.2011.6034197
dblp:conf/isit/KimM11
fatcat:f5uqn2n2ffdhvaswr4sdcl644m
Determining Domestic Container Shipping as an Enforcement of Indonesian International Hub Port
2018
IOP Conference Series: Earth and Environment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Some studies has used a variety of concepts in designing routes and fleet capacity in order to obtain optimal combination.
Liner Shipping Network Design Problem (LSNDP). ...
Mulder and Dekker has conducted a study related designing the optimum routes in liner shipping they using combination of fleet-design, shipscheduling and cargo routing with restrictions on availability ...
Routes Quantity ( ...
doi:10.1088/1755-1315/135/1/012012
fatcat:lnyw6fmusfgulabarwwjokr4ki
Variable-Range Transmission Power Control in Wireless Ad Hoc Networks
2007
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the transmission range and node mobility for both route discovery and route maintenance. ...
In this paper, we investigate the impact of individual variable-range power control on the physical and network connectivity, network capacity, and power savings of wireless multihop networks such as ad ...
In [3] , the authors study the throughput capacity of wireless multihop networks for UDP traffic. ...
doi:10.1109/tmc.2007.250673
fatcat:4z35s3g6kbdexowlc6pe6zyfve
Game-Theoretic Approach to Capacity and Stability Evaluations of Decentralized Adaptive Route Selections in Wireless Ad Hoc Networks
2005
IEICE transactions on communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A game-theoretic analysis is applied to the evaluation of capacity and stability of a wireless ad hoc network in which each source node independently chooses a route to the destination node so as to enhance ...
., each rational source node cannot determine a unique route. The occurrence of such cases depends on both the transmit power and spatial arrangement of the nodes. ...
We also analyze the achievable throughput of a network under DARS and compare it to the capacity region [11] . ...
doi:10.1093/ietcom/e88-b.3.1009
fatcat:uigfvjeavnf6vfda7ze6tmtvam
Dimensioning backbone networks for multi-site data centers: Exploiting anycast routing for resilience
2015
2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(2) Can we exploit anycast routing for resilience purposes, i.e., relocate to a different DC under failure conditions, to reduce resource capacity requirements? ...
In particular, we study the problem of dimensioning such backbone networks: what bandwidth should each of the links provide for the traffic, originating at known sources, to reach the data centers? ...
Jaumard has been supported by a Concordia University Research Chair (Tier I) and by an NSERC (Natural Sciences and Engineering Research Council of Canada) grant. ...
doi:10.1109/rndm.2015.7324306
dblp:conf/mwcn/DevelderJ15
fatcat:wpx72thygjcyllcvmw2hnqht5e
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this work we study the dynamic one-to-one communication problem in energy-and capacity-constrained wireless ad-hoc networks. ...
We propose a multicost energy-aware routing algorithm and compare its performance to that of minimum-hop routing. ...
Most previous works [7] studied the performance of ad-hoc networks in the context of the evacuation problem, where the network starts with a certain number of packets that have to be served and a certain ...
doi:10.1007/11823285_98
fatcat:pphpvlwnhvek3jbvosdtod4llm
« Previous
Showing results 1 — 15 out of 267,901 results