Relevant bibliographies by topics / Interest Forwarding Strategy

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Interest Forwarding Strategy'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Interest Forwarding Strategy.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Interest Forwarding Strategy"

1

Akinwande, Olumide. "Interest Forwarding in Named Data Networking Using Reinforcement Learning." Sensors 18, no. 10 (October 8, 2018): 3354. http://dx.doi.org/10.3390/s18103354.

Full text
Abstract:
In-network caching is one of the key features of information-centric networks (ICN), where forwarding entities in a network are equipped with memory with which they can temporarily store contents and satisfy en route requests. Exploiting in-network caching, therefore, presents the challenge of efficiently coordinating the forwarding of requests with the volatile cache states at the routers. In this paper, we address information-centric networks and consider in-network caching specifically for Named Data Networking (NDN) architectures. Our proposal departs from the forwarding algorithms which primarily use links that have been selected by the routing protocol for probing and forwarding. We propose a novel adaptive forwarding strategy using reinforcement learning with the random neural network (NDNFS-RLRNN), which leverages the routing information and actively seeks new delivery paths in a controlled way. Our simulations show that NDNFS-RLRNN achieves better delivery performance than a strategy that uses fixed paths from the routing layer and a more efficient performance than a strategy that retrieves contents from the nearest caches by flooding requests.
APA, Harvard, Vancouver, ISO, and other styles
2

Bazmi, Parisa, and Manijeh Keshtgary. "A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING." IIUM Engineering Journal 17, no. 2 (November 30, 2016): 59–69. http://dx.doi.org/10.31436/iiumej.v17i2.617.

Full text
Abstract:
Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding strategy (NNTF) is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.
APA, Harvard, Vancouver, ISO, and other styles
3

Pu, Cong. "Pro NDN : MCDM-Based Interest Forwarding and Cooperative Data Caching for Named Data Networking." Journal of Computer Networks and Communications 2021 (March 18, 2021): 1–16. http://dx.doi.org/10.1155/2021/6640511.

Full text
Abstract:
Named data networking (NDN), as a specific architecture design of information-centric networking (ICN), has quickly became a promising candidate for future Internet architecture, where communications are driven by data names instead of IP addresses. To realize the NDN communication paradigm in the future Internet, two important features, stateful forwarding and in-network caching, have been proposed to cope with drawbacks of host-based communication protocols. The stateful forwarding is designed to maintain the state of pending Interest packets to guide Data packets back to requesting consumers, while the in-network caching is used to reduce both network traffic and data access delay to improve the overall performance of data access. However, the conventional stateful forwarding approach is not adaptive and responsive to diverse network conditions because it fails to consider multiple network metrics to make Interest forwarding decision. In addition, the default in-network caching strategy relies on storing each received Data packet regardless of various caching constraints and criteria, which causes the routers in the vicinity of data producers to suffer from excessive caching overhead. In this paper, we propose the Pro NDN , a novel stateful forwarding and in-network caching strategy for NDN networks. The Pro NDN consists of multicriteria decision-making (MCDM) based interest forwarding and cooperative data caching. The basic idea of the MCDM-based interest forwarding is to employ Technique for Order Performance by Similarity to Idea Solution (TOPSIS) to dynamically evaluate outgoing interface alternatives based on multiple network metrics and objectively select an optimal outgoing interface to forward the Interest packet. In addition, the cooperative data caching consists of two schemes: CacheData, which caches the data, and CacheFace, which caches the outgoing interface. We conduct extensive simulation experiments for performance evaluation and comparison with prior schemes. The simulation results show that the Pro NDN can improve Interest satisfaction ratio and Interest satisfaction latency as well as reduce hop count and Content Store utilization ratio.
APA, Harvard, Vancouver, ISO, and other styles
4

Akther, Nazma, Kingshuk Dhar, Shahid Md Asif Iqbal, Mohammed Nurul Huda, and Asaduzzaman. "Interest forwarding strategy in Named Data Networks (NDN) using Thompson Sampling." Journal of Network and Computer Applications 205 (September 2022): 103458. http://dx.doi.org/10.1016/j.jnca.2022.103458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

din, Muhammad Salah ud, Muhammad Atif Ur Rehman, and Byung-Seo Kim. "CIDF-WSN: A Collaborative Interest and Data Forwarding Strategy for Named Data Wireless Sensor Networks." Sensors 21, no. 15 (July 30, 2021): 5174. http://dx.doi.org/10.3390/s21155174.

Full text
Abstract:
Recent years have witnessed the huge popularity of Information-Centric Networking (ICN) and its realization as Named Data Networking (NDN) in the context of wireless sensor networks (WSNs). The participating nodes in WSNs are usually equipped with a single radio interface. The existing solutions lack in providing the efficient next forwarder selection in NDN-based single radio WSNs. In this work, we propose a collaborative Interest and Data Forwarding (CIDF-WSN) Strategy for Named Data Wireless Sensor Networks. CIDF-WSN develop a Neighbor Information Base (NFIB) which enables the node to select the optimal next-hop relay in Interest packet forwarding. An efficient Interest packet processing mechanism assisted by the Interest Cache Table (ICT) is provided to avoid Interest packets loss and frequent re-transmissions. In addition, CIDF-WSN also provides a robust Data packet transfer mechanism accompanied by the Temp Cache Table (TCT) to avoid Data packet losses and to ensure well-timed content delivery. Simulation results reveal that CIDF-WSN outperforms the recently published works in terms of Interest satisfaction rate, total energy consumption, Data retrieval delays, and communication overhead.
APA, Harvard, Vancouver, ISO, and other styles
6

de Sousa, Antonio M., Francisco R. C. Araujo, and Leobino N. Sampaio. "A Link-Stability-Based Interest-Forwarding Strategy For Vehicular Named Data Networks." IEEE Internet Computing 22, no. 3 (May 2018): 16–26. http://dx.doi.org/10.1109/mic.2018.032501512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Guo, Xian, Baobao Wang, Yongbo Jiang, Di Zhang, and Laicheng Cao. "Homomorphic encryption based privacy-aware intelligent forwarding mechanism for NDN-VANET." Computer Science and Information Systems, no. 00 (2022): 51. http://dx.doi.org/10.2298/csis220210051g.

Full text
Abstract:
Machine learning has been widely used for intelligent forwarding strategy in Vehicular Ad-Hoc Networks (VANET). However, machine learning has serious security and privacy issues. BRFD is a smart Receiver Forwarding Decision solution based on Bayesian theory for Named Data Vehicular Ad-Hoc Networks (NDN-VANET). In BRFD, every vehicle that received an interest packet is required to make a forwarding decision according to the collected network status information. And then decides whether it will forward the received interest packet or not. Therefore, the privacy information of a vehicle can be revealed to other vehicles during information exchange of the network status. In this paper, a Privacy-Aware intelligent forwarding solution PABRFD is proposed by integrating Homomorphic Encryption (HE) into the improved BRFD. In PABRFD, a secure Bayesian classifier is used to resolve the security and privacy issues of information exchanged among vehicle nodes. We informally prove that this new scheme can satisfy security requirements and we implement our solution based on HE standard libraries CKKS and BFV. The experimental results show that PABRFD can satisfy our expected performance requirements.
APA, Harvard, Vancouver, ISO, and other styles
8

Bellaj, Mohammed, Najib Naja, and Abdellah Jamali. "Distributed Mobility Management Support for Low-Latency Data Delivery in Named Data Networking for UAVs." Future Internet 16, no. 2 (February 10, 2024): 57. http://dx.doi.org/10.3390/fi16020057.

Full text
Abstract:
Named Data Networking (NDN) has emerged as a promising architecture to overcome the limitations of the conventional Internet Protocol (IP) architecture, particularly in terms of mobility, security, and data availability. However, despite the advantages it offers, producer mobility management remains a significant challenge for NDN, especially for moving vehicles and emerging technologies such as Unmanned Aerial Vehicles (UAVs), known for their high-speed and unpredictable movements, which makes it difficult for NDN to maintain seamless communication. To solve this mobility problem, we propose a Distributed Mobility Management Scheme (DMMS) to support UAV mobility and ensure low-latency content delivery in NDN architecture. DMMS utilizes decentralized Anchors to forward proactively the consumer’s Interest packets toward the producer’s predicted location when handoff occurs. Moreover, it introduces a new forwarding approach that combines the standard and location-based forwarding strategy to improve forwarding efficiency under producer mobility without changing the network structure. Using a realistic scenario, DMMS is evaluated and compared against two well-known solutions, namely MAP-ME and Kite, using the ndnSIM simulations. We demonstrate that DMMS achieves better results compared to Kite and MAP-ME solutions in terms of network cost and consumer quality-of-service metrics.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Fei, YongJun Xu, Lin Wu, Longyijia Li, Dan Liu, and Liehuang Zhu. "A PEFKS- and CP-ABE-Based Distributed Security Scheme in Interest-Centric Opportunistic Networks." International Journal of Distributed Sensor Networks 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/469076.

Full text
Abstract:
Security is a crucial issue in distributed applications of multihop wireless opportunistic network due to the features of exposed on the fly communication, relaxed end-to-end connectivity, and vague destinations literately. In this paper, we focus on problems of user privacy leakage and end-to-end confidentiality invasion in content-based or interest-centric wireless opportunistic network. And we propose a public-encryption-with-fuzzy-keyword-search- (PEFKS-) and ciphertext-policy-attribute-based-encryption- (CP-ABE-) based distributed security scheme by refining and compromising two-pairing-based encryption, searchable encryption, and attribute-based encryption. Our scheme enables opportunistic forwarding according to fuzzy interests preserving full privacy of users and ensures end-to-end confidentiality with a fine-grained access control strategy in an interest-centric scenario of large-scale wireless opportunistic networks. Finally, we analyze and evaluate the scheme in terms of security and performance.
APA, Harvard, Vancouver, ISO, and other styles
10

Buvanesvari, Ramachandira, and Kanagaraj Joseph. "An Efficient Secured PIT Management and Attack Detection Strategy Enhanced by CSOA-DCNN Algorithm in a Named Data Networking (NDN)." International Journal of Intelligent Engineering and Systems 14, no. 1 (February 28, 2021): 103–12. http://dx.doi.org/10.22266/ijies2021.0228.11.

Full text
Abstract:
Named Data Networking (NDN) is a developing Internet design that utilizes a new network communication model dependent on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves an important role of recording Interest packet information. In managing PIT, the issue of flow PIT measuring has been very challenging because of the huge use of long Interest lifetime especially when there is no adaptable replacement strategy, subsequently affecting PIT performance. Named Data Networking (NDN) might experience some emerging threats such as Interest Flooding Attacks (IFA). In this paper, we focus on the IFA that can seriously devour the memory resource for the Pending Interest Table (PIT) of each included NDN router by flooding a huge amount of malicious Interests with spoofed names. To extricate the pressure of PIT attacked by IFA, we propose a methodology of efficient Secured PIT management and attack detection strategy by using a cuckoo search optimization algorithmDeep convolutional neural network (CSOA-DCNN) algorithm in Named Data Network. The CSO algorithm initially utilizes a learning technique and afterward considers improved search operators and deep convolutional neural network architecture (DCNN) for classification. The network simulation tool is utilized to design and calculate PIT management. The results of the study on a 20 Gbps gateway trace shows that the corresponding PIT contains 1.5 M entries, and the lookup, insert and delete frequencies are 1.4 M/s, 0.9 M/s and 0.9 M/s. The contribution of this study is significant for Interest packet management in NDN routing and forwarding systems.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Interest Forwarding Strategy"

1

Malik, Hirah. "Efficient Network Coding Protocols for Information-Centric Networks." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG096.

Full text
Abstract:
Le volume de données échangées sur l'Internet a augmenté de façon spectaculaire au cours des dernières décennies. Le nombre croissant d'utilisateurs, d'appareils connectés et la popularité des contenus vidéo ont fait exploser la demande pour de nouvelles méthodes de communication capables de gérer le volume croissant des données. Les réseaux centrés sur l'information (Information Centric Networking, ICN) ont été proposés comme une alternative aux réseaux IP traditionnels. Dans les réseaux ICN, les consommateurs demandent au réseau un contenu par son nom via des paquets « intérêt », et reçoivent des données en réponse à leurs demandes sans avoir à se soucier de l'emplacement du contenu dans le réseau. Les réseaux ICN permettent la mise en cache dans le réseau et prennent naturellement en charge l'utilisation de chemins multiples. Néanmoins, le débit maximal ne peut être atteint que si le contenu est demandé sur un ensemble optimal d'arbres de multidiffusion. Le calcul de ces arbres de multidiffusion est difficile à mettre en œuvre sur de grands réseaux dynamiques et nécessite une coordination entre les entités du réseau. Le codage réseau (Network Coding) a été récemment introduit dans les réseaux ICN afin d'améliorer la diffusion par l'utilisation de chemins multiples et la mise en cache du contenu sans qu'une coordination soit nécessaire. Le défi dans le cas du codage réseau est d'obtenir un contenu codé linéairement indépendant en réponse à de multiples requêtes parallèles par un ou plusieurs consommateurs. Dans cette thèse, nous analysons certains travaux antérieurs qui intègrent le codage réseau et les réseaux ICN et identifions certains problèmes clés auxquels ils ont été confrontés. Nous proposons une solution efficace où les clients ajoutent des informations compactes aux paquets « intérêt » afin d'assurer l'indépendance linéaire du contenu codé. Cette thèse propose une architecture, MICN, qui intègre un codage réseau au-dessus d'une implémentation ICN basée sur les intérêts : Named Data Networking (NDN). L'architecture proposée permet de résoudre certains des problèmes rencontrés par les solutions ICN avec du codage réseau présentées dans le passé. Une nouvelle construction appelée MILIC (Multiple Interests for Linearly Independent Content) est introduite. Elle impose des contraintes sur la façon dont les réponses aux intérêts sont codées, dans le but d'obtenir des contenus linéairement indépendants en réponse à des intérêts multiples. L'analyse numérique et les simulations montrent que la construction MILIC fonctionne bien avec le codage réseau pour NDN, et que le protocole MICN offre un débit proche de l'optimum dans certains scénarios. Les performances du protocole MICN se comparent favorablement aux protocoles existants. Il présente des avantages significatifs lorsqu'on considère le nombre total de paquets transmis dans le réseau et dans le cas de liens pouvant subir des pertes. Plusieurs techniques de transport modifiées et intégrées dans le protocole MICN sont proposées afin d'optimiser l'utilisation des ressources du réseau tout en conservant un débit élevé. MILIC nous a aussi amené à considérer le problème de la construction de sous-ensembles de vecteurs dans un espace vectoriel donné, tels que lorsque l'on choisit arbitrairement un vecteur de chaque sous-ensemble, les vecteurs sélectionnés sont linéairement indépendants. Cette thèse le formalise comme un problème mathématique et étudie quelques solutions alternatives à la construction MILIC. Enfin, la thèse prouve qu'une large classe de solutions à ce problème est équivalente à MILIC
The amount of data exchanged over the Internet has grown drastically over the past decades. The increasing number of users, connected devices, and the popularity of video content have surged the demand for new communication methods that can deal with the growing volume of data traffic. Information-Centric Networking (ICN) has been proposed as an alternative to traditional IP-based networks. In ICN, consumers request named content via Interest packets to the network and receive data as a response to their request without taking care of the location of the content in the network. ICN allows in-network caching and naturally supports the use of multiple paths. Nevertheless, the maximum throughput can only be achieved if the content is requested over an optimal set of multicast trees. The computation of such multicast trees is hard to scale over large dynamic networks and requires coordination among network entities. Network coding has been recently introduced in ICN to improve multi-path dissemination and caching of content without the need for coordination. The challenge in the case of network coding is to get independent coded content in response to multiple parallel Interests by one or several consumers. In this thesis, we analyze some previous works that integrate network coding and ICN and identify some key issues these works face. We introduce an efficient solution where clients add compact information to Interest packets in order to ensure linear independence of content in network-coded ICN. This thesis proposes an architecture, MICN, that provides network coding on top of an Interest-based ICN implementation: Named Data Networking (NDN). The proposed architecture helps alleviate the issues faced by network coding-enabled ICN solutions presented in the past. A novel construction called MILIC (Multiple Interests for Linearly Independent Content) is introduced that imposes constraints on how the replies to Interests are coded, intending to get linearly independent contents in response to multiple Interests. Numerical analysis and simulations illustrate that the MILIC construction performs well with network-coded NDN, and the MICN protocol yields close to optimal throughput in some scenarios. The performance of MICN compares favorably to existing protocols. It shows significant benefits when considering the total number of transmitted packets in the network and in the case of lossy links. Several modified forwarding techniques integrated into the MICN protocol are proposed to optimize the network resource utilization while keeping a high throughput. MILIC led us to consider the problem of constructing subsets of vectors from a given vector space, such that when drawing arbitrarily one vector from each subset, the selected vectors are linearly independent. This thesis considers it as a mathematical problem and studies some alternative solutions to the MILIC construction. Finally, the thesis proves that a large family of solutions to this problem are equivalent to MILIC
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Interest Forwarding Strategy"

1

Liu, Jun. Shifting Dynamics of Contention in the Digital Age. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190887261.001.0001.

Full text
Abstract:
Over the past decades, waves of political contention involving the use of information and communication technologies have swept across the globe. The phenomenon stimulates the scholarship on digital communication technologies and contentious collective action to thrive as an exciting, relevant, but highly fragmentary and contested field with disciplinary boundaries. To advance the interdisciplinary understanding, Shifting Dynamics of Contention in the Digital Age outlines a communication-centered framework that articulates the intricate relationship between technology, communication, and contention. It further prods us to engage more critically with existing theories from communication, sociology, and political science on digital technologies and political movements. Given the theoretical endeavor, Shifting Dynamics of Contention in the Digital Age systematically explores, for the first time, the influence of mobile technology on political contention in China, the country with the world’s largest number of mobile and Internet users. Using first-hand in-depth interview and fieldwork data, it tracks the strategic choice of mobile phones as repertoires of contention, illustrates the effective mobilization of mobile communication on the basis of its strong and reciprocal social ties, and identifies the communicative practice of forwarding officially alleged “rumors” as a form of everyday resistance. Through this ground-breaking study, Shifting Dynamics of Contention in the Digital Age presents a nuanced portrayal of an emerging dynamics of contention—both its strengths and limitations—through the embedding of mobile communication into Chinese society and politics.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Interest Forwarding Strategy"

1

Gao, Qiang, Tetsuya Shigeyasu, and Chunxiang Chen. "Routing Strategy for Avoiding Obstacles During Message Forwarding in Mobile Ad-Hoc Network." In Innovative Mobile and Internet Services in Ubiquitous Computing, 132–43. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79728-7_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fgee, El-Bahlul, Shyamala Sivakumar, William J. Phillips, and William Robertson. "Scalable Intra and Inter Domain IPv6 QoS Management and Pricing Scheme." In Intelligent Quality of Service Technologies and Network Management, 256–79. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-791-6.ch014.

Full text
Abstract:
Network multimedia applications constitute a large part of Internet traffic and guaranteed delivery of such traffic is a challenge because of their sensitivity to delay, packet loss and higher bandwidth requirement. The need for guaranteed traffic delivery is exacerbated by the increasing delay experienced by traffic propagating through more than one QoS domain. Hence, there is a need for a flexible and a scalable QoS manager that handles and manages the needs of traffic flows throughout multiple IPv6 domains. The IPv6 QoS manager, presented in this paper, uses a combination of the packets’ flow ID and the source address (Domain Global Identifier (DGI)), to process and reserve resources inside an IPv6 domain. To ensure inter-domain QoS management, the QoS domain manager should also communicate with other QoS domains’ managers to ensure that traffic flows are guaranteed delivery. In this scheme, the IPv6 QoS manager handles QoS requests by either processing them locally if the intended destination is located locally or forwards the request to the neighboring domain’s QoS manager. End-to-end QoS is achieved with an integrated admission and management unit. The feasibility of the proposed QoS management scheme is illustrated for both intra- and inter-domain QoS management. The scalability of the QoS management scheme for inter-domain scenarios is illustrated with simulations for traffic flows propagating through two and three domains. Excellent average end-to-end delay results have been achieved when traffic flow propagates through more than one domain. Simulations show that packets belonging to non-conformant flows experience increased delay, and such packets are degraded to lower priority if they exceed their negotiated traffic flow rates. Many pricing schemes have been proposed for QoS-enabled networks. However, integrated pricing and admission control has not been studied in detail. A dynamic pricing model is integrated with the IPv6 QoS manager to study the effects of increasing traffic flows rates on the increased cost of delivering high priority traffic flows. The pricing agent assigns prices dynamically for each traffic flow accepted by the domain manager. Combining the pricing strategy with the QoS manager allows only higher priority traffic packets that are willing to pay more to be processed during congestion. This approach is flexible and scalable as end-to-end pricing is decoupled from packet forwarding and resource reservation decisions. Simulations show that additional revenue is generated as prices change dynamically according to the network congestion status.
APA, Harvard, Vancouver, ISO, and other styles
3

Rodger, James A. "Using Continuous Voice Activation Applications in Telemedicine to Transform Mobile Commerce." In Advances in Mobile Commerce Technologies, 258–97. IGI Global, 2003. http://dx.doi.org/10.4018/978-1-59140-052-3.ch012.

Full text
Abstract:
This chapter is designed to relate the rationale used by the Department of Defense (DoD), for the military to adapt the principles of Mobile and Voice Commerce to meet increasing global crises and to find ways to more effectively manage manpower and time. A mobile Telemedicine package has been developed by the Department of Defense to collect and transmit near-real-time, far-forward medical data and to assess how this Web-based capability enhances management of the battlespace. Telemedicine has been successful in resolving uncertain organizational and technological military deficiencies and in improving medical communications and information management. The deployable, mobile teams are the centerpieces of this telemedicine package. These teams have the capability of inserting essential networking and communications capabilities into austere theaters and establishing an immediate means for enhancing health protection, collaborative planning, situational awareness, and strategic decision making through Web-based internet applications. In order to supplement this mobile commerce aspect of telemedicine, U.S. Navy ships have been utilized to integrate voice commerce interactive technologies to improve medical readiness and mobility. An experimental group was tasked to investigate reporting methods in health and environmental surveillance inspections to develop criteria for designing a lightweight, wearable computing device with voice interactive capability. This chapter is also designed to relate the rationale used by the Department of Defense and the Test and Evaluation (T&E) Integrated Product Team, in order to determine the military utility of the Joint Medical Operations—Telemedicine Advanced Concept Technology Demonstration (JMO-T ACTD) and continuous voice activation applications. Voice interactive computing devices are used to enhance problem solving, mobility and effectiveness in the battlespace. It improves efficiency through automated user prompts, enhanced data analysis, presentation, and dissemination tools in support of preventive medicine. The device is capable of storing, processing, and forwarding data to a server. The prototype devices have enabled quick, efficient, and accurate environmental surveillance. In addition to reducing the time needed to complete inspections, the device supported local reporting requirements and enhanced command-level intelligence. This chapter further focuses on developing a holistic model of implementing a strategy for mobile telemedicine. The model synthesizes current thinking on transformation into a holistic model and also explains the integrative influence of vision on the other four model components: environment, people, methodology, and IT perspective. The model was tested by Testing and Evaluating (T&E) the JMO-T ACTD. JMO-T ACTD has developed a very successful training program and is very aware of the importance of planned change. Top military officials, such as the Commander in Chief (CINC), are actively involved in change and are committed to people development through learning. The model served an applied purpose by allowing insights into how well the military organization fit current theory. The model also fit a theoretical purpose by organizing a holistic, comprehensive framework. Accordingly, we have organized and synthesized the literature into five interrelated components that act as a fundamental guide for research. The model also helped to identify a theoretical link and apply it to the internal operations of the military and its adaptation of mobile e-commerce principles to more effectively deliver telemedicine benefits to military personnel.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Interest Forwarding Strategy"

1

Khan, Muhammad Toaha Raza, Malik Muhammad Saad, Junho Seo, Syed Hassan Ahmed, and Dongkyun Kim. "Reliable interest forwarding strategy for underwater vehicular NDN." In SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3412841.3442061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Garcia-Luna-Aceves, J. J. "A fault-tolerant forwarding strategy for interest-based information centric networks." In 2015 IFIP Networking Conference (IFIP Networking). IEEE, 2015. http://dx.doi.org/10.1109/ifipnetworking.2015.7145302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ahdan, Syaiful, Galih Nugraha Nurkahfi, Ade Nurhayati, Ratna Mayasari, Ridha Muldina Negara, and Nana Rachmana Syambas. "Forwarding Strategy Performance using Interest Variation Scheme in Named Data Networking." In 2022 8th International Conference on Wireless and Telematics (ICWT). IEEE, 2022. http://dx.doi.org/10.1109/icwt55831.2022.9935402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kalghoum, Anwar, Sonia Mettali Gammar, and Leila Azouz Saidane. "Performance evaluation of interest traffic generation and forwarding strategy impact in ICN." In 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA). IEEE, 2016. http://dx.doi.org/10.1109/aiccsa.2016.7945734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Qian, Jie, Yantao Yu, and Xing Chang. "A Delay-based Interest Packet Forwarding Strategy in Vehicular Named Data Networking." In 2022 2nd Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS). IEEE, 2022. http://dx.doi.org/10.1109/acctcs53867.2022.00078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Udugama, Asanga, Xinyi Zhang, Koojana Kuladinithi, and Carmelita Goerg. "An On-demand Multi-Path Interest Forwarding strategy for content retrievals in CCN." In NOMS 2014 - 2014 IEEE/IFIP Network Operations and Management Symposium. IEEE, 2014. http://dx.doi.org/10.1109/noms.2014.6838389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yan, Xianyi, and Bo Xiao. "Hybrid forwarding strategy pressure-based routing for underwater wireless sensor network." In Third International Conference on Green Communication, Network, and Internet of Things (CNIoT 2023), edited by Shiling Zhang and Hongzhi Wang. SPIE, 2023. http://dx.doi.org/10.1117/12.3010400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cao, Jiabao, Lijuan Wang, Jinfeng Dou, Lei Chu, and Changrui Qu. "Objective Function Optimization Based Time-competition Forwarding Strategy in Internet of Marine Things." In ICCAI '20: 2020 6th International Conference on Computing and Artificial Intelligence. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3404555.3404631.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shi, Shanshan, Jun Li, Bin Han, Haibo Wu, Yuxiang Ma, Qian Dong, and Hans D. Schotten. "Multi-Path Forwarding Strategy for Named Data Networking Based on Pending Interests and Available Bandwidth." In 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom). IEEE, 2021. http://dx.doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barbosa Cunha, Ilane Karise, Joaquim Celestino Junior, Marcial Porto Fernandez, Ahmed Patel, and Maxwell E. Monteiro. "VNDN-Fuzzy - A strategy to mitigate the forwarding interests broadcast storm problem in VNDN networks." In 2023 International Conference on Information Networking (ICOIN). IEEE, 2023. http://dx.doi.org/10.1109/icoin56518.2023.10049030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Interest Forwarding Strategy' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography