Future Internet research is needed to bring the Internet and the Things closer to each other to form the Internet of Things. As objects in our daily life gradually become smarter, there is an increasing benefit of networking these objects. In this article, a method to couple objects, the Things, to the Internet is suggested. The solution uses virtual representations of objects by using low-cost, passive RFID tags to give objects identities on the Internet. A prototype that maps an RFID identity into an IPv6 address is constructed. It is illustrated how this approach can be used in access control systems based on open network protocols and packet filtering. The solution includes a novel RFID reader architecture that supports the internetworking of components of a future access control system based on network layer technology.
{"title":"Access Control with RFID in the Internet of Things","authors":"Steffen Elmstrom Holst Jensen, R. Jacobsen","doi":"10.1109/WAINA.2013.199","DOIUrl":"https://doi.org/10.1109/WAINA.2013.199","url":null,"abstract":"Future Internet research is needed to bring the Internet and the Things closer to each other to form the Internet of Things. As objects in our daily life gradually become smarter, there is an increasing benefit of networking these objects. In this article, a method to couple objects, the Things, to the Internet is suggested. The solution uses virtual representations of objects by using low-cost, passive RFID tags to give objects identities on the Internet. A prototype that maps an RFID identity into an IPv6 address is constructed. It is illustrated how this approach can be used in access control systems based on open network protocols and packet filtering. The solution includes a novel RFID reader architecture that supports the internetworking of components of a future access control system based on network layer technology.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708979","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}
Wun-Yuan Huang, Jen-Wei Hu, Tahsin Chou, Te-Lung Liu
Due to rapid development of Internet, the amount of users around the globe is fast-growing in the past 30 years. It leads to the appearance of many problems, such as lack of IPaddresses, worse quality of service, and so on. In order to resolve these problems, many researchers start to design and implement innovative network architectures, which we call Future Internet. Most Future Internet projects in the world deploy OpenFlow technology developed by Stanford University in current network backbone to setup programmable Future Internet test beds. Currently, many international experiments have at least one controller for each organization in order to decrease overheads in single controller environment. In this paper, we study and implement real-time flow viewer across different domains based on the automatic network topology discovery system from our previous work. The real-time flow viewer can be used as a network management tool for validation of inter-domain flow assignment and observation of network activities across different domains.
{"title":"Design and Implementation of Real-Time Flow Viewer across Different Domains","authors":"Wun-Yuan Huang, Jen-Wei Hu, Tahsin Chou, Te-Lung Liu","doi":"10.1109/WAINA.2013.67","DOIUrl":"https://doi.org/10.1109/WAINA.2013.67","url":null,"abstract":"Due to rapid development of Internet, the amount of users around the globe is fast-growing in the past 30 years. It leads to the appearance of many problems, such as lack of IPaddresses, worse quality of service, and so on. In order to resolve these problems, many researchers start to design and implement innovative network architectures, which we call Future Internet. Most Future Internet projects in the world deploy OpenFlow technology developed by Stanford University in current network backbone to setup programmable Future Internet test beds. Currently, many international experiments have at least one controller for each organization in order to decrease overheads in single controller environment. In this paper, we study and implement real-time flow viewer across different domains based on the automatic network topology discovery system from our previous work. The real-time flow viewer can be used as a network management tool for validation of inter-domain flow assignment and observation of network activities across different domains.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116688660","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}
Attacks on the signaling plane have been well documented for different generations of cellular networks. The effects of these attacks vary from a decrease in the quality of service (QoS) all the way to a denial of service (DoS). Long Term Evolution (LTE) is the next generation cellular network that is primarily designed based on the IP protocol and is expected to achieve wide scale adoption worldwide. LTE employs a different network architecture than its predecessors that should allow for more efficient processing of signaling and data packets. In this paper, we investigate the effects of signaling attacks against Timeworks. An attack consists of malicious users who take advantage of the signaling overhead required to setup and release dedicated bearers in order to overload the signaling plane by repeatedly triggering dedicated bearers requests. The attack is simulated in OPNET under diverse scenarios in order to assess the effects of the increased signaling on the different LTE network entities. The results show that the increased signaling traffic causes higher processing loads at the Enhanced Node-B(eNB) as well as the Evolved Packet Core. We also present a comparison of the signaling requirements in LTE and UMTS.
{"title":"Effects of Signaling Attacks on LTE Networks","authors":"R. Bassil, I. Elhajj, A. Chehab, A. Kayssi","doi":"10.1109/WAINA.2013.136","DOIUrl":"https://doi.org/10.1109/WAINA.2013.136","url":null,"abstract":"Attacks on the signaling plane have been well documented for different generations of cellular networks. The effects of these attacks vary from a decrease in the quality of service (QoS) all the way to a denial of service (DoS). Long Term Evolution (LTE) is the next generation cellular network that is primarily designed based on the IP protocol and is expected to achieve wide scale adoption worldwide. LTE employs a different network architecture than its predecessors that should allow for more efficient processing of signaling and data packets. In this paper, we investigate the effects of signaling attacks against Timeworks. An attack consists of malicious users who take advantage of the signaling overhead required to setup and release dedicated bearers in order to overload the signaling plane by repeatedly triggering dedicated bearers requests. The attack is simulated in OPNET under diverse scenarios in order to assess the effects of the increased signaling on the different LTE network entities. The results show that the increased signaling traffic causes higher processing loads at the Enhanced Node-B(eNB) as well as the Evolved Packet Core. We also present a comparison of the signaling requirements in LTE and UMTS.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990303","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}
Mobile phones are characterized by limited energy sources. Saving this energy is therefore a primordial subject. As well as for the low level communication protocols (typically from Physical and MAC layers), unnecessary energy consumption can be caused by the behavior of high level protocols, typically from Application and Transport layers. In this paper, we study the case of a classical but not well-known mechanism, the "keep alive mechanism", that induces increase of the energetic cost on mobile phones. We then propose a solution to reduce this cost and provide NS-3 experimentations that show the resulting benefits.
{"title":"Reducing Energy Cost of Keepalive Messages in 3G Mobiles","authors":"Mohamed Oulmahdi, C. Chassot, E. Exposito","doi":"10.1109/WAINA.2013.247","DOIUrl":"https://doi.org/10.1109/WAINA.2013.247","url":null,"abstract":"Mobile phones are characterized by limited energy sources. Saving this energy is therefore a primordial subject. As well as for the low level communication protocols (typically from Physical and MAC layers), unnecessary energy consumption can be caused by the behavior of high level protocols, typically from Application and Transport layers. In this paper, we study the case of a classical but not well-known mechanism, the \"keep alive mechanism\", that induces increase of the energetic cost on mobile phones. We then propose a solution to reduce this cost and provide NS-3 experimentations that show the resulting benefits.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127123649","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}
P. Bull, G. Antonopoulos, L. Guan, Xingang Wang, Xunli Fan
The complex interactions inherent in mobile, dynamic systems require a representative model of node movement properties. Dynamic systems proposed within industry, particularly in the military domain, have a requirement for dependable communication and include heterogeneous nodes (varying from personal devices, to aircraft with complex sensors). Existing node mobility models have been found to not be adequate for capturing the properties of these systems due to their tendency to focus on systems with nodes of a single type, or characteristic. In this paper, a Multi-Class Mobility Model (MCMM) is proposed. This is a hybrid, class-based model operating with both single entity and group mobility patterns. Within this model nodes can be specified in a range of classes, based on their movement properties (including acceleration/deceleration factors and maximum speed). Simulation based experimentation implements MCMM, in conjunction with a previously proposed Quality of Service framework. This provides an opportunity to evaluate the mobility model in terms of its affect on system utilisation and stability. Through simulation, MCMM is compared with existing Random Walk/Random Waypoint and Reference Point Group Models. MCMM is shown to offer a more representative node movement, resulting in a comparable and representative system utilisation. This is achieved while offering a more stable system model with less communication disruption due to lost network connections.
{"title":"A Multi-Class Mobility Model for Dynamic and Dependable Systems","authors":"P. Bull, G. Antonopoulos, L. Guan, Xingang Wang, Xunli Fan","doi":"10.1109/WAINA.2013.28","DOIUrl":"https://doi.org/10.1109/WAINA.2013.28","url":null,"abstract":"The complex interactions inherent in mobile, dynamic systems require a representative model of node movement properties. Dynamic systems proposed within industry, particularly in the military domain, have a requirement for dependable communication and include heterogeneous nodes (varying from personal devices, to aircraft with complex sensors). Existing node mobility models have been found to not be adequate for capturing the properties of these systems due to their tendency to focus on systems with nodes of a single type, or characteristic. In this paper, a Multi-Class Mobility Model (MCMM) is proposed. This is a hybrid, class-based model operating with both single entity and group mobility patterns. Within this model nodes can be specified in a range of classes, based on their movement properties (including acceleration/deceleration factors and maximum speed). Simulation based experimentation implements MCMM, in conjunction with a previously proposed Quality of Service framework. This provides an opportunity to evaluate the mobility model in terms of its affect on system utilisation and stability. Through simulation, MCMM is compared with existing Random Walk/Random Waypoint and Reference Point Group Models. MCMM is shown to offer a more representative node movement, resulting in a comparable and representative system utilisation. This is achieved while offering a more stable system model with less communication disruption due to lost network connections.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123300776","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}
F. Gall, Sophie Vallet Chevillard, A. Gluhak, Zhan Xueli
The development of an IoT deployment benchmarking framework is proposed. The framework, aimed at supporting policy decision process, expresses visions from 4 different stakeholders and proposes a comprehensive approach including 7 dimensions within a taxonomy to be used as a basis for the selection of benchmarking indicators. A consultative approach based on web survey and stakeholders interviews is proposed to evaluate robustness of the proposed benchmark.
{"title":"Benchmarking Internet of Things Deployments in Smart Cities","authors":"F. Gall, Sophie Vallet Chevillard, A. Gluhak, Zhan Xueli","doi":"10.1109/WAINA.2013.230","DOIUrl":"https://doi.org/10.1109/WAINA.2013.230","url":null,"abstract":"The development of an IoT deployment benchmarking framework is proposed. The framework, aimed at supporting policy decision process, expresses visions from 4 different stakeholders and proposes a comprehensive approach including 7 dimensions within a taxonomy to be used as a basis for the selection of benchmarking indicators. A consultative approach based on web survey and stakeholders interviews is proposed to evaluate robustness of the proposed benchmark.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125382056","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}
Traffic modeling, traffic decomposition, and traffic engineering are some of the applications of traffic characterization that are mainly based on statistical characteristics of the network traffic. Many empirical analyses on Internet traffic traces show that the flow inter-arrival time distribution generally follows the Weibull distribution. As the scale of the network becomes larger, the Weibull distribution degrades to the Poisson distribution and when the flow arrival rate is high, it asymptotically converges to the Normal distribution. The aggregated traffic on high bandwidth links is the result of statistical multiplexing of many traffic sources, and the flow arrival rate on these links is sufficiently large. In this paper, using empirical analysis conducted by means of our Trace Analyzing Tool, along with ns2 simulations, we show that the aggregated short-lived flows on high-bandwidth links show Gaussian characteristics. Hence, using an adequate denoising filter, the short-lived flows can be separated.
{"title":"On the Gaussian Characteristics of Aggregated Short-Lived Flows on High-Bandwidth Links","authors":"G. Kahe, A. Jahangir","doi":"10.1109/WAINA.2013.109","DOIUrl":"https://doi.org/10.1109/WAINA.2013.109","url":null,"abstract":"Traffic modeling, traffic decomposition, and traffic engineering are some of the applications of traffic characterization that are mainly based on statistical characteristics of the network traffic. Many empirical analyses on Internet traffic traces show that the flow inter-arrival time distribution generally follows the Weibull distribution. As the scale of the network becomes larger, the Weibull distribution degrades to the Poisson distribution and when the flow arrival rate is high, it asymptotically converges to the Normal distribution. The aggregated traffic on high bandwidth links is the result of statistical multiplexing of many traffic sources, and the flow arrival rate on these links is sufficiently large. In this paper, using empirical analysis conducted by means of our Trace Analyzing Tool, along with ns2 simulations, we show that the aggregated short-lived flows on high-bandwidth links show Gaussian characteristics. Hence, using an adequate denoising filter, the short-lived flows can be separated.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518551","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}
Channel access delay in a wireless adhoc network is the major source of delay while considering the total end to-end delay. Channel access delays experienced by different relay nodes are different in multi-hop adhoc network scenario. These delays in multi-hop network are analysed in the literature assuming channel access delays are independent and are of same magnitude at all the nodes in the network. In this work, the end to-end delay in a multi-hop adhoc network is analysed taking into account the silent relay nodes. Along with silent relay node effect, Channel access probability (p), transmission radius (r) analogous to transmit power, network throughput and density of nodes arête other factors considered for the end-to-end delay analysis. Effect of network parameters along with silent relay nodes on end-to-end delay is found to be considerably high compared to the previous literature results. Given a bound on end-to-end delay with percentage of silent relay nodes, throughput, node density requirements for a multi-hop adhoc network, optimal ranges of transmission radius and channel access probability can be obtained from the proposed analysis. End-to-end delay increases with silent relay nodes along with transmission radius(r), channel access probability(p), node density and throughput. It is clear from the analysis, that the effect of silent relay nodes on end to-end delay cannot be ignored to maintain certain Quality of service (QoS) metrics for the multi-hop wireless adhoc network.
{"title":"Effect of Relay Nodes on End-to-End Delay in Multi-hop Wireless Ad-hoc Networks","authors":"Raja Vara Prasad Yerra, P. Rajalakshmi","doi":"10.1109/WAINA.2013.181","DOIUrl":"https://doi.org/10.1109/WAINA.2013.181","url":null,"abstract":"Channel access delay in a wireless adhoc network is the major source of delay while considering the total end to-end delay. Channel access delays experienced by different relay nodes are different in multi-hop adhoc network scenario. These delays in multi-hop network are analysed in the literature assuming channel access delays are independent and are of same magnitude at all the nodes in the network. In this work, the end to-end delay in a multi-hop adhoc network is analysed taking into account the silent relay nodes. Along with silent relay node effect, Channel access probability (p), transmission radius (r) analogous to transmit power, network throughput and density of nodes arête other factors considered for the end-to-end delay analysis. Effect of network parameters along with silent relay nodes on end-to-end delay is found to be considerably high compared to the previous literature results. Given a bound on end-to-end delay with percentage of silent relay nodes, throughput, node density requirements for a multi-hop adhoc network, optimal ranges of transmission radius and channel access probability can be obtained from the proposed analysis. End-to-end delay increases with silent relay nodes along with transmission radius(r), channel access probability(p), node density and throughput. It is clear from the analysis, that the effect of silent relay nodes on end to-end delay cannot be ignored to maintain certain Quality of service (QoS) metrics for the multi-hop wireless adhoc network.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"1108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116056999","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}
S. K. Dhurandher, I. Woungang, Sahil Sharma, Veeresh Goswami
Under the current scenario, many applications, across various domains of real world, are utilizing the Wireless LAN (WLAN) technology. With its growing usage, the requirement for QoS in WLAN has also gained significance. The most prevalent WLAN standard IEEE 802.11 does not provide QoS. In order to render service differentiation in the existing IEEE 802.11 scheme, we have presented a priority based differentiation scheme. The proposed scheme is implemented during the contention process of the existing DCF method. The contention window is divided with respect to various priority levels. The priority levels are decided on the basis of the data sensed by the station. The higher priority levels contend with a lower random back-off value and thus, are favored during transmission. Although, IEEE802.11e, the enhanced version of IEEE802.11, does provide QoS, our scheme is easier to implement on the existing legacy DCF systems. The proposed scheme modifies only the contention window and not parameters like Inter Frame Space, unlike IEEE 802.11e. We have presented the analysis of this suggested prioritization strategy on the basis of average delay, average throughput and packet received to packet sent ratio through the simulation result.
{"title":"A Priority Based Differentiation for Contention Mechanism in Legacy DCF Method","authors":"S. K. Dhurandher, I. Woungang, Sahil Sharma, Veeresh Goswami","doi":"10.1109/WAINA.2013.251","DOIUrl":"https://doi.org/10.1109/WAINA.2013.251","url":null,"abstract":"Under the current scenario, many applications, across various domains of real world, are utilizing the Wireless LAN (WLAN) technology. With its growing usage, the requirement for QoS in WLAN has also gained significance. The most prevalent WLAN standard IEEE 802.11 does not provide QoS. In order to render service differentiation in the existing IEEE 802.11 scheme, we have presented a priority based differentiation scheme. The proposed scheme is implemented during the contention process of the existing DCF method. The contention window is divided with respect to various priority levels. The priority levels are decided on the basis of the data sensed by the station. The higher priority levels contend with a lower random back-off value and thus, are favored during transmission. Although, IEEE802.11e, the enhanced version of IEEE802.11, does provide QoS, our scheme is easier to implement on the existing legacy DCF systems. The proposed scheme modifies only the contention window and not parameters like Inter Frame Space, unlike IEEE 802.11e. We have presented the analysis of this suggested prioritization strategy on the basis of average delay, average throughput and packet received to packet sent ratio through the simulation result.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122599250","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}
Modern enterprise organisations rely on dynamic processes. Generally these processes cannot be modelled once and executed repeatedly without change. Enterprise processes execution may evolve unpredictably according to situations that cannot always be prescribed. However, no mechanism exists to ensure an updated process does not violate any compliance requirements. This paper presents a novel enterprise system architecture to combine the techniques of adaptive and compliance workflow solutions and adopting the Business Process Modelling Notation (BPMN) standards. The proposed Adaptive and Compliance Workflow Management System (ACWfMS) enables the development of a workflow management tool to create or update a standard and user-defined model. It automatically validates compliance by comparing a user-defined model against a standard model, and in case of violations, visual feedback is presented to the user. In addition, the architecture facilitates process migration to manage instances with modified definition. An example application of a postgraduate research process is discussed.
{"title":"A Novel Workflow Management System for Handling Process Adaptation and Compliance","authors":"M. Omar, P. Chung, C. Dawson","doi":"10.1109/WAINA.2013.258","DOIUrl":"https://doi.org/10.1109/WAINA.2013.258","url":null,"abstract":"Modern enterprise organisations rely on dynamic processes. Generally these processes cannot be modelled once and executed repeatedly without change. Enterprise processes execution may evolve unpredictably according to situations that cannot always be prescribed. However, no mechanism exists to ensure an updated process does not violate any compliance requirements. This paper presents a novel enterprise system architecture to combine the techniques of adaptive and compliance workflow solutions and adopting the Business Process Modelling Notation (BPMN) standards. The proposed Adaptive and Compliance Workflow Management System (ACWfMS) enables the development of a workflow management tool to create or update a standard and user-defined model. It automatically validates compliance by comparing a user-defined model against a standard model, and in case of violations, visual feedback is presented to the user. In addition, the architecture facilitates process migration to manage instances with modified definition. An example application of a postgraduate research process is discussed.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123027319","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}