Code71 has been developing, maintaining, and supporting a complex Web-based lead management solut... more Code71 has been developing, maintaining, and supporting a complex Web-based lead management solution for its US-based small-business client-Method Marketing, LLC using a remote Scrum [1] team. In this report, we describe the process that we used internally to implement ...
During the fall of 2004, IPRO 338 will continue the work of three previous IPRO teams in developi... more During the fall of 2004, IPRO 338 will continue the work of three previous IPRO teams in developing and implementing a knowledge management system (KMS) called iKNOW for the Interprofessional Projects (IPRO) program at Illinois Institute of Technology. Specifically, the Fall 2004 team ...
... Medical Informatics: Scoping Health Care Information Technology (semester?), IPRO 372. Barac,... more ... Medical Informatics: Scoping Health Care Information Technology (semester?), IPRO 372. Barac, Predrag; Dhingra, Mehak; Herrera ... IPRO 328. Gaonkar, Gautam; Gehrs, Scott; Haque, Sabeen; Kadakia, Vishal; Kim, Tae-young; Lee, Moon-won; Loomba, Rohit; Norby, Gerald ...
This work describes a system that allocates end-to-end bandwidth, in a switched meshed communicat... more This work describes a system that allocates end-to-end bandwidth, in a switched meshed communications network. The solution makes use of market-based software agents that compete in a number of decentralised marketplaces to buy and sell bandwidth resources. Agents perform a distributed depth first search with decentralised markets in order to allocate routes for calls. The approach relies on a resource reservation and commit mechanism in the network. Initial results show that under a light network load, the system sets up a high percentage of calls which is comparable to the optimum value and that, under all network loads, it performs significantly better than a random strategy.
The work in this thesis describes a system that allocates the end-to-end bandwidth, in a meshed c... more The work in this thesis describes a system that allocates the end-to-end bandwidth, in a meshed communications network, to set up calls. The solution makes use of market-based software agents that compete in a number of decentralised market-places in order to buy and sell bandwidth. The network is partitioned into regions, where each has a separate market server from where the bandwidth resources are allocated. Agents perform a distributed search with decentralised markets in order to allocate routes for calls. The approach relies on a resource reservation and commit mechanism in the network. Results show that for a typical network given a light load, the system sets up 95% of calls and is comparable in performance to an instantaneous global search, which assumes complete knowledge of resource availability and sets up 97% of calls at the same load. As the network load is increased to a typical intermediate level, the system gives an average call success rate which is 76% of that giv...
In this paper, we look at the problem of workforce redeployments where we consider the deployment... more In this paper, we look at the problem of workforce redeployments where we consider the deployment of field engineers within a company organisation. Traditional methods for solving such problems have focused primarily on using centralised decision makers and optimisation algorithms which compute results in a solely centralised manner. Now, auctions have shown to have been used successfully for allocating resources in various applications and systems. Thus, in this paper, we propose a system that makes use of auctions as a mechanism for allocating the resources (field engineers) between different geographical parts of an organisation.
NETNOMICS: Economic Research and Electronic Networking, 2006
In this paper, we consider issues associated with scalability and robustness in designing a marke... more In this paper, we consider issues associated with scalability and robustness in designing a market-based multi-agent system that allocates bandwidth in a communications network. Specifically, an empirical evaluation is carried out to assess the system performance under a variety of design configurations in order to provide an insight into network deployment issues. This extends our previous work in which we developed an application that makes use of market-based software agents that compete in decentralised marketplaces to buy and sell bandwidth resources in a network that is partitioned into regions, each with a separate market server. We investigate the average call success rate and average message load per market server, as the number of markets are scaled up in a fixed size network. The same investigations are performed in the presence of single market failures. Finally, for both the failure and non-failure cases, a trade-off is found between their average call success rates and message load per server in order to find an optimum number of regions to deploy in the network.
IEEE Journal on Selected Areas in Communications, 2005
The fundamental issue of quality-of-service (QoS) routing has triggered a lot of research during ... more The fundamental issue of quality-of-service (QoS) routing has triggered a lot of research during the last few years. However, the proposed algorithms attempt to route communication demands only on a call by call basis, without taking into account future traffic. There are nonetheless cases where the traffic profile is known. In this paper, we address this related problem to QoS routing, more specifically, the off-line planning of bandwidth allocation to demands known in advance. Shortest-path routing is the traditional technique applied to this problem. However, this can lead to poor network utilization and even congestion. We show how an abstraction technique combined with systematic search algorithms and heuristics derived from artificial intelligence make it possible to solve this problem more efficiently and in much tighter networks, in terms of bandwidth usage. In addition, this abstraction technique also allows to explain during search why some allocation problems are indeed infeasible. Then, the network regions between which bandwidth must be added are then identified.
In this paper, we consider issues related to scalability and robustness in designing a market-bas... more In this paper, we consider issues related to scalability and robustness in designing a market-based multi-agent system that allocates bandwidth in a communications network. Specifically, an empirical evaluation is carried out to assess the system performance under a variety of design configurations in order to provide an insight into network deployment issues. This extends our previous work in which we developed an application that makes use of market-based software agents that compete in decentralised marketplaces to buy and sell bandwidth resources. Our new results show that given a light to moderate network traffic load, partitioning the network into a few regions, each with a separate market server, gives a higher call success rate than by using a single market. Moreover, a trade-off in the number of regions was also noted between the average call success rate and the number of messages received per market server. Finally, given the possibility of market failures, we observe that the average call success rates increase with an increasing number of markets until a maximum is reached.
Code71 has been developing, maintaining, and supporting a complex Web-based lead management solut... more Code71 has been developing, maintaining, and supporting a complex Web-based lead management solution for its US-based small-business client-Method Marketing, LLC using a remote Scrum [1] team. In this report, we describe the process that we used internally to implement ...
During the fall of 2004, IPRO 338 will continue the work of three previous IPRO teams in developi... more During the fall of 2004, IPRO 338 will continue the work of three previous IPRO teams in developing and implementing a knowledge management system (KMS) called iKNOW for the Interprofessional Projects (IPRO) program at Illinois Institute of Technology. Specifically, the Fall 2004 team ...
... Medical Informatics: Scoping Health Care Information Technology (semester?), IPRO 372. Barac,... more ... Medical Informatics: Scoping Health Care Information Technology (semester?), IPRO 372. Barac, Predrag; Dhingra, Mehak; Herrera ... IPRO 328. Gaonkar, Gautam; Gehrs, Scott; Haque, Sabeen; Kadakia, Vishal; Kim, Tae-young; Lee, Moon-won; Loomba, Rohit; Norby, Gerald ...
This work describes a system that allocates end-to-end bandwidth, in a switched meshed communicat... more This work describes a system that allocates end-to-end bandwidth, in a switched meshed communications network. The solution makes use of market-based software agents that compete in a number of decentralised marketplaces to buy and sell bandwidth resources. Agents perform a distributed depth first search with decentralised markets in order to allocate routes for calls. The approach relies on a resource reservation and commit mechanism in the network. Initial results show that under a light network load, the system sets up a high percentage of calls which is comparable to the optimum value and that, under all network loads, it performs significantly better than a random strategy.
The work in this thesis describes a system that allocates the end-to-end bandwidth, in a meshed c... more The work in this thesis describes a system that allocates the end-to-end bandwidth, in a meshed communications network, to set up calls. The solution makes use of market-based software agents that compete in a number of decentralised market-places in order to buy and sell bandwidth. The network is partitioned into regions, where each has a separate market server from where the bandwidth resources are allocated. Agents perform a distributed search with decentralised markets in order to allocate routes for calls. The approach relies on a resource reservation and commit mechanism in the network. Results show that for a typical network given a light load, the system sets up 95% of calls and is comparable in performance to an instantaneous global search, which assumes complete knowledge of resource availability and sets up 97% of calls at the same load. As the network load is increased to a typical intermediate level, the system gives an average call success rate which is 76% of that giv...
In this paper, we look at the problem of workforce redeployments where we consider the deployment... more In this paper, we look at the problem of workforce redeployments where we consider the deployment of field engineers within a company organisation. Traditional methods for solving such problems have focused primarily on using centralised decision makers and optimisation algorithms which compute results in a solely centralised manner. Now, auctions have shown to have been used successfully for allocating resources in various applications and systems. Thus, in this paper, we propose a system that makes use of auctions as a mechanism for allocating the resources (field engineers) between different geographical parts of an organisation.
NETNOMICS: Economic Research and Electronic Networking, 2006
In this paper, we consider issues associated with scalability and robustness in designing a marke... more In this paper, we consider issues associated with scalability and robustness in designing a market-based multi-agent system that allocates bandwidth in a communications network. Specifically, an empirical evaluation is carried out to assess the system performance under a variety of design configurations in order to provide an insight into network deployment issues. This extends our previous work in which we developed an application that makes use of market-based software agents that compete in decentralised marketplaces to buy and sell bandwidth resources in a network that is partitioned into regions, each with a separate market server. We investigate the average call success rate and average message load per market server, as the number of markets are scaled up in a fixed size network. The same investigations are performed in the presence of single market failures. Finally, for both the failure and non-failure cases, a trade-off is found between their average call success rates and message load per server in order to find an optimum number of regions to deploy in the network.
IEEE Journal on Selected Areas in Communications, 2005
The fundamental issue of quality-of-service (QoS) routing has triggered a lot of research during ... more The fundamental issue of quality-of-service (QoS) routing has triggered a lot of research during the last few years. However, the proposed algorithms attempt to route communication demands only on a call by call basis, without taking into account future traffic. There are nonetheless cases where the traffic profile is known. In this paper, we address this related problem to QoS routing, more specifically, the off-line planning of bandwidth allocation to demands known in advance. Shortest-path routing is the traditional technique applied to this problem. However, this can lead to poor network utilization and even congestion. We show how an abstraction technique combined with systematic search algorithms and heuristics derived from artificial intelligence make it possible to solve this problem more efficiently and in much tighter networks, in terms of bandwidth usage. In addition, this abstraction technique also allows to explain during search why some allocation problems are indeed infeasible. Then, the network regions between which bandwidth must be added are then identified.
In this paper, we consider issues related to scalability and robustness in designing a market-bas... more In this paper, we consider issues related to scalability and robustness in designing a market-based multi-agent system that allocates bandwidth in a communications network. Specifically, an empirical evaluation is carried out to assess the system performance under a variety of design configurations in order to provide an insight into network deployment issues. This extends our previous work in which we developed an application that makes use of market-based software agents that compete in decentralised marketplaces to buy and sell bandwidth resources. Our new results show that given a light to moderate network traffic load, partitioning the network into a few regions, each with a separate market server, gives a higher call success rate than by using a single market. Moreover, a trade-off in the number of regions was also noted between the average call success rate and the number of messages received per market server. Finally, given the possibility of market failures, we observe that the average call success rates increase with an increasing number of markets until a maximum is reached.
Uploads
Papers by Nadim Haque