{"title":"An architecture for end-to-end and inter-domain trusted mail delivery service","authors":"Erkut Sinan Ayla, A. Ozgit","doi":"10.1109/ISCN.2006.1662537","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662537","url":null,"abstract":"Common methods of e-mail delivery over the Internet is vulnerable to some significant security risks. In this study, a \"trusted mail gateway\" aiming at reliable and trusted end-to-end e-mail delivery is presented. The designed trusted mail gateway provides a domain with the basic security services that are message integrity, confidentiality, non-repudiation, origin authentication and availability while the message (e-mail) is being delivered through the Internet. It generates S/MIME digital signatures and performs S/MIME encryption on behalf of the domain using secret key cryptography and public-key techniques and generating cryptographic message syntax (CMS) data to provide origin authenticity, integrity and confidentiality. It applies anti-virus control and protection, spam filtering and content check to both incoming mails to the domain and outgoing mails from the domain to prevent attacks against availability. Trusted mail gateway also provides intra-domain security. It keeps e-mail messages in corresponding mailboxes as encrypted messages. Trusted mail gateway processes all the mails passing through and records processing results in a database as notary information. Moreover, it establishes trust relations with other registered trusted domains and exchanges notary information with them via a secure channel","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518564","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":"Comparison of OBS protocols","authors":"Pınar Kırcı, A. Zaim","doi":"10.1109/ISCN.2006.1662526","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662526","url":null,"abstract":"In this paper, we give an overview of all-optical networks. The classification of optical burst switched networks (OBS) which is one of the WDM schemes is proposed. We compare the performance of different traffic models on definite signaling protocols of OBS. These traffic models are IP/burst and multimedia traffic. As multimedia traffic we evaluate the performance of video traffic through all-optical network. We also investigate the affects of other traffics and network characteristics on application performance. The examined signaling protocols are JIT, JET and Horizon. We apply the exponential and hyperexponential distributions on these traffics for producing the inter-arrival times of the packets. We present a communication between a source client node and a destination client node over an ingress and one or more multiple intermediate switches. Our paper also includes burst setup, burst setup ack and keepalive message types. We propose a framework for calculating the dropping rates. As a result, we compare the signaling protocols according to the burst drop rates","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124377955","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":"Burst loss rate: is it precise enough?","authors":"B. Kantarci, S. Oktug, T. Atmaca","doi":"10.1109/ISCN.2006.1662529","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662529","url":null,"abstract":"In this paper the performance of some well-known OBS techniques is studied under self-similar and Poisson traffic using the TTh based burst assembly and the hybrid burst assembly. The results obtained are evaluated in terms of burst loss rate and byte loss rate, although, in the OBS literature, burst loss rate is a commonly encountered metric. It is observed that the burst loss rates are different than the corresponding byte loss rates since the size of optical bursts varies. Moreover, it is also seen that the performance ranking using burst loss rate is not equal to the performance ranking using byte loss rate under some cases due to the characteristics of the techniques","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"382 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123956497","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":"Recent trends and challenges in wireless networks","authors":"M. Obaidat","doi":"10.1109/ISCN.2006.1662499","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662499","url":null,"abstract":"This paper presents the keynote speech on the 7th International Symposium on Computer Networks held in Istanbul, Turkey. It addresses the current trends in research and development in wireless networks and communications. It also sheds some light on the future and challenges facing the progress in this fascinating technology. The speech also reviews fundamental techniques in the design, operation, and evaluation of wireless networks and systems. Some recent research results are presented including new protocols for wireless networks","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694062","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":"Improving the accuracy of SINR threshold lower bound for SINR-based call admission control in CDMA networks","authors":"M. Ahmed, Mahmoud El-Sayes","doi":"10.1109/ISCN.2006.1662538","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662538","url":null,"abstract":"Call admission control (CAC) is used in CDMA networks to guarantee the signal quality in terms of the signal-to-interference-and-noise ratio (SINR). SINR is employed as the criterion for user admission by comparing the SINR with a threshold value (SINR<sub>th</sub>). A small threshold level is desirable to reduce the blocking rate. However, a lower bound of SINR<sub>th</sub> is essential to keep the outage probability (P<sub>out</sub>) below a maximum value. A lower bound of SINR<sub>th</sub> (SINR<sub>th-lb</sub>) has been derived in M.H. Ahmed and H. Yanikomeroglu, (2005) by finding the relationship between P<sub>out</sub> and SINR<sub>th</sub>. Then, SINR<sub>th-lb</sub> is determined as the lowest SINR<sub>th</sub> that keeps P<sub>out</sub> below a certain P<sub>out_max</sub>. In this paper, we improve the accuracy of SINR<sub>th-lb</sub> by modeling the admitted traffic using a Markov model (instead of the inaccurate Poisson model used in M.H. Ahmed and H. Yanikomeroglu, (2005)). In addition, we improve the accuracy by choosing the transition value of the step function that approximates the conditional outage probability distribution using the minimum mean square error criterion","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372554","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":"MAI: multiple attributes integration for deadline-aware pull-based broadcast scheduling","authors":"Weiwei Cao, D. Aksoy","doi":"10.1109/ISCN.2006.1662508","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662508","url":null,"abstract":"With the uprising popularity of large-scale applications, highly scalable data delivery is becoming a major requirement. As the downlink bandwidth increases, it becomes critical for these applications to have efficient on-demand scheduling mechanisms to increase the number of users that can be supported for dynamically changing workloads. Meanwhile some emerging applications impose deadlines to complete the broadcast service. In this paper, we consider a time-critical wireless broadcast dissemination approach to meet user specific deadlines. We describe a deadline-aware algorithm, called the multiple attributes integration (MAI), to schedule on-demand requests based on a number of attributes. Our results suggest that MAI can significantly increase the system performance","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122095709","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}
Yoann Hinard, H. Bettahar, Y. Challal, A. Bouabdallah
{"title":"AAA based security architecture for multicast content distribution","authors":"Yoann Hinard, H. Bettahar, Y. Challal, A. Bouabdallah","doi":"10.1109/ISCN.2006.1662513","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662513","url":null,"abstract":"In this paper, we present a new multicast content distribution framework supporting content access control and accounting. MCDA2 (multicast content distribution architecture with accounting support) is based on the standard protocols Diameter and MLD (multicast listener discovery). It allows the generation and storage of individual and group accounting information of heterogeneous multicast members. This architecture offers easy integration and good scalability which could allow further multicast deployment","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129051811","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}
V. Balashov, V. Kostenko, R. Smeliansky, S. V. Vavinov
{"title":"A tool system for automatic scheduling of data exchange in real-time distributed embedded systems","authors":"V. Balashov, V. Kostenko, R. Smeliansky, S. V. Vavinov","doi":"10.1109/ISCN.2006.1662530","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662530","url":null,"abstract":"In this paper we address the problem of automatic generation of a data exchange schedule for the MIL STD-1553B multiplex data bus. This bus is widely used in modern real-time distributed embedded systems. Static scheduling strategy is typically used to build a schedule of data exchanges over this bus. We present heuristic algorithms developed to perform the scheduling with optimization of bus load and number of scheduled exchange commands. During the integration phase of the embedded system development, it is often the case that a correct data exchange schedule cannot be constructed due to excessive requirements to communication through the bus. We present algorithms for generation of suggestions on how to change the requirements within given ranges in order to make the schedule construction possible. A tool system for automatic generation of data exchange schedules is also presented, with its structure and key features","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880904","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":"Performance implications of control packet processing and optical switch configuration times for optical burst switched mesh networks with degree-four topologies","authors":"J. Rodrigues, M. Freire, P. Lorenz","doi":"10.1109/ISCN.2006.1662528","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662528","url":null,"abstract":"This paper investigates the influence of control packet (setup message) processing time and optical cross-connect (OXC) configuration time on the performance of optical burst switched (OBS) mesh networks with degree-four topologies. The performance analysis considers five resource reservation protocols, just-in-time (JIT), JumpStart, JIT+ , just-enough-time (JET) and Horizon, and focuses on the following topologies: degree-four chordal rings, mesh-torus, and the European optical network (EON). Among those topologies, D4T(1,19,3,9) leads to the best performance, while the worst performance is observed for EON. It is shown that the burst loss probability increases with the increase of the control packet processing time. It is also shown that values of OXC configuration time smaller than 1 ms does not have impact on the network performance, independently of the network topology or the resource reservation protocol. Moreover, the performance of the five protocols is very similar for the topologies under study","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"33 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116722838","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":"Adaptive online scheduling for asymmetric wireless sensor networks","authors":"S. Balasubramanian, D. Aksoy","doi":"10.1109/ISCN.2006.1662511","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662511","url":null,"abstract":"Increasing onboard processing capabilities of sensors enable self-organization in wireless sensor networks to dynamically adapt to ad-hoc topologies and to react to task or network changes. Such self-organization, however, comes at a cost of additional energy consumption of the sensor nodes with already limited power resources. Energy limitations of sensor nodes in unattended environments require a trade-off between power consumption and topology maintenance. In this paper we present our adaptive online scheduling (AOS) protocol that exploits application based data flow characteristics to reduce power consumption during self-organization. Data flow characteristics is used to govern route selection, and to formulate a collision-free transmission schedule that enables risk-free sleeping time. Our simulation results suggest that AOS's transmission schedule provides more than 50% energy savings in steady state in comparison to SMACS","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131083509","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}