{"title":"Adaptive resource management in active network nodes","authors":"Yuhong Li, L. Wolf","doi":"10.1109/ISCC.2003.1214262","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214262","url":null,"abstract":"Resource management in active network nodes is challenging because more types and amount of resources are needed compared with traditional networks, and the consumption of different types of resources is not equally balanced. Hence, it is possible and important to consider the relationship between different types of resources, needed by an application. Adaptation of applications resource usages in network nodes enables the applications to react promptly to the resource status in the network nodes and therefore offers a better performance guarantee and more flexibility to the applications. This paper studies the resource management in active network nodes considering the relationship among different types of resources. The resource vectors (RVs) are introduced to describe the resource requirements of applications and their adaptation capabilities. And an adaptive resource management mechanism based on RV is proposed and the implementation of it in an active node is given.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363618","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}
{"title":"Balanced batch LKH: new proposal, implementation and performance evaluation","authors":"J. Pegueroles, F. Rico-Novella","doi":"10.1109/ISCC.2003.1214218","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214218","url":null,"abstract":"Perfect secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A key server must send the new key to all the remaining members so bandwidth efficiency concerns appear. Logical key tree algorithms reduce the number of messages to be sent, but in many scenarios, rekeying after each membership change has no sense. Batch rekeying algorithms are proposed as a solution to these problems. However such methods need to maintain the logical key tree balanced all the time on order to achieve maximum bandwidth efficiency. This paper presents a new technique for multicast batch rekeying. This technique reallocates the tree nodes in order to keep the tree balanced all the time.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115247063","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}
{"title":"Characterizing nature and location of congestion on the public Internet","authors":"Z. Cataltepe, P. Moghé","doi":"10.1109/ISCC.2003.1214206","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214206","url":null,"abstract":"We address the following question in this study: what is the nature of Internet congestion and where does congestion really occur on a public Internet path? Answering this question helps service providers and content providers better engineer emerging services on the Internet. Our large-scale path measurement and analysis study indicates that congestion on the Internet exhibits a wide variety of packet loss and delay characteristics. Based on our classification using \"congestion signatures\", we find four dominant \"types\" of congestion which may be related to macroscopic behavior. A particularly frequent type of congestion we observe is \"flash congestion\", which creates significant bursty packet loss on a fairly long time-scale. Additionally, our study suggests that flash congestion predominantly occurs at the access provider network within the \"last mile\" on an Internet path. The Internet \"cloud\" does not contribute heavily to congestion. Consequently, prevalent approaches to bypass the cloud using \"edge-based\" content delivery networks and caching may not be effective in reducing congestion.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398960","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}
{"title":"FIDRAN: a flexible intrusion detection and response framework for active networks","authors":"A. Hess, Michael Jung, G. Schäfer","doi":"10.1109/ISCC.2003.1214281","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214281","url":null,"abstract":"Securing communication networks can no longer be ensured by singular and isolated security technologies like Internet firewalls or intrusion detection systems but rather calls for a combination of existing and emerging detection and response mechanisms, e.g. DDoS response mechanisms, anomaly detection, honey pots, etc. Today, most current systems prove to be too static to provide an adequate platform for a constructive teamwork of different security technologies. Therefore, we developed the FIDRAN framework for flexible intrusion detection and response that is based on an underlying active networking environment and that allows to dynamically combining existing and emerging security technologies. FIDRAN follows a highly modular approach that allows to extend the functionality of the framework by the integration of new security modules which are implemented as active networking services, making use of next generation networks capabilities like dynamic distribution and deployment of services on active network nodes. A further advantage of the realization of FIDRAN on top of an active networking environment is the simplification and automation of maintenance work and configuration tasks.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114187751","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}
{"title":"Ordered H-BLAST for MIMO/OFDM systems over multipath channels","authors":"T. Kadous","doi":"10.1109/ISCC.2003.1214164","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214164","url":null,"abstract":"This paper addresses an OFDM/MIMO coded system where multiple data sub-streams are encoded separately and transmitted in parallel. If successive interference cancellation (SIC) across sub-streams is to be used at the receiver, to minimize error propagation (EP), it is recommended to decode a full sub-stream before cancellation to utilize the powerfulness of channel coding. For the same reason, it is also recommended to process the different sub-streams in an order that matches their reception quality. While this is always possible in flat fading channels, it is not straightforward in multipath channels where different modulation symbols have different channel qualities due to frequency selectivity. This paper addresses this problem and introduces an ordering scheme for coded systems that significantly improves system performance.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114276227","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}
Jaesup Lee, K. Lee, Jong Hyup Lee, J. Hahm, Young Sun Kim
{"title":"Design and analysis of MPLS-based ATM switching system for differentiated services","authors":"Jaesup Lee, K. Lee, Jong Hyup Lee, J. Hahm, Young Sun Kim","doi":"10.1109/ISCC.2003.1214242","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214242","url":null,"abstract":"MPLS is high lightened as the most promising technology for the integrated IP-over ATM backbone network. Nowadays, one important practical issue in MPLS is how it is capable of providing differentiated services. For integrating IP with ATM capable of scalability, MPLS-based ATM switch network can be available, especially for the fast Internet services by adding a layer 3 routing module to the existing ATM network, and can provide scaleable Internet services to users with various service levels. In this paper, we establish a queuing model for FE (forwarding engine) including service differentiation, which performs IP address lookup in MPLS LER, and evaluate performance of FE with Internet traffic by statistical Internet protocol analysis. Also we take a closer look into our LC (label controlled)-ATM switch on which we implement an MPLS controller that can provide both user and provider with relative proportional differentiated service in a feasible and reliable manner.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128452242","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}
K. El-Khazen, F. Lefevre, David Garrec, Michel Guiraudou, O. Benali
{"title":"Beyond 3G demonstrator for enhanced service signaling, discovery and management","authors":"K. El-Khazen, F. Lefevre, David Garrec, Michel Guiraudou, O. Benali","doi":"10.1109/ISCC.2003.1214304","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214304","url":null,"abstract":"The advent of cooperating IP-enabled heterogeneous radio networks will offer, under the \"beyond 3G\" vision, ubiquitous services. In this new challenging context, a novel architecture has been designed within the control plane to avoid modification of existing networks. Therefore, a new entity in the network, a complementary middleware in the terminal, and enhanced signaling protocols were introduced. In order to prove the deployment feasibility of this solution, a testbed has also been implemented to demonstrate service signaling, discovery and management concepts in such a heterogeneous environment. This paper presents different functionalities and components that have been prototyped in this \"beyond 3G\" demonstrator, as well as our experience in building such a complex testbed.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"125 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113970150","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}
{"title":"Fair noiseless broadcast source coding","authors":"S. Boztaş","doi":"10.1109/ISCC.2003.1214292","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214292","url":null,"abstract":"We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector X/sub 1//sup n/ = (X/sub 1/, X/sub 2/, ..., X/sub n/) to n receivers, where receiver k is only interested in the component X/sub k/. A source encoding is a binary sequence f = (f/sub 1/, f/sub 2/, ...) which is chosen by the transmitter. The expected time at which the k/sup th/ receiver determines X/sub k/ is denoted l(f, k). This means that the initial segment (f/sub 1/, f/sub 2/, ..., f/sub l(f, k)/) of the encoding allows unique decoding of X/sub k/. We define the performance measure L(n) = min/sub f/ max/sup k/ l(f, k), where the minimization is over all possible encoding, and wish to approach it by practical schemes. For the case of independent but not necessarily identically distributed Bernoulli sources, we demonstrate encoding scheme f for which; lim /sub n/spl rarr//spl infin// [max/sub k/ l(f, k)/(n + 1)/2] = 1, where n+1/2 is the arithmetic mean of the values (l(f, K))/sub k=1//sup n/ obtained by the naive scheme f/sub k/ = X/sub k/. In the naive scheme, the worst case receiver learns its value only after n bits have been received, so this is a substantial improvement. In conclusion, we constructively establish that the inequality L(n) /spl les/ n+3/2 holds for stationary, ergodic and bitwise independent sources. We also generalize our results to the case where each receiver is interested in a block of data, as opposed to only one bit. The determination of flower bounds on L(n) is still open.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127792449","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}
{"title":"Comparing communication mechanisms in a distributed system","authors":"Hing Pan Leung, S. Manoharan","doi":"10.1109/ISCC.2003.1214282","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214282","url":null,"abstract":"This paper compares three communication mechanisms, sockets, message queues, and CORBA, using a large distributed telephone billing system. It compares different distributed implementations using these three communication mechanisms, and presents performance results, and discusses other qualitative factors such as the ease of use and probability of the mechanisms.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123309530","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}
{"title":"CSMA/IC: a new class of collision-free MAC protocols for ad hoc wireless networks","authors":"Tiantong You, C. Yeh, H. Hassanein","doi":"10.1109/ISCC.2003.1214222","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214222","url":null,"abstract":"In this paper, we present a new collision-free MAC protocol-carrier sense media access with ID countdown (CSMA/IC) for ad hoc wireless networks that can achieve 100% collision-free performance by solving the \"hidden terminal\" problem and the concurrent sending problem. Compared to CSMA/IC of IEEE 802.11, it also improves the network's performance in decreasing the network's throughput significantly. Furthermore, it can enable different packets with different priority to access the media and thus gain QoS.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122075207","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}