Results 81 to 90 of about 383,210 (257)
Weighted Shortest Path Models: A Revisit to the Simulation of Internet Routing [PDF]
arXiv, 2014 Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been found and widely accepted that a packet in Internet is usually not transmitted along the unweighted shortest path ...
arxiv
Advanced Materials, EarlyView.This review examines the fluid dynamic behavior within carbonaceous porous structures, linking structural characteristics to electrolyte transport and electrochemical performance. Specifically, it quantitatively assesses the effect of polyphenol derivatives‐harnessed multiscale pore structures on active surface utilization and electrochemical activity ...
Minjun Kim +3 more
wiley +1 more source
Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand [PDF]
arXiv, 2013 We study a class of robust network design problems motivated by the need to scale core networks to meet increasingly dynamic capacity demands. Past work has focused on designing the network to support all hose matrices (all matrices not exceeding marginal bounds at the nodes).
arxiv
Advanced Materials, EarlyView.In this review, the recent development of deep‐blue (≤465 nm) perovskite light‐emitting diodes (PeLEDs) are summarized, using different perovskite nanomaterials, including nanocrystals (NCs), quantum dots (QDs), nanoplatelets (NPLs), quasi‐2D thin film, 3D bulk thin film, as well as lead‐free perovskite nanomaterials.
Pui Kei Ko +6 more
wiley +1 more source
Soft Computing Framework for Routing in Wireless Mesh Networks: An Integrated Cost Function Approach [PDF]
International Journal of Electronics, Computer and Communication
Technologies (IJECCT), 2013, Vol.3(3),pp.25-32, 2013, 2013 Dynamic behaviour of a WMN imposes stringent constraints on the routing policy of the network. In the shortest path based routing the shortest paths needs to be evaluated within a given time frame allowed by the WMN dynamics. The exact reasoning based shortest path evaluation methods usually fail to meet this rigid requirement.
arxiv
Emerging Opportunities of Colloidal Quantum Dots for Photocatalytic Organic Transformations
Advanced Materials, EarlyView.Colloidal quantum dots (QDs) have gained significant attention as photocatalysts in organic transformations in recent years. This review highlights QDs’ distinctive features, including the quantum size effect, compositional and structural diversity, tunable surface chemistry, and photophysics.
Qinxuan Cao +4 more
wiley +1 more source
BFR: a Bloom Filter-based Routing Approach for Information-Centric Networks [PDF]
arXiv, 2017 Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN). This process is known as content discovery. To facilitate content discovery, in this paper we focus on Named Data Networking (NDN) and propose a novel routing scheme for content discovery, called Bloom Filter-based Routing (BFR), which is fully ...
arxiv
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
, 2014 Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints.
Bonichon, Nicolas +4 more
core +1 more source
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
On Compact Routing for the Internet
, 2007 While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact ...
Arthur Brady +12 more
core +3 more sources