Pub Date : 2005-06-15DOI: 10.1109/CONTEL.2005.185938
R. Inkret, M. Lackovic
The paper presents the Multi-Service Photonic Network (MSPN) architecture, implementing the idea of optical circuit, burst and packet switching coexistence. We focus on the architecture using a layered perspective, and describe each layer functionality and technical implementation. Generic node structure gives a systematic description of MSPN functionalities through switching elements and transport interfaces. The implementation of new switching paradigms is particularly addressed by the discussion of the ways of transporting possibilities of optical packet/burst switching services over optical circuit switching services optical packet/burst. The MSPN support of different topological paradigms is of essential importance for the next generation optical transmission network deployment.
{"title":"Multi-service photonic network","authors":"R. Inkret, M. Lackovic","doi":"10.1109/CONTEL.2005.185938","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185938","url":null,"abstract":"The paper presents the Multi-Service Photonic Network (MSPN) architecture, implementing the idea of optical circuit, burst and packet switching coexistence. We focus on the architecture using a layered perspective, and describe each layer functionality and technical implementation. Generic node structure gives a systematic description of MSPN functionalities through switching elements and transport interfaces. The implementation of new switching paradigms is particularly addressed by the discussion of the ways of transporting possibilities of optical packet/burst switching services over optical circuit switching services optical packet/burst. The MSPN support of different topological paradigms is of essential importance for the next generation optical transmission network deployment.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116910703","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185960
A. Wagner
Many researchers have agreed on the validity of the observation that the use of mobile agent systems will not attain a critical mass unless the problem of security is solved. As mobile agents are most likely to be used in an untrusted environment (such as the Internet) the various components of the agent system are to be protected against security threats. If security is not guaranteed, sensitive user data may be leaked or forged. This paper offers an overview of possible approaches to counter the most notorious of agent system security threats, the one presented by malicious agent hosts. The requirements for protection against such attacks are outlined, and new methods of protection are also introduced. I. INTRODUCTION By most researchers, mobile agent systems are considered to be a viable alternative to client-server systems in certain applications. Some of the often recited advantages of mobile agents over client-server architectures are:
{"title":"Implementing mobile agent security in an untrusted computing environment","authors":"A. Wagner","doi":"10.1109/CONTEL.2005.185960","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185960","url":null,"abstract":"Many researchers have agreed on the validity of the observation that the use of mobile agent systems will not attain a critical mass unless the problem of security is solved. As mobile agents are most likely to be used in an untrusted environment (such as the Internet) the various components of the agent system are to be protected against security threats. If security is not guaranteed, sensitive user data may be leaked or forged. This paper offers an overview of possible approaches to counter the most notorious of agent system security threats, the one presented by malicious agent hosts. The requirements for protection against such attacks are outlined, and new methods of protection are also introduced. I. INTRODUCTION By most researchers, mobile agent systems are considered to be a viable alternative to client-server systems in certain applications. Some of the often recited advantages of mobile agents over client-server architectures are:","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035825","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185963
Ivan Mećar, A. Devlic, K. Trzec
The article deals with implementation issues of semantic matchmaking of Web services using intelligent middle agents in an electronic market (e-market). The idea of comparison of Web services according to their semantic descriptions is used to find the most appropriate service that meets user preferences. A comprehensive description not only of the syntax, but also of the semantic meaning of the service is used to find the most suitable match. The matchmaking procedure is based on the ontology of DAML-S (DARPA Agent Markup Language for Services), which is an extension of XML. DAML-S ontology contains the required semantic information for discovery and comparison as well as execution and monitoring of Web services. In order to find a service that satisfies user requirements, the intelligent software agent semantically compares descriptions of requested and advertised Web services using a matchmaking algorithm and an automated reasoner based on description logics. Thus, a user is provided with the most appropriate service that matches his requirements
本文讨论了在电子市场(e-market)中使用智能中间代理的Web服务语义匹配的实现问题。根据Web服务的语义描述对其进行比较的思想用于找到满足用户首选项的最合适的服务。不仅对语法，而且对服务的语义含义进行全面的描述，以找到最合适的匹配。匹配过程基于DARPA服务代理标记语言(DARPA Agent Markup Language for Services)本体，该本体是XML的扩展。DAML-S本体包含发现和比较以及执行和监视Web服务所需的语义信息。为了找到满足用户需求的服务，智能软件代理使用匹配算法和基于描述逻辑的自动推理器在语义上比较请求和发布的Web服务的描述。这样，就为用户提供了符合其需求的最合适的服务
{"title":"Agent-oriented semantic discovery and mathcmaking of web services","authors":"Ivan Mećar, A. Devlic, K. Trzec","doi":"10.1109/CONTEL.2005.185963","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185963","url":null,"abstract":"The article deals with implementation issues of semantic matchmaking of Web services using intelligent middle agents in an electronic market (e-market). The idea of comparison of Web services according to their semantic descriptions is used to find the most appropriate service that meets user preferences. A comprehensive description not only of the syntax, but also of the semantic meaning of the service is used to find the most suitable match. The matchmaking procedure is based on the ontology of DAML-S (DARPA Agent Markup Language for Services), which is an extension of XML. DAML-S ontology contains the required semantic information for discovery and comparison as well as execution and monitoring of Web services. In order to find a service that satisfies user requirements, the intelligent software agent semantically compares descriptions of requested and advertised Web services using a matchmaking algorithm and an automated reasoner based on description logics. Thus, a user is provided with the most appropriate service that matches his requirements","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126639445","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185832
V. Naumov, O. Chistokhvalov
In this paper we present an object-oriented transport network model that reflects possibility of network layering and independent partitioning of each layer. This generic model can be used to represent architecture of different transport networks including telecommunication networks and transportation networks.
{"title":"Object-oriented modeling of multi-layer network structures","authors":"V. Naumov, O. Chistokhvalov","doi":"10.1109/CONTEL.2005.185832","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185832","url":null,"abstract":"In this paper we present an object-oriented transport network model that reflects possibility of network layering and independent partitioning of each layer. This generic model can be used to represent architecture of different transport networks including telecommunication networks and transportation networks.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620762","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185912
M. Yahia, J. Bíró
In this paper we focus on using admission control based on estimation of available bandwidth on a bottleneck link for attempting to reduce congestion and utilize the link capacity. On one hand we have analyzed the performance of admission control under different parameter settings and network traffic load. On the other hand we have thoroughly investigated the interactions between the pre- ventive admission control and reactive queue management algorithms like RED and DropTail in terms of transaction times of data.
{"title":"Admission control for elastic traffic using RED and/or droptail queues","authors":"M. Yahia, J. Bíró","doi":"10.1109/CONTEL.2005.185912","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185912","url":null,"abstract":"In this paper we focus on using admission control based on estimation of available bandwidth on a bottleneck link for attempting to reduce congestion and utilize the link capacity. On one hand we have analyzed the performance of admission control under different parameter settings and network traffic load. On the other hand we have thoroughly investigated the interactions between the pre- ventive admission control and reactive queue management algorithms like RED and DropTail in terms of transaction times of data.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129258539","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185985
A. Hamidovic, S. Krajnović
The paper analyses some of the critical success factors for software development projects within the ICT industry. In the modern and highly competitive global ICT industry, the definition of project success had to be modified. The paper stresses and analyses, as key factors to secure project and business success, the importance of customer orientation and a need to increase constantly the level of research and development output. In the past, project success was defined as the completion of an activity within the constraints of time, cost and performance. Now, the classic triangle has become a pentagram, with two new key measurements of project success being added - customer satisfaction and organizational impact. The analysis is performed on examples of telecom software development projects within research and development centers in Ireland and Croatia
{"title":"An example of a novel approach to measuring projects success within ICT industry","authors":"A. Hamidovic, S. Krajnović","doi":"10.1109/CONTEL.2005.185985","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185985","url":null,"abstract":"The paper analyses some of the critical success factors for software development projects within the ICT industry. In the modern and highly competitive global ICT industry, the definition of project success had to be modified. The paper stresses and analyses, as key factors to secure project and business success, the importance of customer orientation and a need to increase constantly the level of research and development output. In the past, project success was defined as the completion of an activity within the constraints of time, cost and performance. Now, the classic triangle has become a pentagram, with two new key measurements of project success being added - customer satisfaction and organizational impact. The analysis is performed on examples of telecom software development projects within research and development centers in Ireland and Croatia","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123832526","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185952
M. Bhattacharyya, A. Kumar, M. Bayoumi
Minimizing energy consumption is important for prolonging the life of battery powered sensor nodes. A major portion of the power consumption is spent in communication with other nodes. If any communication fails, the message needs to be re-transmitted, resulting in added energy consumption. In this paper we suggest having a Failed Communication table, which keeps track of number of failed communications with each node in the group, while the nodes are updated with duplicate values for better resistance against loss of data. Consulting this table while selecting a path would help in detecting local interference and avoiding it while routing.
{"title":"An energy efficient protocol exploiting cache data for sensor networks","authors":"M. Bhattacharyya, A. Kumar, M. Bayoumi","doi":"10.1109/CONTEL.2005.185952","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185952","url":null,"abstract":"Minimizing energy consumption is important for prolonging the life of battery powered sensor nodes. A major portion of the power consumption is spent in communication with other nodes. If any communication fails, the message needs to be re-transmitted, resulting in added energy consumption. In this paper we suggest having a Failed Communication table, which keeps track of number of failed communications with each node in the group, while the nodes are updated with duplicate values for better resistance against loss of data. Consulting this table while selecting a path would help in detecting local interference and avoiding it while routing.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062545","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185989
V. Goebel, T. Plagemann
Summary form only given. A new class of data-intensive applications, such as sensor networks, network traffic analysis, financial tickers, Web or telecommunications transaction log analysis, has become widely recognized. These applications require support for on-line analysis of rapidly changing data streams. However, traditional database management systems (DBMS) have no pre-defined notion of time and cannot handle data on-line (i.e., in main memory without storing the data on disk) in near real-time. Data stream management systems (DSMS) have been developed to handle transient data streams on-line and to process continuous queries on these data streams. Currently, first prototypes and systems are becoming available. The tutorial discusses the data stream model, which is the fundamental difference between a classical DBMS and a DSMS. Traffic analysis tasks are also discussed
{"title":"Data stream management systems - a technology for network monitoring and traffic analysis?","authors":"V. Goebel, T. Plagemann","doi":"10.1109/CONTEL.2005.185989","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185989","url":null,"abstract":"Summary form only given. A new class of data-intensive applications, such as sensor networks, network traffic analysis, financial tickers, Web or telecommunications transaction log analysis, has become widely recognized. These applications require support for on-line analysis of rapidly changing data streams. However, traditional database management systems (DBMS) have no pre-defined notion of time and cannot handle data on-line (i.e., in main memory without storing the data on disk) in near real-time. Data stream management systems (DSMS) have been developed to handle transient data streams on-line and to process continuous queries on these data streams. Currently, first prototypes and systems are becoming available. The tutorial discusses the data stream model, which is the fundamental difference between a classical DBMS and a DSMS. Traffic analysis tasks are also discussed","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513531","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185943
P. A. Tsimoulas, G. Papadimitriou, A. Pomportsis
The performance of most scheduling schemes, including the well-known efficient EATS and MSL schemes, is noticeably degraded in practical WDM star networks with non-uniform destinations and non-negligible transceiver tuning latencies. Under these realistic conditions, it is common that two or more messages with the same destination have to be scheduled consecutively or at close times. In most cases, this brings about some performance penalty, owing to the delayed availability of the destination’s receiver for the second (and above) of the consecutive messages. The novel high performance Efficient Message Prioritization and Scheduling (EMPS) protocol is introduced to deal with this problem. EMPS simultaneously considers multiple messages from different transmitting nodes and gives priority to messages intended for the soonest available receivers each time. By balancing the offered load like this, EMPS minimizes the probability of having to schedule two or more messages with the same destination consecutively or at close times. Additionally, by incorporating the Minimum Scheduling Latency algorithm for channel selection, it also minimizes the actual performance penalty, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to compare EMPS to other efficient schemes under varying conditions. The results show that it always brings about significant performance improvement.
{"title":"Receiver availability-based technique for highly efficient message prioritization and scheduling in WDM star networks","authors":"P. A. Tsimoulas, G. Papadimitriou, A. Pomportsis","doi":"10.1109/CONTEL.2005.185943","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185943","url":null,"abstract":"The performance of most scheduling schemes, including the well-known efficient EATS and MSL schemes, is noticeably degraded in practical WDM star networks with non-uniform destinations and non-negligible transceiver tuning latencies. Under these realistic conditions, it is common that two or more messages with the same destination have to be scheduled consecutively or at close times. In most cases, this brings about some performance penalty, owing to the delayed availability of the destination’s receiver for the second (and above) of the consecutive messages. The novel high performance Efficient Message Prioritization and Scheduling (EMPS) protocol is introduced to deal with this problem. EMPS simultaneously considers multiple messages from different transmitting nodes and gives priority to messages intended for the soonest available receivers each time. By balancing the offered load like this, EMPS minimizes the probability of having to schedule two or more messages with the same destination consecutively or at close times. Additionally, by incorporating the Minimum Scheduling Latency algorithm for channel selection, it also minimizes the actual performance penalty, when scheduling of consecutive messages with the same destination cannot be avoided. Extensive simulations are carried out in order to compare EMPS to other efficient schemes under varying conditions. The results show that it always brings about significant performance improvement.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"46 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128025013","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 : 2005-06-15DOI: 10.1109/CONTEL.2005.185961
J. Šašak
{"title":"Using the intelligence of mobile agents in road management systems","authors":"J. Šašak","doi":"10.1109/CONTEL.2005.185961","DOIUrl":"https://doi.org/10.1109/CONTEL.2005.185961","url":null,"abstract":"","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121854491","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
扫码关注我们
求助内容：
应助结果提醒方式：