Sakib Mondal - Profile on Academia.edu (original) (raw)

Papers by Sakib Mondal

Improved Algorithm for Resource Allocation Problems

Asia-Pacific Journal of Operational Research

We consider the problem of allocating a set of resources for performing a given collection of job... more We consider the problem of allocating a set of resources for performing a given collection of jobs. Each of the jobs has specific resource requirement for its execution. Each resource has specific start time, finish time and associated cost per unit usage. The objective is to execute the jobs while incurring minimum cost. The problem is NP-hard. We improve known four-approximation to a three-approximation algorithm. Our algorithm implies better approximation for two other related problems.

An improved approximation algorithm for hierarchical clustering

Pattern Recognition Letters

RAIRO - Operations Research

We consider a NP-hard resource allocation problem of allocating a set of resources to meet demand... more We consider a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost. Each resource has a start time, finish time, availability and cost. The objective of the problem is to assign resources to meet the demands so that the overall cost is minimum. It is necessary that only one resource contributes to the demand of a slot. This constraint will be referred to as single resource assignment (SRA) constraint. We would refer to the problem as the S_RA problem. So far, only 16-approximation to this problem is known. In this paper, we propose an algorithm with approximation ratio of 12.

Reusable Resource Scheduling via Colored Interval Covering

2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016

System and method for managing playout time in packet communication network

Computer Networks the International Journal of Computer and Telecommunications Networking, Sep 1, 2007

Today there is a growing demand for Internet services over WLAN hotspots. Majority of the Interne... more Today there is a growing demand for Internet services over WLAN hotspots. Majority of the Internet services today are based on TCP. However, TCP is not well-suited for heterogeneous networks consisting of wired and wireless networks. Losses in wireless network, which are quite frequent, are often misinterpreted by the TCP sender as loss due to congestion, which leads to poor performance of TCP. Hence, it is important to shield the TCP sender from wireless error. In this paper, we propose an improved method for identifying cases of wireless losses and tackling the loss at the local link level through MAC layer retransmissions. We then evaluate the effect of MAC layer retransmissions on the performance of TCP both analytically and empirically. Our empirical results show that significant improvement in TCP performance is possible through MAC layer retransmission.

A Framework for Multi-agent Based Applications

Ic Ai, 2002

Method and system for providing reliable and fast communications with mobile entities

TCBB Scheme: Applications to Single Machine Job Sequencing Problems

Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine qua... more Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencing problems which are of more practical importance and which are also of considerable interest in the area of AI search. In the weighted earliness tardiness problem (WET), the best known heuristic estimate is not consistent; this is contrary to the general belief about relaxation-based heuristic. In the quadratic penalty problem involving setup times (SQP) of jobs, the evaluation function is non-order-preserving In this paper, we present the TCBB scheme to solve these problems as well. Experiments indicate that (i) for the WET problem, the TCBB scheme is highly effective in solving large problem instances and (ii) for the SQP problem, it can solve larger instances than algorithm GREC in a given available memory.

Choosing a middleware for web-integration of a legacy application

ACM SIGSOFT Software Engineering Notes, 2000

Business applications today often face two contradictory constraints: they have to deal with hete... more Business applications today often face two contradictory constraints: they have to deal with heterogeneous platforms and at the same time meet the quality requirements. A larger number of middleware products are available to meet the first objective. An architect invariably faces a problem of picking up the right kind of middleware for the problem at hand. Fortunately, the second objective of quality requirements help an architect narrow down the choices of middleware. In this article, we demonstrate this fact through a project of web-integration of a legacy invoicing system.

Minimization of squared deviation of completion times about a common due date

Exploiting multihoming for low latency handoff in heterogeneous networks

Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005., 2005

... II. RELATED WORK Low latency handoff requires optimization at layer 2 and 3. Layer 2 optimiza... more ... II. RELATED WORK Low latency handoff requires optimization at layer 2 and 3. Layer 2 optimizations relate to optimal ... multihoming and interface selection have received significant attention in the IEEE 802.21 Working Group on Media Independent Handover Interoperability [ ...

An Enhanced Service Discovery Protocol for Bluetooth Scatternets

2006 ACS/IEEE International Conference on Pervasive Services, 2006

Service discovery lies at the heart of practical utility of Bluetooth scatternets. Even though Bl... more Service discovery lies at the heart of practical utility of Bluetooth scatternets. Even though Bluetooth incorporates a simple, lightweight SDP, it fails to provide efficient service discovery in complex usage scenarios such as service discovery on scatternets. In this paper, we propose augmentation to Bluetooth SDP to make it suitable for scatternets. We also present a detailed numerical and simulation analysis of the augmented SDP. The results validate the efficiency and practical utility of the enhanced SDP

MAPS: Multi-Attribute Search in P2P Networks using Schema

2006 14th IEEE International Conference on Networks, 2006

Page 1. MAPS: MULTI-ATTRIBUTE SEARCH IN P2P NETWORKS USING SCHEMA Srikumar Krishnamoorthy, Sakib ... more Page 1. MAPS: MULTI-ATTRIBUTE SEARCH IN P2P NETWORKS USING SCHEMA Srikumar Krishnamoorthy, Sakib A. Mondal Software Engineering and Technology Labs, Infosys Technologies Ltd, Hosur Road, Bangalore, INDIA {srikumar k,kabd sai & v ...

Nuts and Bolts of Mobile IP

Series in Computer Science, 2003

Integrating Mobile and Fixed IP

Series in Computer Science, 2003

A multi-agent system for sales order processing

intelligence, 2001

intelligence. Volume 12, Number 3 (2001), Pages 32-42. Cover story: Sales order processing: a mul... more intelligence. Volume 12, Number 3 (2001), Pages 32-42. Cover story: Sales order processing: a multi-agent system for sales order processing. Abdul Sakib Mondal, Ayush Kumar Jain. ...

Developing for Mobile IP

Series in Computer Science, 2003

Future Directions

Series in Computer Science, 2003

Business Applications

Series in Computer Science, 2003

Improved Algorithm for Resource Allocation Problems

Asia-Pacific Journal of Operational Research

We consider the problem of allocating a set of resources for performing a given collection of job... more We consider the problem of allocating a set of resources for performing a given collection of jobs. Each of the jobs has specific resource requirement for its execution. Each resource has specific start time, finish time and associated cost per unit usage. The objective is to execute the jobs while incurring minimum cost. The problem is NP-hard. We improve known four-approximation to a three-approximation algorithm. Our algorithm implies better approximation for two other related problems.

An improved approximation algorithm for hierarchical clustering

Pattern Recognition Letters

RAIRO - Operations Research

We consider a NP-hard resource allocation problem of allocating a set of resources to meet demand... more We consider a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost. Each resource has a start time, finish time, availability and cost. The objective of the problem is to assign resources to meet the demands so that the overall cost is minimum. It is necessary that only one resource contributes to the demand of a slot. This constraint will be referred to as single resource assignment (SRA) constraint. We would refer to the problem as the S_RA problem. So far, only 16-approximation to this problem is known. In this paper, we propose an algorithm with approximation ratio of 12.

Reusable Resource Scheduling via Colored Interval Covering

2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016

System and method for managing playout time in packet communication network

Computer Networks the International Journal of Computer and Telecommunications Networking, Sep 1, 2007

Today there is a growing demand for Internet services over WLAN hotspots. Majority of the Interne... more Today there is a growing demand for Internet services over WLAN hotspots. Majority of the Internet services today are based on TCP. However, TCP is not well-suited for heterogeneous networks consisting of wired and wireless networks. Losses in wireless network, which are quite frequent, are often misinterpreted by the TCP sender as loss due to congestion, which leads to poor performance of TCP. Hence, it is important to shield the TCP sender from wireless error. In this paper, we propose an improved method for identifying cases of wireless losses and tackling the loss at the local link level through MAC layer retransmissions. We then evaluate the effect of MAC layer retransmissions on the performance of TCP both analytically and empirically. Our empirical results show that significant improvement in TCP performance is possible through MAC layer retransmission.

A Framework for Multi-agent Based Applications

Ic Ai, 2002

Method and system for providing reliable and fast communications with mobile entities

TCBB Scheme: Applications to Single Machine Job Sequencing Problems

Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine qua... more Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencing problems which are of more practical importance and which are also of considerable interest in the area of AI search. In the weighted earliness tardiness problem (WET), the best known heuristic estimate is not consistent; this is contrary to the general belief about relaxation-based heuristic. In the quadratic penalty problem involving setup times (SQP) of jobs, the evaluation function is non-order-preserving In this paper, we present the TCBB scheme to solve these problems as well. Experiments indicate that (i) for the WET problem, the TCBB scheme is highly effective in solving large problem instances and (ii) for the SQP problem, it can solve larger instances than algorithm GREC in a given available memory.

Choosing a middleware for web-integration of a legacy application

ACM SIGSOFT Software Engineering Notes, 2000

Business applications today often face two contradictory constraints: they have to deal with hete... more Business applications today often face two contradictory constraints: they have to deal with heterogeneous platforms and at the same time meet the quality requirements. A larger number of middleware products are available to meet the first objective. An architect invariably faces a problem of picking up the right kind of middleware for the problem at hand. Fortunately, the second objective of quality requirements help an architect narrow down the choices of middleware. In this article, we demonstrate this fact through a project of web-integration of a legacy invoicing system.

Minimization of squared deviation of completion times about a common due date

Exploiting multihoming for low latency handoff in heterogeneous networks

Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005., 2005

... II. RELATED WORK Low latency handoff requires optimization at layer 2 and 3. Layer 2 optimiza... more ... II. RELATED WORK Low latency handoff requires optimization at layer 2 and 3. Layer 2 optimizations relate to optimal ... multihoming and interface selection have received significant attention in the IEEE 802.21 Working Group on Media Independent Handover Interoperability [ ...

An Enhanced Service Discovery Protocol for Bluetooth Scatternets

2006 ACS/IEEE International Conference on Pervasive Services, 2006

Service discovery lies at the heart of practical utility of Bluetooth scatternets. Even though Bl... more Service discovery lies at the heart of practical utility of Bluetooth scatternets. Even though Bluetooth incorporates a simple, lightweight SDP, it fails to provide efficient service discovery in complex usage scenarios such as service discovery on scatternets. In this paper, we propose augmentation to Bluetooth SDP to make it suitable for scatternets. We also present a detailed numerical and simulation analysis of the augmented SDP. The results validate the efficiency and practical utility of the enhanced SDP

MAPS: Multi-Attribute Search in P2P Networks using Schema

2006 14th IEEE International Conference on Networks, 2006

Page 1. MAPS: MULTI-ATTRIBUTE SEARCH IN P2P NETWORKS USING SCHEMA Srikumar Krishnamoorthy, Sakib ... more Page 1. MAPS: MULTI-ATTRIBUTE SEARCH IN P2P NETWORKS USING SCHEMA Srikumar Krishnamoorthy, Sakib A. Mondal Software Engineering and Technology Labs, Infosys Technologies Ltd, Hosur Road, Bangalore, INDIA {srikumar k,kabd sai & v ...

Nuts and Bolts of Mobile IP

Series in Computer Science, 2003

Integrating Mobile and Fixed IP

Series in Computer Science, 2003

A multi-agent system for sales order processing

intelligence, 2001

intelligence. Volume 12, Number 3 (2001), Pages 32-42. Cover story: Sales order processing: a mul... more intelligence. Volume 12, Number 3 (2001), Pages 32-42. Cover story: Sales order processing: a multi-agent system for sales order processing. Abdul Sakib Mondal, Ayush Kumar Jain. ...

Developing for Mobile IP

Series in Computer Science, 2003

Future Directions

Series in Computer Science, 2003

Business Applications

Series in Computer Science, 2003