Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.818494
J. Yu, X. Yao, C. Choi, G. Gou
One of the important issues in data warehouse development is the selection of a set of views to materialize in order to accelerate a large number of on-line analytical processing (OLAP) queries. The maintenance-cost view-selection problem is to select a set of materialized views under certain resource constraints for the purpose of minimizing the total query processing cost. However, the search space for possible materialized views may be exponentially large. A heuristic algorithm often has to be used to find a near optimal solution. In this paper, for the maintenance-cost view-selection problem, we propose a new constrained evolutionary algorithm. Constraints are incorporated into the algorithm through a stochastic ranking procedure. No penalty functions are used. Our experimental results show that the constraint handling technique, i.e., stochastic ranking, can deal with constraints effectively. Our algorithm is able to find a near-optimal feasible solution and scales with the problem size well.
{"title":"Materialized view selection as constrained evolutionary optimization","authors":"J. Yu, X. Yao, C. Choi, G. Gou","doi":"10.1109/TSMCC.2003.818494","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818494","url":null,"abstract":"One of the important issues in data warehouse development is the selection of a set of views to materialize in order to accelerate a large number of on-line analytical processing (OLAP) queries. The maintenance-cost view-selection problem is to select a set of materialized views under certain resource constraints for the purpose of minimizing the total query processing cost. However, the search space for possible materialized views may be exponentially large. A heuristic algorithm often has to be used to find a near optimal solution. In this paper, for the maintenance-cost view-selection problem, we propose a new constrained evolutionary algorithm. Constraints are incorporated into the algorithm through a stochastic ranking procedure. No penalty functions are used. Our experimental results show that the constraint handling technique, i.e., stochastic ranking, can deal with constraints effectively. Our algorithm is able to find a near-optimal feasible solution and scales with the problem size well.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"99 1","pages":"458-467"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85902556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.818472
T. Hui, C. Tham
The issue of bandwidth provisioning for Per Hop Behavior (PHB) aggregates in Differentiated Services (DiffServ) networks has received a lot of attention from researchers. However, most proposed methods need to determine the amount of bandwidth to provision at the time of connection admission. This assumes that traffic in admitted flows always conforms to predefined specifications, which would need some form of traffic shaping or admission control before reaching the ingress of the domain. This paper proposes an adaptive provisioning mechanism based on reinforcement-learning principles, which determines at regular intervals the amount of bandwidth to provision to each PHB aggregate. The mechanism adjusts to maximize the amount of revenue earned from a usage-based pricing model. The novel use of a continuous-space, gradient-based learning algorithm, enables the mechanism to require neither accurate traffic specifications nor rigid admission control. Using ns-2 simulations, we demonstrate using Weighted Fair Queuing, how our mechanism can be implemented in a DiffServ network.
{"title":"Adaptive provisioning of differentiated services networks based on reinforcement learning","authors":"T. Hui, C. Tham","doi":"10.1109/TSMCC.2003.818472","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818472","url":null,"abstract":"The issue of bandwidth provisioning for Per Hop Behavior (PHB) aggregates in Differentiated Services (DiffServ) networks has received a lot of attention from researchers. However, most proposed methods need to determine the amount of bandwidth to provision at the time of connection admission. This assumes that traffic in admitted flows always conforms to predefined specifications, which would need some form of traffic shaping or admission control before reaching the ingress of the domain. This paper proposes an adaptive provisioning mechanism based on reinforcement-learning principles, which determines at regular intervals the amount of bandwidth to provision to each PHB aggregate. The mechanism adjusts to maximize the amount of revenue earned from a usage-based pricing model. The novel use of a continuous-space, gradient-based learning algorithm, enables the mechanism to require neither accurate traffic specifications nor rigid admission control. Using ns-2 simulations, we demonstrate using Weighted Fair Queuing, how our mechanism can be implemented in a DiffServ network.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"60 1","pages":"492-501"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80462032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.818475
Eleni Stroulia, M. Hatch
A plethora of information and services is available on the World Wide Web; the challenge has now become to enable the interoperation of these services in the context of high-quality, integrated applications, providing personalized value-added services to the end user. TaMeX is a software framework that supports the development of intelligent multiagent applications, integrating services of existing web applications. The TaMeX applications rely on a set of specifications of the domain model, the integration workflow, their semantic constraints, the end-user profiles, and the services of the existing web applications; all these models are declaratively represented in the XML-based TaMeX integration-specification language. At run-time, the TaMeX agents use these models to flexibly interact with the end users, monitor and control the execution of the underlying applications' services and coordinate the information exchange among them, and to collaborate with each other to react to failures and effectively accomplish the desired user request. In this paper, we describe the TaMeX framework and we illustrate its capabilities with an integrated book-finding application as a case study.
{"title":"An intelligent-agent architecture for flexible service integration on the web","authors":"Eleni Stroulia, M. Hatch","doi":"10.1109/TSMCC.2003.818475","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818475","url":null,"abstract":"A plethora of information and services is available on the World Wide Web; the challenge has now become to enable the interoperation of these services in the context of high-quality, integrated applications, providing personalized value-added services to the end user. TaMeX is a software framework that supports the development of intelligent multiagent applications, integrating services of existing web applications. The TaMeX applications rely on a set of specifications of the domain model, the integration workflow, their semantic constraints, the end-user profiles, and the services of the existing web applications; all these models are declaratively represented in the XML-based TaMeX integration-specification language. At run-time, the TaMeX agents use these models to flexibly interact with the end users, monitor and control the execution of the underlying applications' services and coordinate the information exchange among them, and to collaborate with each other to react to failures and effectively accomplish the desired user request. In this paper, we describe the TaMeX framework and we illustrate its capabilities with an integrated book-finding application as a case study.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"453 1","pages":"468-479"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77720067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.818499
R. Glitho, F. Khendek, A. D. Marco
Value added services, or more simply - services, are the critical ingredient for the success and the survival of Internet Telephony. Services can be defined as anything that goes beyond two party voice calls. Some examples are multiparty gaming, customized stock quotes and call screening. This paper focuses on service creation in Internet Telephony. Service creation plays a major role in Internet Telephony because it enables openness and programmability by offering frameworks for the development of value added services. Two principal sets of standards have emerged for Internet Telephony: H.323 from the ITU-T and SIP from the IETF. No service creation framework comes with the H.323 set. Two frameworks come with the SIP set: the Call Processing Language (CPL) and the SIP common gateway interface (CGI). Besides the IETF, other forums such as Parlay and JAIN have proposed pertinent frameworks. The first part of the paper provides an overview of the service creation frameworks for Internet Telephony. A common characteristic of these frameworks is that they require knowledge that nonexperts may not have (e.g., scripts, programming languages). High-level service creation environments may help these nonexperts. The second part of the paper presents a case study on a high level service creation environment (SCE) where pre-defined graphical components are combined into services. The environment is discussed in detail along with the service logic execution environment (SLEE) where the services are executed. The SCE and SLEE make no assumption on the service creation framework supported by the network, and any of the standard frameworks could be used provided it offers the functionality abstracted in the graphical components. We have used the Parlay APIs as a framework and the prototype is built for a SIP environment. The prototype is described and the lessons we have learned are presented.
{"title":"Creating value added services in Internet telephony: an overview and a case study on a high-level service creation environment","authors":"R. Glitho, F. Khendek, A. D. Marco","doi":"10.1109/TSMCC.2003.818499","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818499","url":null,"abstract":"Value added services, or more simply - services, are the critical ingredient for the success and the survival of Internet Telephony. Services can be defined as anything that goes beyond two party voice calls. Some examples are multiparty gaming, customized stock quotes and call screening. This paper focuses on service creation in Internet Telephony. Service creation plays a major role in Internet Telephony because it enables openness and programmability by offering frameworks for the development of value added services. Two principal sets of standards have emerged for Internet Telephony: H.323 from the ITU-T and SIP from the IETF. No service creation framework comes with the H.323 set. Two frameworks come with the SIP set: the Call Processing Language (CPL) and the SIP common gateway interface (CGI). Besides the IETF, other forums such as Parlay and JAIN have proposed pertinent frameworks. The first part of the paper provides an overview of the service creation frameworks for Internet Telephony. A common characteristic of these frameworks is that they require knowledge that nonexperts may not have (e.g., scripts, programming languages). High-level service creation environments may help these nonexperts. The second part of the paper presents a case study on a high level service creation environment (SCE) where pre-defined graphical components are combined into services. The environment is discussed in detail along with the service logic execution environment (SLEE) where the services are executed. The SCE and SLEE make no assumption on the service creation framework supported by the network, and any of the standard frameworks could be used provided it offers the functionality abstracted in the graphical components. We have used the Parlay APIs as a framework and the prototype is built for a SIP environment. The prototype is described and the lessons we have learned are presented.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"131 1","pages":"446-457"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80924112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.819319
W. Pedrycz, A. Vasilakos, S. Karnouskos
A variety of detailed technologies, concepts, and models aim at the realization of intelligent integrated networks and services. Active and programmable networking enable the introduction of new network services by adding dynamic programmability to network devices and making aspects of the programmability accessible to third-party vendors and users via open interfaces. Open and programmable network elements help redefine network software architectures and move control and management systems away from traditional closed and rigid solutions, bringing us one step closer to an environment where all devices and services seamlessly interoperate and cooperate with each other. Computational intelligence (CI) has emerged through a vivid and diversified synergy of technologies of granular computing, neural networks, and evolutionary computing. Each of the contributing technologies there plays an important and unique role. In essence, we can state that CI is a manifestation and implementation of a general design methodology applied to complex systems. The article reviews this special issue.
{"title":"Guest Editorial - Special issue on computational intelligence in telecommunications networks and internet services - Part II","authors":"W. Pedrycz, A. Vasilakos, S. Karnouskos","doi":"10.1109/TSMCC.2003.819319","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.819319","url":null,"abstract":"A variety of detailed technologies, concepts, and models aim at the realization of intelligent integrated networks and services. Active and programmable networking enable the introduction of new network services by adding dynamic programmability to network devices and making aspects of the programmability accessible to third-party vendors and users via open interfaces. Open and programmable network elements help redefine network software architectures and move control and management systems away from traditional closed and rigid solutions, bringing us one step closer to an environment where all devices and services seamlessly interoperate and cooperate with each other. Computational intelligence (CI) has emerged through a vivid and diversified synergy of technologies of granular computing, neural networks, and evolutionary computing. Each of the contributing technologies there plays an important and unique role. In essence, we can state that CI is a manifestation and implementation of a general design methodology applied to complex systems. The article reviews this special issue.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"18 1","pages":"429-431"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85184662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-11-01DOI: 10.1109/TSMCC.2003.818498
Zhaoyu Liu, R. Campbell, M. D. Mickunas
Active networks aim to provide a software framework that enables network applications to customize the processing of their communication packets. Security is of critical importance to the success of active networking. This paper presents a design and a description of the implementation for securing the node of an active network using active networking principles. The secure node architecture includes an active node operating system security API, an active security guardian, and quality of protection (QoP) provisions. The architecture supports highly customized and situational policies created by users and applications dynamically. It permits active nodes to satisfy the application-specific dynamic security and protection requirements. The secure node architecture can provide a fundamental base for securing the active network infrastructure. We describe the integration of secure node architecture into an active network software system to demonstrate its flexible and innovative features.
{"title":"Active security support for active networks","authors":"Zhaoyu Liu, R. Campbell, M. D. Mickunas","doi":"10.1109/TSMCC.2003.818498","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818498","url":null,"abstract":"Active networks aim to provide a software framework that enables network applications to customize the processing of their communication packets. Security is of critical importance to the success of active networking. This paper presents a design and a description of the implementation for securing the node of an active network using active networking principles. The secure node architecture includes an active node operating system security API, an active security guardian, and quality of protection (QoP) provisions. The architecture supports highly customized and situational policies created by users and applications dynamically. It permits active nodes to satisfy the application-specific dynamic security and protection requirements. The secure node architecture can provide a fundamental base for securing the active network infrastructure. We describe the integration of secure node architecture into an active network software system to demonstrate its flexible and innovative features.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"22 1","pages":"432-445"},"PeriodicalIF":0.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87558915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-08-01DOI: 10.1109/TSMCC.2003.818944
I. Satoh
Mobile agents can migrate among nodes to perform a set of management tasks at each of the visited nodes. Existing mobile agent-based network management systems often assume that their mobile agents are designed to work in particular networks to raise the efficiency of agent migration among multiple nodes. Unfortunately, such mobile agents cannot be reused in different networks. This paper proposes a framework where a mobile agent for network management is composed of two kinds of software components, an itinerary part and a behavioral logic part. Both components are implemented as mobile agents. The former is a carrier designed for particular networks, and it can efficiently navigate other mobile agents among nodes in its target network. The latter defines management tasks performed at each node independently of any local network. This framework allows a mobile agent for network management to be reused in various networks without being modified. A prototype implementation of this framework and its application were built on a Java-based mobile agent system.
{"title":"Building reusable mobile agents for network management","authors":"I. Satoh","doi":"10.1109/TSMCC.2003.818944","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818944","url":null,"abstract":"Mobile agents can migrate among nodes to perform a set of management tasks at each of the visited nodes. Existing mobile agent-based network management systems often assume that their mobile agents are designed to work in particular networks to raise the efficiency of agent migration among multiple nodes. Unfortunately, such mobile agents cannot be reused in different networks. This paper proposes a framework where a mobile agent for network management is composed of two kinds of software components, an itinerary part and a behavioral logic part. Both components are implemented as mobile agents. The former is a carrier designed for particular networks, and it can efficiently navigate other mobile agents among nodes in its target network. The latter defines management tasks performed at each node independently of any local network. This framework allows a mobile agent for network management to be reused in various networks without being modified. A prototype implementation of this framework and its application were built on a Java-based mobile agent system.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"1 1","pages":"350-357"},"PeriodicalIF":0.0,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88167417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-08-01DOI: 10.1109/TSMCC.2003.817359
K. Tan, A. Tay, J. Cai
Although evolutionary algorithm is a powerful optimization tool, its computation cost involved in terms of time and hardware resources increases as the size or complexity of the problem increases. One promising approach to overcome this limitation is to exploit the inherent parallelism of evolutionary algorithms by creating an infrastructure necessary to support distributed evolutionary computing using existing Internet and hardware resources. This paper presents a Java-based distributed evolutionary computing software (Paladin-DEC), which enhances the concurrent processing and performance of evolutionary algorithms by allowing inter-communications of subpopulations among various computers over the Internet. Such a distributed system enables individuals to migrate among multiple subpopulations according to some patterns to induce diversity of elite individuals periodically, in a way that simulates the species evolve in natural environment. The Paladin-DEC software is capable of keeping data integrity throughout the computation, and is incorporated with the features of robustness, security, fault tolerance, and work balancing. The effectiveness and advantages of the Paladin-DEC are illustrated upon two case studies of drug scheduling in cancer chemotherapy and searching probe sets of yeast genome.
{"title":"Design and implementation of a distributed evolutionary computing software","authors":"K. Tan, A. Tay, J. Cai","doi":"10.1109/TSMCC.2003.817359","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.817359","url":null,"abstract":"Although evolutionary algorithm is a powerful optimization tool, its computation cost involved in terms of time and hardware resources increases as the size or complexity of the problem increases. One promising approach to overcome this limitation is to exploit the inherent parallelism of evolutionary algorithms by creating an infrastructure necessary to support distributed evolutionary computing using existing Internet and hardware resources. This paper presents a Java-based distributed evolutionary computing software (Paladin-DEC), which enhances the concurrent processing and performance of evolutionary algorithms by allowing inter-communications of subpopulations among various computers over the Internet. Such a distributed system enables individuals to migrate among multiple subpopulations according to some patterns to induce diversity of elite individuals periodically, in a way that simulates the species evolve in natural environment. The Paladin-DEC software is capable of keeping data integrity throughout the computation, and is incorporated with the features of robustness, security, fault tolerance, and work balancing. The effectiveness and advantages of the Paladin-DEC are illustrated upon two case studies of drug scheduling in cancer chemotherapy and searching probe sets of yeast genome.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"1 1","pages":"325-338"},"PeriodicalIF":0.0,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89730592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-08-01DOI: 10.1109/TSMCC.2003.817354
A. Vasilakos, M. Saltouros, A. F. Atlassis, W. Pedrycz
In this paper, the use of a computational intelligence approach -a reinforcement learning algorithm (RLA)-for optimizing the routing in asynchronous transfer mode (ATM) networks based on the private network-to-network interface (PNNI) standard is proposed. This algorithm which is specially designed for the quality of service (QoS) routing problem, aims at maximizing the network revenue (allocating efficiently the network resources) while ensuring the QoS requirements for each connection. In this study, large-scale networks are considered where it becomes necessary to be organized hierarchically so that a scale in terms of computation, communication and storage requirements will be achieved. A comparative performance study of the proposed and other commonly used routing schemes is demonstrated by means of simulation on existing commercial networks. Simulation results over a wide range of uniform, time-varying and skewed loading conditions show the effectiveness of the proposed routing algorithm, and disclose the strength and weakness of the various schemes.
本文提出了一种基于专用网络对网络接口(PNNI)标准的异步传输模式(ATM)网络路由优化的计算智能方法——强化学习算法(RLA)。该算法是专门针对QoS (quality of service，服务质量)路由问题而设计的，其目标是在保证每个连接的QoS要求的同时使网络收益最大化(即有效地分配网络资源)。在本研究中，考虑到需要分层组织的大型网络，以便在计算、通信和存储需求方面实现规模。通过对现有商用网络的仿真，对所提出的路由方案和其他常用路由方案的性能进行了比较研究。在广泛的均匀、时变和倾斜负载条件下的仿真结果表明了所提出的路由算法的有效性，并揭示了各种方案的优缺点。
{"title":"Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques","authors":"A. Vasilakos, M. Saltouros, A. F. Atlassis, W. Pedrycz","doi":"10.1109/TSMCC.2003.817354","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.817354","url":null,"abstract":"In this paper, the use of a computational intelligence approach -a reinforcement learning algorithm (RLA)-for optimizing the routing in asynchronous transfer mode (ATM) networks based on the private network-to-network interface (PNNI) standard is proposed. This algorithm which is specially designed for the quality of service (QoS) routing problem, aims at maximizing the network revenue (allocating efficiently the network resources) while ensuring the QoS requirements for each connection. In this study, large-scale networks are considered where it becomes necessary to be organized hierarchically so that a scale in terms of computation, communication and storage requirements will be achieved. A comparative performance study of the proposed and other commonly used routing schemes is demonstrated by means of simulation on existing commercial networks. Simulation results over a wide range of uniform, time-varying and skewed loading conditions show the effectiveness of the proposed routing algorithm, and disclose the strength and weakness of the various schemes.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"40 1","pages":"297-312"},"PeriodicalIF":0.0,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81666256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-08-01DOI: 10.1109/TSMCC.2003.818946
G. D. Fatta, F. Hoffmann, G. Re, A. Urso
Active queue management (AQM) policies are those policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. This paper proposes the adoption of a fuzzy proportional integral (FPI) controller as an active queue manager for Internet routers. The analytical design of the proposed FPI controller is carried out in analogy with a proportional integral (PI) controller, which recently has been proposed for AQM. A genetic algorithm is proposed for tuning of the FPI controller parameters with respect to optimal disturbance rejection. In the paper the FPI controller design methodology is described and the results of the comparison with random early detection (RED), tail drop, and PI controller are presented.
{"title":"A genetic algorithm for the design of a fuzzy controller for active queue management","authors":"G. D. Fatta, F. Hoffmann, G. Re, A. Urso","doi":"10.1109/TSMCC.2003.818946","DOIUrl":"https://doi.org/10.1109/TSMCC.2003.818946","url":null,"abstract":"Active queue management (AQM) policies are those policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. This paper proposes the adoption of a fuzzy proportional integral (FPI) controller as an active queue manager for Internet routers. The analytical design of the proposed FPI controller is carried out in analogy with a proportional integral (PI) controller, which recently has been proposed for AQM. A genetic algorithm is proposed for tuning of the FPI controller parameters with respect to optimal disturbance rejection. In the paper the FPI controller design methodology is described and the results of the comparison with random early detection (RED), tail drop, and PI controller are presented.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"299 1","pages":"313-324"},"PeriodicalIF":0.0,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73050782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：