Router Router Router
David M. Schwenk, Joseph Bush, Lucie M. Hughes et al. · 2008
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Router”
David M. Schwenk, Joseph Bush, Lucie M. Hughes et al. · 2008
Cited by 0
Imcom Lonworks, Building Automation, David M. Schwenk et al. · 2016
Cited by 0
Qingyang Song, Abbas Jamalipour, University Of Sydney · 2014
The authors develop a network selection scheme for an integrated cellular/wireless LAN system. The design goal is to provide the user the best available Quality of Service (QoS) at any time. The increasing demand for broadband service, at least in hot spot areas, in today’s wireless communications is causing cellular network providers to consider the integration of 3G cellular systems and wireless LAN. This has the particular advantage of high data rates and unlicensed spectrum. Consequently, network selection techniques play a vital role in ensuring quality of service in heterogeneous networks. In this article we develop a network selection scheme for an integrated cellular/wireless LAN system. The design goal is to provide the user the best available QoS at any time. The proposed scheme comprises two parts, with the first applying an analytic hierarchy process (AHP) to decide the relative weights of evaluative criteria set according to user preferences and service applications, while the second adopts grey relational analysis (GRA) to rank the network alternatives with faster and simpler implementation than AHP. Simulations conducted in a heterogeneous system with UMTS and wireless LAN reveal that the proposed network selection technique can effectively decide the optimum network through making trade-offs among network condition, user preference, and service application, while avoiding frequent handoffs.
Cited by 0
2Production · Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
Santanu Sarma, N. Venkatasubramanian, A. Nicolau et al. · 2013
Cited by 0
Całek, Agnieszka · Jagiellonian University Repository (Jagiellonian University) · 2024
Cited by 0
2014
Cited by 0
Całek, Agnieszka · Jagiellonian University Repository (Jagiellonian University) · 2024
Cited by 0Open access
Apu Kapadia, Steven Myers, Xiaofeng Wang et al. · 2012
Cited by 0
Iqbal, Muhammad, Katare, Deepshikha Pande, M.H. Mughal et al. · 2020
Cited by 0Open access
Iqbal, Muhammad, Katare, Deepshikha Pande, M.H. Mughal et al. · 2020
Cited by 0Open access
2023
Cited by 0
Yi Kai, Bin Liu, Jianyuan Lu · Advances in intelligent systems and computing · 2014
Cited by 2
Meethian Naina, Mishal, Patil, Pranav · Zenodo (CERN European Organization for Nuclear Research) · 2024
Cited by 0Open access
Seán Turner, Randy Bush, Keyur Patel · 2013
The RPKI/Router Protocol v0 is specified to carry the PDUs necessary for RPKI-based Origin Validation. For BGPsec Path Validation, the routers also need data extracted from BGPsec Router Certificates. This document adds a PDU to the RPKI/Router Protocol to carry those data.
Cited by 0
Hongyi Zhu, Robert H. Fujii · 2003
General heuristic algorithms that have been developed for channel routing fail to fully characterize the 'landscape' of nets to be routed and thus may yield suboptimal solutions. The authors' track-assignment type routing algorithm makes use of an extensive set of net characteristics/relationships to perform a more sophisticated search for an optimal routing layout than the less other channel routers. When a routing problem is encountered, the algorithm resorts to subdoglegging, to a single-layer segment, or to local backtracking when a solution cannot be found. The algorithm can obtain optimal solutions for all the published channel routing examples. With some multiple-cycle examples, it performs better than the public-domain channel routers such as YACR2, Chameleon, or Mighty.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 1
Desoutter Bros Ltd. · Journal of Scientific Instruments · 1935
Cited by 0
Souza, M., Moreira, Waldir · COPELABS Scientific commons (Universidade Lusófona)
This package provides the TECD algorithm for the Opportunistic Network Environment (ONE). It is implemented to work with the Time-Evolving Contact Duration (TECD) utility function used to derive the weight of edges in a social graph from the statistical contact duration that nodes present over time. It also works with a second function based on the importance of nodes, TECDi, which was based on "Peoplerank: Combining social and contact information for opportunistic forwarding" by Abderrahmen Mtibaa et al. (2010).
Cited by 0
Me · Zenodo (CERN European Organization for Nuclear Research) · 2022
La mejor forma de acceder router es mediante la ip poniendo en el buscador y haciendo login con los datos de las instrucciones
Cited by 0Open access
2023
Cited by 0