Thematische Bibliographien / Load forwarding

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Load forwarding“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Load forwarding" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Load forwarding"

Weiguang Shi, M. H. MacGregor und P. Gburzynski. „Load balancing for parallel forwarding“. IEEE/ACM Transactions on Networking 13, Nr. 4 (August 2005): 790–801. http://dx.doi.org/10.1109/tnet.2005.852881.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Xiaofeng, Wei Zhu und Yueming Dai. „Network simulation task partition method in heterogeneous computing environment“. International Journal of Modeling, Simulation, and Scientific Computing 05, Nr. 03 (05.05.2014): 1450010. http://dx.doi.org/10.1142/s179396231450010x.

Der volle Inhalt der Quelle

Annotation:

To reduce the running time of network simulation in heterogeneous computing environment, a network simulation task partition method, named LBPHCE, is put forward. In this method, the network simulation task is partitioned in comprehensive consideration of the load balance of both routing computing simulation and packet forwarding simulation. First, through benchmark experiments, the computation ability and routing simulation ability of each simulation machine are measured in the heterogeneous computing environment. Second, based on the computation ability of each simulation machine, the network simulation task is initially partitioned to meet the load balance of packet forwarding simulation in the heterogeneous computing environment, and then according to the routing computation ability, the scale of each partition is fine-tuned to satisfy the balance of the routing computing simulation, meanwhile the load balance of packet forwarding simulation is guaranteed. Experiments based on PDNS indicate that, compared to traditional uniform partition method, the LBPHCE method can reduce the total simulation running time by 26.3% in average, and compared to the liner partition method, it can reduce the running time by 18.3% in average.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guo, Yan Hua, Yi Min Guo, Ya Jun Guo und Cai Mei Wang. „A Trajectory Privacy Preserving Method in Peer-to-Peer LBS System“. Applied Mechanics and Materials 34-35 (Oktober 2010): 571–75. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.571.

Der volle Inhalt der Quelle

Annotation:

The wide application of Location-Based Service (LBS) makes location privacy and trajectory privacy receive much attention in recent years. The basic idea of current privacy preserving methods in LBS is cutting the relationship of user’s consecutive locations. This paper propose LOCMIX, a trajectory privacy protecting method which is based on neighbor node’s forwarding query in a P2P LBS system. Choose the user who have sufficient power to forward queries to LBS as the forwarding node of user u. The forwarding node must be as close to user u as possible. Then the k-Anonymity Spatial Region (k-ASR) was constructed with the forwarding node and the k-1 users whose Hilbert value is less than (or more than) the forwarding node. The experiments show that LOCMIX has good load balancing property and protect trajectory privacy effectively against the “center-of-k-ASR” attack and the correlation attack.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

박상현, Gitae Yeo und Cha young doo. „Strategies For improvement of Less Container Load freight-forwarding service“. Journal of Shipping and Logistics 33, Nr. 2 (Juni 2017): 299–319. http://dx.doi.org/10.37059/tjosal.2017.33.2.299.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Casari, Paolo, Michele Nati, Chiara Petrioli und Michele Zorzi. „Geographic forwarding and adaptive load balancing in wireless sensor networks“. ACM SIGMOBILE Mobile Computing and Communications Review 11, Nr. 2 (April 2007): 53–54. http://dx.doi.org/10.1145/1282221.1282232.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Isik, Sinan, Mehmet Yunus Donmez und Cem Ersoy. „Cross layer load balanced forwarding schemes for video sensor networks“. Ad Hoc Networks 9, Nr. 3 (Mai 2011): 265–84. http://dx.doi.org/10.1016/j.adhoc.2010.07.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mansour, Dima, Haidar Osman und Christian Tschudin. „Load Balancing in the Presence of Services in Named-Data Networking“. Journal of Network and Systems Management 28, Nr. 2 (21.12.2019): 298–339. http://dx.doi.org/10.1007/s10922-019-09507-x.

Der volle Inhalt der Quelle

Annotation:

AbstractLoad balancing is a mechanism to distribute client requests among several service instances. It enables resource utilization, lowers response time, and increases user satisfaction. In Named-Data Networking (NDN) and NDN-like architectures, load balancing becomes crucial when dynamic services are present, where relying solely on forwarding strategies can overload certain service instances while others are underutilized especially with the limited benefit of on-path caching when it comes to services. To understand the challenges and opportunities of load balancing in NDN, we analyze conventional load balancing in IP networks, and three closely related fields in NDN: congestion control, forwarding strategies, and data center management. We identify three possible scenarios for load balancing in NDN: facade load balancer, controller for Interest queues, and router-based load balancing. These different solutions use different metrics to identify the load on replicas, have different compliance levels with NDN, and place the load balancing functionality in different network components. From our findings, we propose and implement a new lightweight router-based load balancing approach called the communicating vessels and experimentally show how it reduces service response time and senses server capabilities without probing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Emad Ali, Tariq, Ameer Hussein Morad und Mohammed A. Abdala. „Load Balance in Data Center SDN Networks“. International Journal of Electrical and Computer Engineering (IJECE) 8, Nr. 5 (01.10.2018): 3084. http://dx.doi.org/10.11591/ijece.v8i5.pp3084-3091.

Der volle Inhalt der Quelle

Annotation:

In the last two decades, networks had been changed according to the rapid changing in its requirements. The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations. The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs. Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and forwarding planes. So, due to the rapid increase in the number of applications, websites, storage space, and some of the network resources are being underutilized due to static routing mechanisms. To overcome these limitations, a Software Defined Network based Openflow Data Center network architecture is used to obtain better performance parameters and implementing traffic load balancing function. The load balancing distributes the traffic requests over the connected servers, to diminish network congestions, and reduce underutilization problem of servers. As a result, SDN is developed to afford more effective configuration, enhanced performance, and more flexibility to deal with huge network designs

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liang, Shih Tsung, Bo Yi Song und Yu Yao Su. „Opportunistic Frame Forwarding in Wireless Mesh Networks“. Applied Mechanics and Materials 764-765 (Mai 2015): 941–45. http://dx.doi.org/10.4028/www.scientific.net/amm.764-765.941.

Der volle Inhalt der Quelle

Annotation:

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is transmitted and forwarded along with a fixed and predetermined path, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yu, Haisheng, Keqiu Li und Heng Qi. „An Active Controller Selection Scheme for Minimizing Packet-In Processing Latency in SDN“. Security and Communication Networks 2019 (13.10.2019): 1–11. http://dx.doi.org/10.1155/2019/1949343.

Der volle Inhalt der Quelle

Annotation:

In software-defined network, the use of distributed controllers to control forwarding devices has been proposed to solve the issues of scalability and load balance. However, the forwarding devices are statically assigned to the controllers in these distributed systems, which can overload some controllers while others are underutilized. In this paper, we propose an architecture named ASLB (active controller selection load balance), which proactively selects appropriate controllers for load balancing and minimize packet processing delays. We also present a novel active controller selection algorithm (ACS) for ASLB that efficiently schedules traffic from the switch to the controller and designs an intermediate coordinator for actively selecting a controller to serve a request. We built a system and evaluated it on a physical platform. The results show that ASLB is much better than the static allocation scheme in terms of minimizing latency, bandwidth utilization, and throughput.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Load forwarding"

Del, Fiore Julian Martin. „Detecting hidden broken pieces of the Internet : BGP lies, forwarding detours and failed IXPs“. Thesis, Strasbourg, 2021. http://www.theses.fr/2021STRAD001.

Der volle Inhalt der Quelle

Annotation:

L'objectif de cette thèse est de détecter des éléments défaillants d'Internet. Tout d'abord,nous étudions le déploiement des points d'échange Internet (IXP) en Amérique latine et constatons que certains pays sont en situation d'échec dans leur déploiement IXP, c'est-à-dire aucun IXP du tout, ou bien que l'IXP n'a pas réussi à attirer suffisamment de membres. Deuxièmement, nous étudions BGP, le protocole de routage utilisé sur Internet, et en particulier s'il existe des mensonges BGP, c’est à dire si les routes par lesquelles les paquets circulent réellement sur Internet divergent des chemins que les systèmes autonomes (AS) annoncent. Nous trouvons effectivement des cas où les chemins ne correspondent pas. Enfin, nous étudions comment le trafic circule à l'intérieur des AS et nous nous concentrons sur la détection des détours d'acheminement, c'est-à-dire les cas où les itinéraires d'acheminement ne correspondent pas aux meilleurs itinéraires disponibles, selon le protocole de routage utilisé. Nous mettons ainsi en évidence des détours dans plusieurs AS
The objective of this thesis is to detect hidden broken pieces of the Internet. First, we study the deployment of Internet exchange points (IXPs) in Latin America and find that while some IXPs across the region have managed to proliferate, some countries have failed IXPs, i.e., no IXP at all, or the IXP has not succeeded to attract members. Second, we focus on the border gateway protocol (BGP), the routing protocol used on the Internet, and study whether ASes carry on BGP lies, i.e., if the forwarding routes through which packets actually flow on the Internet diverge from the AS-paths that ASes advertise on BGP. Wefind cases where the paths indeed mismatch. Finally, we study how traffic flows inside ASes and focus on the detection of forwarding detours, i.e., cases in which the forward ingroutes do not match the best available routes, according to the internal gateway protocol(IGP) in use. We reveal such forwarding detours in multiple ASes

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vávra, Jan. „Grafický simulátor superskalárních procesorů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445476.

Der volle Inhalt der Quelle

Annotation:

Práce se zabývá implementací simulátoru superskalárního procesoru. Implementace se odvíjí od existujících simulátorů a jejich chybějících částí. Simulátor umí vykonávat instrukční sadu RISC-V, ovšem je umožněno přidání jakékoli RISC instrukční sady. Simulátor má deterministickou predikci skoku. Části procesoru lze upravovat. Součástí je i editor kódu pro danou instrukční sadu.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yu, Ye. „ULTRA-FAST AND MEMORY-EFFICIENT LOOKUPS FOR CLOUD, NETWORKED SYSTEMS, AND MASSIVE DATA MANAGEMENT“. UKnowledge, 2018. https://uknowledge.uky.edu/cs_etds/68.

Der volle Inhalt der Quelle

Annotation:

Systems that process big data (e.g., high-traffic networks and large-scale storage) prefer data structures and algorithms with small memory and fast processing speed. Efficient and fast algorithms play an essential role in system design, despite the improvement of hardware. This dissertation is organized around a novel algorithm called Othello Hashing. Othello Hashing supports ultra-fast and memory-efficient key-value lookup, and it fits the requirements of the core algorithms of many large-scale systems and big data applications. Using Othello hashing, combined with domain expertise in cloud, computer networks, big data, and bioinformatics, I developed the following applications that resolve several major challenges in the area. Concise: Forwarding Information Base. A Forwarding Information Base is a data structure used by the data plane of a forwarding device to determine the proper forwarding actions for packets. The polymorphic property of Othello Hashing the separation of its query and control functionalities, which is a perfect match to the programmable networks such as Software Defined Networks. Using Othello Hashing, we built a fast and scalable FIB named \textit{Concise}. Extensive evaluation results on three different platforms show that Concise outperforms other FIB designs. SDLB: Cloud Load Balancer. In a cloud network, the layer-4 load balancer servers is a device that acts as a reverse proxy and distributes network or application traffic across a number of servers. We built a software load balancer with Othello Hashing techniques named SDLB. SDLB is able to accomplish two functionalities of the SDLB using one Othello query: to find the designated server for packets of ongoing sessions and to distribute new or session-free packets. MetaOthello: Taxonomic Classification of Metagenomic Sequences. Metagenomic read classification is a critical step in the identification and quantification of microbial species sampled by high-throughput sequencing. Due to the growing popularity of metagenomic data in both basic science and clinical applications, as well as the increasing volume of data being generated, efficient and accurate algorithms are in high demand. We built a system to support efficient classification of taxonomic sequences using its k-mer signatures. SeqOthello: RNA-seq Sequence Search Engine. Advances in the study of functional genomics produced a vast supply of RNA-seq datasets. However, how to quickly query and extract information from sequencing resources remains a challenging problem and has been the bottleneck for the broader dissemination of sequencing efforts. The challenge resides in both the sheer volume of the data and its nature of unstructured representation. Using the Othello Hashing techniques, we built the SeqOthello sequence search engine. SeqOthello is a reference-free, alignment-free, and parameter-free sequence search system that supports arbitrary sequence query against large collections of RNA-seq experiments, which enables large-scale integrative studies using sequence-level data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dossa, Clebio Gavioli. „CoreLB: uma proposta de balanceamento de carga na rede com Openflow e SNMP“. Universidade do Vale do Rio dos Sinos, 2016. http://www.repositorio.jesuita.org.br/handle/UNISINOS/5895.

Der volle Inhalt der Quelle

Annotation:

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2016-11-01T15:35:45Z No. of bitstreams: 1 Clebio Dossa_.pdf: 1252617 bytes, checksum: 784b95c29ee09e2a922686b26cb7aa51 (MD5)
Made available in DSpace on 2016-11-01T15:35:45Z (GMT). No. of bitstreams: 1 Clebio Dossa_.pdf: 1252617 bytes, checksum: 784b95c29ee09e2a922686b26cb7aa51 (MD5) Previous issue date: 2016-08-18
Nenhuma
Atualmente, muitos serviços distribuem a carga entre diversos nós computacionais direcionando as conexões com alguma estratégia de balanceamento para divisão da carga. O advento do uso de redes definidas por software (SDN) está mudando paradigmas da administração de redes, absorvendo serviços especializados, automatizando processos e gerando inteligência para regras estáticas com uma grande variedade de opções de implementação. O balanceamento de carga é um dos serviços especializados que pode usufruir dos conceitos de SDN, sem definições e processos estáticos como ocorre muitas vezes nos atuais modelos usados de balanceamento de carga. A definição dos protocolos que suportam SDN usualmente permitem soluções alternativas e eficientes para este problema, desta forma, neste trabalho, é apresentada uma proposta de metodologia para balanceamento de carga entre distintos servidores de um pool com a troca do destino de tráfego realizada pela rede. Esta solução é chamada Core-based load balance (CoreLB), pois o serviço especializado de balanceamento de carga é realizado pela rede onde a administração de pacotes é nativamente realizada. A metodologia faz uso do protocolo SNMP para análise de recursos dos servidores com o objetivo de avaliar a situação de carga de cada nó computacional e de estatísticas de consumo de rede através do protocolo OpenFlow. Este trabalho avaliou o balanceamento de carga em serviços Web e a união de estatísticas de rede e da carga dos servidores, para a tomada de decisão de balanceamento, mostra-se uma metodologia eficiente e com melhores tempos de resposta ao usuário comparado com outras metodologias de avaliadas. Também melhorou a distribuição de consumo de recursos entre os servidores.
Currently, most services balance the load between distinct hosts forwarding connections with a load balance strategy in front. Usually, a dedicated appliance is responsible to performthe balance and may be a fault point and become expensive. The new concepts of computer network architecture with Software-Defined Networking (SND) are changing the network management, absorving specialist services, automating process and building intelligence to statics rules with loads of delivery options. The load balance is a specialized service that can enjoy in a positive way of SDN concepts, with low costs, in a flexible way as per the process needs instead of a plastered process definitions that occurs in many actual models. The OpenFlow protocol definition allow us to use a new solution to address this issue. This work shows a load balance purpose between distinct hosts with the destination change of connections made by the network core. It calls Core-based load balance (CoreLB) because the specialized load balance service move to the network core where the package forwarding is naturally made. This solution intend to use the SNMP protocol to analyse the hosts resources to evaluate server’s load. Using the network forwarding statistics and OS load informations, an efficient solution of load balance, the metodology proved to be efficient with better users’ response times average of 19% than no balanced scenario as well as around 9% better than others load balance strategies and a properly balance consumption of resources from hosts side. This process can be inhered in distinct models, however, this research intend to evaluate Web Services.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Shin-Rung, und 陳信榮. „Memory Disambiguation using Load Forwarding“. Thesis, 2004. http://ndltd.ncl.edu.tw/handle/82876806775698616115.

Der volle Inhalt der Quelle

Annotation:

碩士
大同大學
資訊工程學系(所)
92
The superscalar processor must issue any instructions as early as possible for instruction-level parallelism. But load instructions would be issued with memory dependencies are known. Memory dependencies cannot be resolved prior to execution; therefore load instructions would be issued with prior store effective address calculated. This paper introduces the load forwarding history table (LFHT) for speculative executed load instructions by using load-forwarding behavior. This mechanism can be used to permit load instructions to be speculative executed without wait for prior store effective address calculated. The LFHT might provide about 9% average speedup up over baseline architecture in our scheme.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lai, Kai-Wun, und 賴楷文. „A Traffic Load Mitigation Mechanism for Packet Forwarding in SDN Networks“. Thesis, 2018. http://ndltd.ncl.edu.tw/handle/q8m8fu.

Der volle Inhalt der Quelle

Annotation:

碩士
國立中興大學
資訊科學與工程學系
106
During packet forwarding, a packet is susceptible to being dropped, delayed, modified, injected, or hijacked. The methods proposed for packet forwarding verification (PVF) impose additional load and may cause controller overloading in software-defined networking (SDN). In this thesis, we focus on how to efficiently mitigate traffic flow without rerouting a packet in SDN and on how to apply PVF in our module. We proposed a lightweight packet delivery scheme to mitigate the communication load between the SDN controller and switches. When an initial packet-in packet arrives, the packet’s data is deposited on the controller, known as a depository buffer, till the egress switch is reached. We set the packet lifetime and flow check time for PVF. The simulation environment in this work uses an open network operating system and Mininet with the “fat tree” and “spine leaf” topologies. Using our method, the traffic load could be reduced by up to 85% (on average, 73%). In principle, if a controller can afford more than 100 switches, the maximum traffic can be reduced by up to 91%.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Load forwarding"

Canada. Parliament. House of Commons. Bill: An act to incorporate the "Quebec and Ottawa Lumber Forwarding Company". Ottawa: I.B. Taylor, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act to amend the act 27 Vict. c. 50, incorporating the London and Canadian Loan and Agency Company (Limited). Ottawa: I.B. Taylor, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Office, Great Britain Colonial. Return to an address of the House of Lords, dated 15th March 1853: For, copies or extracts of all correspondence on the subject of clergy reserves (in continuation of papers presented February 1852); also, returns for every year since 1840 of the amount of the Clergy Reserves Fund, Canada, formed under Act 3 & 4 Vict. c. 78, s. 3; also, return of the extent of the clergy reserves in Canada, the number of acres unsold, and their probable value; and also, copies of letter from the Lord Bishop of Quebec to the Duke of Newcastle on the subject of clergy reserves in Canada, and a draft despatch from Sir John Pakington to the Earl of Elgin, in reply to His Lordship's despatch forwarding an address to the Queen on the subject of the clergy reserves. [London: HMSO, 2001.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act respecting the Brandon and South-Western Railway Company. Ottawa: S.E. Dawson, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act respecting the Ontario Mutual Life Assurance Company, and to change its name to "The Mutual Life Assurance Company of Canada". Ottawa: S.E. Dawson, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act respecting the Canada Central Railway Company. Ottawa: I.B. Taylor, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Commons, Canada Parliament House of. Bill: An act to impose certain restrictions on immigration. Ottawa: S.E. Dawson, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. [Bill]: An act respecting the Hereford Railway Company. Ottawa: S.E. Dawson, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act to amend the Dominion electio[ns] act by providing for use of Macdona[ld] voting machines instead of ballots. Ottawa: S.E. Dawson, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Canada. Parliament. House of Commons. Bill: An act respecting the Canadian Pacific Railway Company. Ottawa: S.E. Dawson, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Load forwarding"

Lee, Youngseok, und Yanghee Choi. „An Adaptive Flow-Level Load Control Scheme for Multipath Forwarding“. In Networking — ICN 2001, 771–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47728-4_76.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Arab, Mohammad Norouzi, Seyedeh Leili Mirtaheri, Ehsan Mousavi Khaneghah, Mohsen Sharifi und Meisam Mohammadkhani. „Improving Learning-Based Request Forwarding in Resource Discovery through Load-Awareness“. In Lecture Notes in Computer Science, 73–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22947-3_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Selkälä, Arto, Mario Callegaro und Mick P. Couper. „Automatic Versus Manual Forwarding in Web Surveys - A Cognitive Load Perspective on Satisficing Responding“. In Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis, 130–55. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-49570-1_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Richter, H. O., D. Domkin, G. H. Elcadi, H. W. Andersson, H. Högberg und M. Englund. „A Comparison of Mental and Visual Load Resulting from Semi-automated and Conventional Forest Forwarding: An Experimental Machine Simulation Study“. In Advances in Intelligent Systems and Computing, 199–208. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96059-3_22.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Boucadair, Mohamed, und David Binet. „Issues with Current Internet Architecture“. In Solutions for Sustaining Scalability in Internet Growth, 1–16. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4305-5.ch001.

Der volle Inhalt der Quelle

Annotation:

Internet actors should work on an action plan to mitigate the increase of Routing Information Base (RIB) and Forwarding Information Base (FIB) table sizes and the load induced by routing updates churn (BGP Instability Report, n.d.).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Banerjee, Anuradha. „Fuzzy-Controlled Energy-Conservation Technique (FET) for Mobile ad hoc Networks“. In Handbook of Research on Computational Intelligence for Engineering, Science, and Business, 556–70. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2518-1.ch021.

Der volle Inhalt der Quelle

Annotation:

Nodes in ad hoc networks have limited battery power; hence, they require energy efficient techniques to improve average node lifetime and network performance. Maintaining energy efficiency in network communication is really challenging because highest energy efficiency is achieved if all the nodes are switched off and maximum network throughput is obtained if all the nodes are fully operational, i.e. always turned on. A promising energy conservation technique for the ad hoc networks must maintain effective packet forwarding capacity while turning off the network interface of very busy nodes for some time and redirecting the traffic through some comparatively idle nodes roaming around them. This also helps in fair load distribution in the network and maintenance of network connectivity by reducing the death rate (complete exhaustion of nodes). The present chapter proposes a fuzzy-controlled energy conservation technique (FET) that identifies the busy and idle nodes to canalize some traffic of busy nodes through the idle ones. In simulation section, the FET embedded versions of several state-of-the-art routing protocols in ad hoc networks are compared with their ordinary versions and the results quite emphatically establish the superiority of FET-embedded versions in terms of packet delivery ratio, message cost, and network energy consumption. End-to-end delay also reduces significantly.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Danyang, Qin, Ma Lin, Sha Xuejun und Xu Yubin. „Realization of Route Reconstructing Scheme for Mobile Ad hoc Network“. In Innovations in Mobile Multimedia Communications and Applications, 62–79. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-563-6.ch005.

Der volle Inhalt der Quelle

Annotation:

Mobile Ad Hoc Network (MANET) is a centerless packet radio network without fixed infrastructure. In recent years tremendous attentions have been received because of capabilities of self-configuration and self-maintenance. However, attenuation and interference caused by node mobility and wireless channels sharing weaken the stability of communication links especially in ubiquitous MANET. A mathematical exploring model for next-hop node has been established. The negative impact of wireless routes discontinuity on pervasive communication is alleviated by a novel route reconstructed scheme proposed in this paper based on restricting the route requirement zone into a pie slice region on intermediate nodes according the solution of the exploring equation. The scheme is an effective approach to increase survivability and reduce average end-to-end delay during route maintenance as well as allowing continuous packet forwarding for fault resilience so as to support mobile multimedia communication. The ns-2 based simulation results show remarkable packets successful delivery rate and end-to-end delay improvements of source-initiated routing protocol with route reconstructing scheme, and especially in the case of high dynamic environments with heavy traffic loads, more robust and scalable performance will be obtained.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Load forwarding"

KALEJA, Santa, Agris ZIMELIS, Andis Lazdins und Per Olof Johansson. „COMPARISON OF PRODUCTIVITY OF KRANMAN BISON 10000 FORWARDER IN STANDS HARVESTED WITH HARVESTER AND CHAINSAW“. In RURAL DEVELOPMENT. Aleksandras Stulginskis University, 2018. http://dx.doi.org/10.15544/rd.2017.199.

Der volle Inhalt der Quelle

Annotation:

The aim of this study is to investigate potential uses of Kranman Bison 10000 6WD forwarder in stands, where roundwood is extracted with a chainsaw and Vimek 404 T5 harvester in normal and difficult forwarding conditions. Productivity of Kranman forwarder was compared with medium-sized John Deere 810 forwarder under normal conditions. In total 230 loads were forwarded during the study, including 63 loads from areas, harvested with a chainsaw, and 167 loads from areas, harvested with Vimek 404 harvester. The average forwarded load is 2.0 m³ (the maximum load is 2.5 m³ therefore the average load capacity is 80%). In average 33 minutes of productive work time were spent by forwarding one load (the proportion of productive working time is 94% from total engine hours of the machine). The average length of forwarding road in trials is 286 m. In normal conditions forwarding of 1 m³ of roundwood extracted with a chainsaw takes 15 minutes of productive working time, but in difficult forwarding conditions the time consumption increases by 13%. The average forwarder fuel consumption is 1.8 L per hour. Accordingly, 0.8 L of fuel are consumed to forward 1 m³ roundwood. In comparison, John Deere 810 under similar conditions consumed 1.6 L fuel to forward 1 m³ roundwood. Study results prove that the best application of Kranman Bison 10000 is forwarding small stands or individual trees logged with a chainsaw. Forwarder can work on soils with low bearing capacity, however productivity can be significantly reduced by stumps and uneven terrain.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sahaly, Sinda, und Philippe Christin. „Inter-MAC forwarding and load balancing per flow“. In 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC 2009). IEEE, 2009. http://dx.doi.org/10.1109/pimrc.2009.5449933.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shi, Weiguang, Mike H. MacGregor und Pawel Gburzynski. „A scalable load balancer for forwarding internet traffic“. In the 2005 symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1095890.1095911.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ahmad, Nur Zaimah, Megat F. Zuhairi, Hassan Dao und Eiad Yafi. „DNS Server Caching and Forwarding with Load Balance“. In 2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM). IEEE, 2020. http://dx.doi.org/10.1109/imcom48794.2020.9001768.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yun Zhu und Weirong Jiang. „Load-aware bidirectional pipeline construction for terabit IP forwarding“. In 2009 43rd Annual Conference on Information Sciences and Systems (CISS). IEEE, 2009. http://dx.doi.org/10.1109/ciss.2009.5054809.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bellache, Thiwiza, Oyunchimeg Shagdar, Sondes Kallel und Samir Tohme. „Reducing channel load by enhanced contention based forwarding in vehicular networks“. In 2017 International Conference on Selected Topics in Mobile and Wireless Networking (MoWNeT). IEEE, 2017. http://dx.doi.org/10.1109/mownet.2017.8045943.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gao, Ye, Ryusuke Egawa, Hiroyuki Takizawa und Hiroaki Kobayashi. „A Load-Forwarding Mechanism for the Vector Architecture in Multimedia Applications“. In 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD). IEEE, 2010. http://dx.doi.org/10.1109/dsd.2010.93.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Al Fuad, Md Abdullah, Md Safiullah Sarker Sabuj, Mohammed Zunaid Hasan und Mahmuda Naznin. „RLB: Randomized load balanced packet forwarding strategy in name based data networking“. In 2017 4th International Conference on Networking, Systems and Security (NSysS). IEEE, 2017. http://dx.doi.org/10.1109/nsyss2.2017.8267798.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sandhu, M. M., N. Javaid, M. Akbar, F. Najeeb, U. Qasim und Z. A. Khan. „FEEL: Forwarding Data Energy Efficiently with Load Balancing in Wireless Body Area Networks“. In 2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2014. http://dx.doi.org/10.1109/aina.2014.95.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yu, Jie, Guangming Liu, Wenrui Dong, Xiaoyong Li, Jian Zhang und Fuxing Sun. „On the load imbalance problem of I/O forwarding layer in HPC systems“. In 2017 3rd IEEE International Conference on Computer and Communications (ICCC). IEEE, 2017. http://dx.doi.org/10.1109/compcomm.2017.8322970.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!