FADED INFORMATION FIELD ARCHITECTURE
2. FADED INFORMATION FIELD ARCHITECTURE
Faded Information Field FIF Architecture has been proposed recently to optimize the service provision parameters on the network [5]. The details of this technology can be found elsewhere; only essential features will be reviewed here. The goal of FIF is the effective provision of information in a network. This architecture is based on demand- oriented replication of information service to assure service availability and utilization. In a FIF system, the information is distributed on a number of nodes in the network rather than a localized node. The FIF architecture is depicted in Figure1. The service providers sense the demand trend of information and the most accessed segment of that information is allocated to a storing node. From the storing node the information service is further distributed to adjacent nodes, however, with less information content. The process continues in a recursive fashion and the information contents are distributed to more storing nodes away from the service provider SP. The so called information field created by this pruning process has the following key characteristics: • The information content stored on a node is inversely proportional to the distance of storing node from the SP. • Information update frequency on a storing node is inversely proportional to the distance of storing node from the SP. Thus nodes adjacent to the SP are easily and frequently updated compared to the nodes farther away from the SP. Figure 1. The layout of a Faded Information Field Architecture By allocating the most frequently accessed information to the nodes and by concentrating the majority of the information closer to the SP, the cost of service utilization user access time and cost of service provision information update are balanced. The system essentially consists of logically connected nodes through which users and service providers correspond. Mobile agents are used by both parties to acquire and provide information respectively, under evolvingchanging situations. The mobile agents MA generated by service providers are termed as push mobile agents Push MAs. Push MAs carry out the function of autonomous coordination and negotiation with other nodes for information fading according to network situation and the level of importance attached to the information. The level of importance of particular information content is based on its popularity, determined from a high hit rate of query. The pull mobile agents Pull MA are generated by users and they autonomously navigate in search of the required information on the network nodes in a step by step fashion. Once the required information is located, these agents report back to the source. The push and pull MAs have no direct correspondence with each other. The third important subsystem of a FIF is the node itself. It is a platform for both storage of information and program execution. It monitors the local information-based system conditions and autonomously makes decisions for allocation requests by the SP. Each subsystem is autonomous in terms of control to execute its operations and coordination with other nodes under evolving network conditions.3. ALGORITHMS TO CHOOSE NODES TO CREATE THE FADED
Parts
» INTRODUCTION ICTS2005 The Proceeding
» Opening Fundamental Operations of Mathematical Morphology
» Morphological filter Filter theorem
» Granulometry and size distribution
» PGPC texture model and estimation of the optimal structuring element: The PGPC
» CONCLUSIONS ICTS2005 The Proceeding
» Non-ergodicity parameters RESULTS AND DISCUSSIONS 1 Partial structure factors and
» SIMULATIONS CONCLUSION ICTS2005 The Proceeding
» IMAGE RECONSTRUCTION SYSTEM DESIGN
» RESULT CONCLUSION ICTS2005 The Proceeding
» MULTI-RESOLUTION HISTOGRAM TECHNIQUE DATA
» VALIDATION STRATEGY RESULTS AND DISCUSSION
» CONCLUSION ICTS2005 The Proceeding
» INTRODUCTION DISTILATION COLUMN AND ARTIFICIAL NEURAL NETWORK
» Using Temperature Correlation Using Flow Rate Correlation
» INTRODUCTION DETECTION OF SINGLE TREE FELLING WITH SOFT
» Supervised Fuzzy c-means Method
» Neural Network classification METHOD 1. Datasets
» Neural Network Classification Results
» Comparison of Classification Results
» DISCUSSIONS ICTS2005 The Proceeding
» CONCLUSION ACKNOWLEDGEMENT ICTS2005 The Proceeding
» Caching Access List BANDWIDTH MANAGEMENT IMPLEMENTATION
» Rate Limiting BANDWIDTH MANAGEMENT IMPLEMENTATION
» BANDWIDTH MANAGEMENT CONCEPTS RESULT
» The Architecture of UML Elements Model Element
» Diagram Element Editing SYSTEM ARCHITECTURE
» Server Application Architecture Undo
» INTRODUCTION IMPLEMENTATION TESTING ICTS2005 The Proceeding
» INTRODUCTION E-PURSE ICTS2005 The Proceeding
» Interfaces Verification Tool POS – Smart Card
» MULTI AGENT SYSTEM MAS A WEIGHTED-TREE SIMILARITY ALGORITHMS
» RESULTS ICTS2005 The Proceeding
» Facial Animation Morphing and Deformation Cross Dissolve
» Feature Morphing Mesh Morphing Text-to-Speech TTS Basic Block
» Text-to-Video Algorithm Text-To-Video Stake And Desain
» Suggestion CONCLUSION AND SUGGESTION 1 Conclusion
» The Concept SHARE-IT SYSTEM ARCHITECTURE
» SHARING SCENARIO CONCLUSION ICTS2005 The Proceeding
» The Bayesian Network Model and Modified Bayesian Optimization
» Designs and Implementation SCHEDULING MODEL AND IMPLEMENTATION
» Comparison Proposed Schedule with Real Schedule
» Face-to-Face Technique Long Distance Technique
» Scenario to motivate. Context_Selection Applikasi.
» INTRODUCTION ARCHITECTURE. CONCLUSION. ICTS2005 The Proceeding
» SUGGESTION ICTS2005 The Proceeding
» Data Flow Database Structure
» EXPERIMENTAL RESULT ICTS2005 The Proceeding
» Investment Stock Prototyping System Design
» Database Model Stock Valuation
» INTRODUCTION METHODOLOGY ICTS2005 The Proceeding
» Buffer Overrun Cryptography Random Numbers
» Anti-Tampering Error Handling Injection Flaws
» Encapsulate Field Restructuring Arrays
» Generating Secure Random Number Storing Deleting Passwords
» Smart Serialization Message Digest
» Convert Message with Private Key to Public Key
» INTRODUCTION CURRENT STATUS ICTS2005 The Proceeding
» INTRODUCTION PROPOSED SIMULATION MODEL
» PARALLELIZATION STRATEGY ICTS2005 The Proceeding
» EXPERIMENTS AND DISCUSSION CONCLUSION
» INTRODUCTION RESULTS AND DISCUSSION
» EXPERIMENTAL ICTS2005 The Proceeding
» RESULT AND DISCUSSION ICTS2005 The Proceeding
» Color segmentation SYSTEM CONFIGURATION
» FEATURE CHARACTERISTICS AND GENERAL RULE
» EXPERIMENTAL RESULT CONCLUSION ICTS2005 The Proceeding
» INTRODUCTION REVIEW OF LITERATURE
» Social Economics Impact. Restructuring Impact
» Manager Application Mobile Agent Generator MAG Mobile Agents MAs
» SNMP Table Polling SNMP Table Filtering
» BREAST CARCINOMA TUMOR ICTS2005 The Proceeding
» WATERSHED ALGORITHM METHODS ICTS2005 The Proceeding
» RESULT AND DISCUSION ICTS2005 The Proceeding
» FADED INFORMATION FIELD ARCHITECTURE
» ALGORITHMS TO CHOOSE NODES TO CREATE THE FADED
» SYSTEM SIMULATIONS ICTS2005 The Proceeding
» Model and Teory MODEL, TEORY, DESIGN, IMPLEMENTATION AND
» INTRODUCTION ANALYSIS AND RESULT
» INTRODUCTION A SIMPLE MODEL OF THE QUEUING SYSTEM
» SIMULATION RESULTS DISCUSSION ICTS2005 The Proceeding
» CONCLUSION INTRODUCTION ICTS2005 The Proceeding
» Dialog Processing ADDING NONVERBAL BEHAVIOUR
» Emotion Expression Experiment ADDING NONVERBAL BEHAVIOUR
» NATURAL LANGUAGE PROCESSING EMOTION REASONING
» Fuzzy Logic Control FLC System Planning
» Digital To Analog Converter DAC Motor Driver Position Sensor Display Unit
» INTRODUCTION CONCLUSION ICTS2005 The Proceeding
» Variable-Centered Rule Structure VARIABLE-CENTERED INTELLIGENT RULE SYSTEM
» Knowledge Refinement VARIABLE-CENTERED INTELLIGENT RULE SYSTEM
» Knowledge Building VARIABLE-CENTERED INTELLIGENT RULE SYSTEM
» Knowledge Inferencing VARIABLE-CENTERED INTELLIGENT RULE SYSTEM
» INTRODUCTION BASIC CONCEPTS OF FUZZY SETS
» Calculation of the Fitness Degree
» ESTIMATING MULTIPLE NULL VALUES IN RELATIONAL
» Chen’s [6] Result This Improving Method’s Result
» The Fuzzy Set HISTOGRAM THRESHOLDING
» Fuzzy Set Similarity HISTOGRAM THRESHOLDING
» EXPERIMENTAL RESULTS ICTS2005 The Proceeding
Show more