M. Venkataraman, S. Sengupta, M. Chatterjee, R. Neogi
Streaming monitorables on an overlay plane orthogonal to the data-path is emerging as a promising way to monitor, detect and isolate network impairments and outages. However, keeping the overlay stable and efficient poses acute challenges, since the overlay network itself shall not be monitored for outages. A linear mapping of exporter elements onto collectors often leads to a sub-optimal resource allocation, frequently saturating a few collectors leading to gaps in monitored data. Such gaps could prove costly for network operators, and a most common reaction to this is expensive hardware upgrades. In times of such outages, however, it is observed that not all collectors are saturated. More often than not, balancing the load and efficiently distributing available resources was all that was needed to prevent saturation related outages, and increase overall capacity of the overlay. We discuss ways to construct a scalable, robust, and resilient overlay that can function autonomously given the constraints of a typical real world access network.
{"title":"Resource Management Considerations in Collector Overlay Networks","authors":"M. Venkataraman, S. Sengupta, M. Chatterjee, R. Neogi","doi":"10.1109/ICNS.2008.42","DOIUrl":"https://doi.org/10.1109/ICNS.2008.42","url":null,"abstract":"Streaming monitorables on an overlay plane orthogonal to the data-path is emerging as a promising way to monitor, detect and isolate network impairments and outages. However, keeping the overlay stable and efficient poses acute challenges, since the overlay network itself shall not be monitored for outages. A linear mapping of exporter elements onto collectors often leads to a sub-optimal resource allocation, frequently saturating a few collectors leading to gaps in monitored data. Such gaps could prove costly for network operators, and a most common reaction to this is expensive hardware upgrades. In times of such outages, however, it is observed that not all collectors are saturated. More often than not, balancing the load and efficiently distributing available resources was all that was needed to prevent saturation related outages, and increase overall capacity of the overlay. We discuss ways to construct a scalable, robust, and resilient overlay that can function autonomously given the constraints of a typical real world access network.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752323","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}
Pricing network resources is a crucial component for proper resource management and the provision of quality of service guarantees. In this paper we propose a decentralized real-time market (RTM) model for pricing differentiated services (DiffServ), which attempts to achieve efficient resource allocation, while reducing computational overheads. We review issues relating to congestion sensitive pricing of the network resources and propose an approach to alleviate price fluctuation that considers the actual state of the network. In comparison with the existing studies that consider the existence of a single point of market equilibrium, we consider the existence of a set of equilibrium states. The proposed strategy relies on the division of link capacity into intervals called steps, where current supply is determined according to the expected resource prices, and is the sum of the allocated steps. Consequently, the real state of the market is described by immediately accessible information, such as price.
{"title":"Real-Time Market Model for Pricing Differentiated Services","authors":"Ruzana Davoyan, J. Altmann","doi":"10.1109/ICNS.2008.38","DOIUrl":"https://doi.org/10.1109/ICNS.2008.38","url":null,"abstract":"Pricing network resources is a crucial component for proper resource management and the provision of quality of service guarantees. In this paper we propose a decentralized real-time market (RTM) model for pricing differentiated services (DiffServ), which attempts to achieve efficient resource allocation, while reducing computational overheads. We review issues relating to congestion sensitive pricing of the network resources and propose an approach to alleviate price fluctuation that considers the actual state of the network. In comparison with the existing studies that consider the existence of a single point of market equilibrium, we consider the existence of a set of equilibrium states. The proposed strategy relies on the division of link capacity into intervals called steps, where current supply is determined according to the expected resource prices, and is the sum of the allocated steps. Consequently, the real state of the market is described by immediately accessible information, such as price.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123384844","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}
J. Pang, Jiuzhen Jin, Rongcai Zhao, Zheng Shan, Zheng Zhang
This paper presents the M/G/l multi-class open queuing networks performance model of IXP2400- based VoIP SPS (signaling parse system). We use UML activity diagrams and function module diagrams to describe this VoIP SYS, and derive the performance model. The resulting model could make statistic analysis of IXP2400-based VoIP SPS with First-Come- First-Serve (FCFS) scheduling policy and mix traffic. We use the approximate calculation of iterative decomposition algorithm to solve this model, and present the formulas of the utilization, delay, etc. The theoretical estimates are in excellent consistence with our testing data, this shows the effectiveness of our performance evaluating method.
{"title":"Using Queuing Network to Evaluate IXP2400 Based VoIP SPS","authors":"J. Pang, Jiuzhen Jin, Rongcai Zhao, Zheng Shan, Zheng Zhang","doi":"10.1109/ICNS.2008.14","DOIUrl":"https://doi.org/10.1109/ICNS.2008.14","url":null,"abstract":"This paper presents the M/G/l multi-class open queuing networks performance model of IXP2400- based VoIP SPS (signaling parse system). We use UML activity diagrams and function module diagrams to describe this VoIP SYS, and derive the performance model. The resulting model could make statistic analysis of IXP2400-based VoIP SPS with First-Come- First-Serve (FCFS) scheduling policy and mix traffic. We use the approximate calculation of iterative decomposition algorithm to solve this model, and present the formulas of the utilization, delay, etc. The theoretical estimates are in excellent consistence with our testing data, this shows the effectiveness of our performance evaluating method.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585959","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}
In this paper we present an approach for specification of exception handling and recovery of semantic web services based on OWLS. We use standard fault handlers and compensation known for example from WS-BPEL to provide support for long running transactions. In addition to that, we introduce constraint violation handlers (CV-handlers) which allow a designer to define what situations are supposed to trigger an erroneous state and what are the appropriate recovery actions. Further, we introduce explicit recovery actions such as retry and replaceBy to recover from the failure and to restore a normal execution flow. By combining fault handlers, CV-handlers and standard event handlers it is possible to define ways of recovery for standard errors and for violations of constraints resulting for example from Service Level Agreements (SLAs).
{"title":"Exception Handling and Recovery of Semantic Web Services","authors":"R. Vaculín, Kevin Wiesner, K. Sycara","doi":"10.1109/ICNS.2008.35","DOIUrl":"https://doi.org/10.1109/ICNS.2008.35","url":null,"abstract":"In this paper we present an approach for specification of exception handling and recovery of semantic web services based on OWLS. We use standard fault handlers and compensation known for example from WS-BPEL to provide support for long running transactions. In addition to that, we introduce constraint violation handlers (CV-handlers) which allow a designer to define what situations are supposed to trigger an erroneous state and what are the appropriate recovery actions. Further, we introduce explicit recovery actions such as retry and replaceBy to recover from the failure and to restore a normal execution flow. By combining fault handlers, CV-handlers and standard event handlers it is possible to define ways of recovery for standard errors and for violations of constraints resulting for example from Service Level Agreements (SLAs).","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133290916","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}
Ubiquitous computing is a new area of computing which aims to serve people in order to perform daily tasks with less effort and much faster that they used to. Ubiquitous computing systems consist of numerous devices, which are embedded and hidden within the environment. This paper reports the current status of ubiquitous computing, by presenting technologies and applications that are used today. In addition, it describes research projects and prototypes that have been developed until today. Also, there are references about ongoing efforts. Finally, the paper presents several evaluation schemes for ubicomp, while there is still no unified framework.
{"title":"Meeting the Needs of Sophisticated Applications with Ubiquitous Computing Systems","authors":"D. Adamopoulos","doi":"10.1109/ICNS.2008.20","DOIUrl":"https://doi.org/10.1109/ICNS.2008.20","url":null,"abstract":"Ubiquitous computing is a new area of computing which aims to serve people in order to perform daily tasks with less effort and much faster that they used to. Ubiquitous computing systems consist of numerous devices, which are embedded and hidden within the environment. This paper reports the current status of ubiquitous computing, by presenting technologies and applications that are used today. In addition, it describes research projects and prototypes that have been developed until today. Also, there are references about ongoing efforts. Finally, the paper presents several evaluation schemes for ubicomp, while there is still no unified framework.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114814182","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}
A. Ayyagari, Craig F. Battles, Brian J. Smith, S. Uczekaj, K. Y. Ung
Airlines are governed by government and/or safety regulations that require each aircraft seat is properly equipped with a floatation device for use by the passenger in the unlikely event of a water landing. The current known aircraft inspection process to verify that each seat has the requisite floatation device is time consuming and labor intensive. The Boeing Company has defined and developed a radio frequency identification (RFID) based automated floatation device inspection system that leverages temporal and location awareness mechanisms to automate aircraft inspection process for floatation devices. The developed automated aircraft seat flotation device inspection system mitigates time consuming and labor intensive characteristics and thereby improves aircraft turn-around time and operational efficiencies.
{"title":"System for Automated Aircraft Seat Floatation Device Inspection","authors":"A. Ayyagari, Craig F. Battles, Brian J. Smith, S. Uczekaj, K. Y. Ung","doi":"10.1109/ICNS.2008.51","DOIUrl":"https://doi.org/10.1109/ICNS.2008.51","url":null,"abstract":"Airlines are governed by government and/or safety regulations that require each aircraft seat is properly equipped with a floatation device for use by the passenger in the unlikely event of a water landing. The current known aircraft inspection process to verify that each seat has the requisite floatation device is time consuming and labor intensive. The Boeing Company has defined and developed a radio frequency identification (RFID) based automated floatation device inspection system that leverages temporal and location awareness mechanisms to automate aircraft inspection process for floatation devices. The developed automated aircraft seat flotation device inspection system mitigates time consuming and labor intensive characteristics and thereby improves aircraft turn-around time and operational efficiencies.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121677854","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}
In this paper, we propose OverLay-based Emergency Communication Services (OLECS), an architecture for emergency communication services, that is based on overlay routing technologies. We modify and extend existing overlay routing mechanisms in terms of decreasing communication overhead, searching multi-hop overlay paths with more than three hops, making it suitable for emergency communication services. The location of overlay nodes is also considered for recovering from partial failure of ISP networks. By performing a numerical evaluation using the actual AS-level network topology of the current Internet, we show that our approach can reduce the overhead in exchanging routing information by a factor of up to 1000, and improve network connectivity by up to 9 times.
{"title":"Emergency Communication Services Based on Overlay Networking Technologies","authors":"G. Hasegawa, S. Kamei, M. Murata","doi":"10.1109/ICNS.2008.36","DOIUrl":"https://doi.org/10.1109/ICNS.2008.36","url":null,"abstract":"In this paper, we propose OverLay-based Emergency Communication Services (OLECS), an architecture for emergency communication services, that is based on overlay routing technologies. We modify and extend existing overlay routing mechanisms in terms of decreasing communication overhead, searching multi-hop overlay paths with more than three hops, making it suitable for emergency communication services. The location of overlay nodes is also considered for recovering from partial failure of ISP networks. By performing a numerical evaluation using the actual AS-level network topology of the current Internet, we show that our approach can reduce the overhead in exchanging routing information by a factor of up to 1000, and improve network connectivity by up to 9 times.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193576","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}
The programmable network approach allows processing of passing user data in a network, which is highly suitable especially for multimedia streams processing. However, programming of complex stream processing applications for programmable nodes is not effortless since they usually do not provide sufficient flexibility (both programming flexibility and execution environment flexibility). In this paper we present the programmable network node architecture named DiProNN that is able to accept and run user-supplied programs and/or virtual machines and process them over passing data. All the DiProNN programs are described using our modular programming model based on the workflow principles that takes advantages of DiProNN virtualization and makes programming of complex streaming applications easier. As a possible application we show a sketch implementation of simple MCU (Multipoint Control Unit) used for large videoconferences that profits from DiProNN properties.
{"title":"DiProNN: Distributed Programmable Network Node Architecture","authors":"Tomás Rebok","doi":"10.1109/ICNS.2008.24","DOIUrl":"https://doi.org/10.1109/ICNS.2008.24","url":null,"abstract":"The programmable network approach allows processing of passing user data in a network, which is highly suitable especially for multimedia streams processing. However, programming of complex stream processing applications for programmable nodes is not effortless since they usually do not provide sufficient flexibility (both programming flexibility and execution environment flexibility). In this paper we present the programmable network node architecture named DiProNN that is able to accept and run user-supplied programs and/or virtual machines and process them over passing data. All the DiProNN programs are described using our modular programming model based on the workflow principles that takes advantages of DiProNN virtualization and makes programming of complex streaming applications easier. As a possible application we show a sketch implementation of simple MCU (Multipoint Control Unit) used for large videoconferences that profits from DiProNN properties.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126967612","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}
A queue scheduling algorithm TFRR (throughput fairness round robin) is proposed and studied. TFRR provides better long-term fairness in case of the existence of non-continuous packet flows. Merit and deficiency of the classical fair queue algorithm DRR are studied. The phenomenon that there always exist some non-continuous flows is disclosed. TFRR is constructed based on DRR. Firstly TFRR guarantee the basic bandwidth need of all flows just like DRR. Then the surplus bandwidth is distributed to the flows that have lost bandwidth in the early non-continuous periods, to provide better long-term fairness with complexity of O(1). The improvement of the long-term fairness of TFRR, compared with DRR, is proved by inference and simulation.
{"title":"Throughput Fairness Round Robin Scheduler for Non-Continuous Flows","authors":"Lijie Sheng, Haoyu Wen, Baobao Wang","doi":"10.1109/ICNS.2008.9","DOIUrl":"https://doi.org/10.1109/ICNS.2008.9","url":null,"abstract":"A queue scheduling algorithm TFRR (throughput fairness round robin) is proposed and studied. TFRR provides better long-term fairness in case of the existence of non-continuous packet flows. Merit and deficiency of the classical fair queue algorithm DRR are studied. The phenomenon that there always exist some non-continuous flows is disclosed. TFRR is constructed based on DRR. Firstly TFRR guarantee the basic bandwidth need of all flows just like DRR. Then the surplus bandwidth is distributed to the flows that have lost bandwidth in the early non-continuous periods, to provide better long-term fairness with complexity of O(1). The improvement of the long-term fairness of TFRR, compared with DRR, is proved by inference and simulation.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"56 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125280","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}
In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select its neighbours.
{"title":"A New Neighbour Selection Strategy for Group-Based Wireless Sensor Networks","authors":"Miguel Garcia, D. Bri, F. Boronat, Jaime Lloret","doi":"10.1109/ICNS.2008.18","DOIUrl":"https://doi.org/10.1109/ICNS.2008.18","url":null,"abstract":"In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select its neighbours.","PeriodicalId":180899,"journal":{"name":"Fourth International Conference on Networking and Services (icns 2008)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125117834","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
扫码关注我们
求助内容：
应助结果提醒方式：