Outbound Queue stacking up for old destination

Hi Gurus,
I am implementing APO in a client and since the native integration (CIF) uses the same RFC structure as BW I need to keep an eye on BW processes as well.
The problem here is that they´ve migrated to BW7, killing the old 3.5 but leaving the logical system registered.
Now what is happening is that I found >4million queues in SMQ1 to this nowhere destination, which kills my CIF performance.
We´ve started to clean this garbage but the stack keeps adding up from regular goods movement transactions. The BASIS and BW team is not helping much so:
I need to find where I set the relationship between theses transactions and the destination so it does not go to the outbound queue.
thanks for the help!

Hi Anand,
Please go to SMQ1 and in qname enter cf* and then execute.
In the error screen press F8 and then select all PPM related queues and delete.
After that run IM after correction and do run CCR report for the reconcilation by tcode :/SAPAPO/CCR .
Manish

Similar Messages

  • Outbound Queue in ECC with CRM Destination

    Dear experts
    In ECC - t-code SMQ1, outbound queues R3AD_SALESDOxxxx in destination to the CRM system are in SYSFAIL.
    I think those queues are created when an ECC user changes or creates a sales document in ECC. But we don't synchronise sales documents between ECC and CRM.
    What are the settings to avoid this outbound queue to be created?
    Thanks in advance,
    Regards, Stephanie

    Hello Stephanie.
    Please remove the following table entry in your ECC system:
    TBE31 (Application components by Publish & Subscribe interface)
    - The following entries must exist for a successful data exchange:
                     Event            00501014
                     Obj.class        BUSPROCESSND
                     Fmodule          CRS_SALES_COLLECT_DATA
       Also see Note 490932.
    Best regards,
    Maggie

  • Need to know how to check the outbound queue in SAP for data flow into CRM

    Hi Specialist's,
    I have changed an entry in Customer Master Data in Sap r/3 and this change has come fine to CRM system.I checked the inbound BDOC in CRM ( Trn:SMW01) and it has come fine into CRM system.I am also able to see the affected field in CRM with new value.
    I need to know how to check this from SAP side i.e. I have checked the outbound IDOC list (WE02) but could not find the record.
    Is there any other way in SAP that i can check?
    Also please let me know if there is any other way except IDOC in SAP to send data from R/3 to CRM?
    Usefull answers will definitely be rewarded with points .
    Thanks,
    Abhinav.

    Hi Abhinav,
    There are no IDOCs generated in R/3 for replication. R/3 system calls BAPI and Function modules remotely on CRM system which are part of the Adaptors provided for middleware.
    Try to deregister the outbound queues in R/3 (Transaction SMQS) and see if you get an entry in the Outbound Queue (Transaction SMQ1). I have not tried this.
    If you don't get any entry in the outbound queue then definitely there would be some FM at R/3 end which would be calling CRM system remotely.
    <b>Reward points if it helps.</b>
    Regards,
    Amit Mishra

  • District data missing in the Outbound Queue of CRM

    Hi,
    We have an issue with the information not flowing to the Outbound Queue of CRM.
    For eg . When we change the District information for a BP and synchroniye the system, the information is flowing in the Inbound queue to the CRM system and we are able to find the District data in the Bdoc. But when we check the Bdoc in the Outbound queue of CRM for this site, this District information is missing over there.
    Any pointers on this would be of great help.
    Regards,
    Rasmi.

    Hi Rashmi
    Which BDoc did you check -  the MBDoc or the SBDoc?
    I guess the first thing to do would be to see if the information is correctly updated in the CDB.
    If the district is missing in the CDB entry then the problem is with the synchronisation between BUT000 and SMOKNA1
    You may have already checked this but I just thought I would ask
    James

  • Problem with queues / stacks for a project

    I have to code a calculator that turns an infix expression, where the operator is in the middle, to a postfix expression, where the operators are at the end;
    so, for instance, 5 + 5 would really be 5 5 +, and 5 + 5 * 5 / 5 would be 5 5 5 5 + * /.
    I've gotten the addition and subtraction working fine, the only problem comes when I have to take into account order of operations (so far).
    So, that being said, here is the code:
    import java.util.*;
    public class iCalc {
          * @param args
         public static void main(String[] args) {
         //     Scanner scan = new Scanner(System.in);
         //     System.out.println("Equation:");
         //     String input = "55+5-10%16."; //might have to store each element in a linked list later
         //     evalExp(input);     //calls evalExp with the input
              String input2 = "55 + 5 * 10 + 16";//declare some dummy input
              //121
              String [] items = input2.split(" ");//split the string's elements into an array
              Queue<String> queue = new LinkedList<String>();//the queue
              Stack<String> stack = new Stack<String>();//make a new stack to store operators
              Stack<String> stackOutput = new Stack<String>();//output stack
              for (String s : items) {//scan the array
                  System.out.println("item : " + s);//print out what's being scanned
                  if(isNumber(s)) queue.add(s);//add it onto the queue
                  if(isOperator(s)) stack.push(s);//add it onto the stack
              //converts to postfix here
             while(!stack.isEmpty()) queue.add(stack.pop());
             evalExp(queue, stackOutput);
         public static void evalExp(Queue<String> exp, Stack<String> outputStack)
              System.out.println("Evaluating the expression...");
              int length = exp.size();
              int temp;
         while(length > 0)
              // 55 5 10 16 + * +
              // 55
              try{
                   length--;
                   System.out.println("Trying to see if the element is a number...");
                   if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                        int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                        temp = 0;
                        for(String s : exp)
                        {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                             temp++;//keeps track of how far you are into the queue
                             outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                             if(temp == spot+1)
                                  break;     //(if there were enough elements in the queue popped, end this loop
                        outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
                   Double MyNum = Double.parseDouble(exp.remove());
                   String MyStackNum = "" + MyNum;
                   outputStack.push(MyStackNum);
                        if(outputStack.size() == 2)
                             length--;
                             String operator = popTheOperator(exp);
                             System.out.println("Two numbers have been popped, time to find the operator...");     
                             outputStack.push(performMath(outputStack.pop(), outputStack.pop(), operator));
                             for(String s : exp)
                                  if(s.equals(operator))
                                       exp.remove(s);
                                       break;
              }     catch(Exception ParseException){
                   outputStack.push(performMath(outputStack.pop(), outputStack.pop(), exp.remove()));               
              while(!outputStack.isEmpty()) System.out.println("The output stack is:" + outputStack.pop());     
         public static boolean isNumber(String s1)
              char[]arr2 = s1.toCharArray();
              for(int i = 0;i<s1.length();i++)
                   System.out.println("checking...." + s1);
                   if((!Character.isDigit(arr2))) return false;
              return true;
         public static boolean isOperator(String s2)
              char[]arr3 = s2.toCharArray();
              for(int i = 0;i<arr3.length;i++)
                   System.out.println("checking...." + arr3[i]);
                   if(findOperator(arr3[i])) return true;
              return false;
         public static boolean findOperator(char op)
                        if(op == '+' ||
                             op == '-' ||
                             op == '/' ||
                             op == '*' ||
                             op == '%' ||
                             op == '^' ||
                             op == '&' ||
                             op == '(' ||
                             op == ')' ||
                             op == '|' ||
                             op == '>' ||
                             op == '<' ||
                             op == '=' ||
                             op == '!' ) return true;          
              return false;          
         // 10 16 + + +
         public static String popTheOperator(Queue<String> myQueue)
              String current = "";
              for(String s: myQueue)
                   if(s.equals("*") || s.equals("/"))
                        current = s;
                   break;
              if(current == "")
                   for(String s: myQueue)
                        if(s.equals("+") || s.equals("-"))
                             current = s;
                             break;
         return current;     
         public static String performMath(String operand1, String operand2, String operator)
              String myString = "";
              double result = 0;
              double temp1 = Double.parseDouble(operand1);
              double temp2 = Double.parseDouble(operand2);
              if(operator.equals("+"))
                   result = temp1 + temp2;
              else if(operator.equals("-"))
                   result = temp2 - temp1;
              else if(operator.equals("/"))
                   result = temp1 / temp2;
              else if(operator.equals("*"))
                   result = temp1 * temp2;
              else if(operator.equals("%"))
                   result = temp1 % temp2;
              else if(operator.equals("^"))
                   result = Math.pow(temp1, temp2);
              else if(operator.equals("&"))
              else if(operator.equals("|"))
                   result = temp1 - temp2;
              else if(operator.equals(">"))
                   if(temp1 > temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("<"))
                   if(temp1 < temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("="))
                   if(temp1 == temp2)
                        result = 1;
                   else result = 0;
              else if(operator.equals("!"))
                   if(temp1 != temp2) result = 1;
                   else result = 0;
              myString = "" + result;
              return myString;
         public static boolean isMultiplyOrDivide(Queue<String> myQueue)
              for(String s : myQueue)//scan the queue
                   if(s.equals("*") || s.equals("/"))
                        return true;//it has found a multiply/divide operator!
              return false;
         public static int findMultiplyOrDividePosition(Queue<String> myQueue)
              int position = 0;
              for(String s: myQueue)
                   if(s.equals("+") ||
                                  s.equals("-") ||
                                  s.equals("%") ||
                                  s.equals("^") ||
                                  s.equals("&") ||
                                  s.equals("|") ||
                                  s.equals(">") ||
                                  s.equals("<") ||
                                  s.equals("=") ||
                                  s.equals("!")) position ++;
              return position;
    }I think that its trying to remove the head, but because the head was already removed, somehow its not letting it remove it; as if by removing the head, there is no new updated head.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

                   if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                        int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                        temp = 0;
                        for(String s : exp)
                        {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                             temp++;//keeps track of how far you are into the queue
                             outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                             if(temp == spot+1)
                                  break;     //(if there were enough elements in the queue popped, end this loop
                        outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
                   }the problem is somewhere in here.

  • Queues for RFC-Destination

    Hallo,
    must i assign a rfc-destination to a outbound queue? what happens when this is not done?
    Thanks in advance,
    Frank

    Hello Frank,
    In the context of using RFC Destination with quality of message EO(Exactly Once -- tRFC), the Queue will be automatically gets assigned at runtime.
    In the case of EOIO(Exaclty Once In Order-- qRFC), since the messages have to be executed in a sequence, a queue must be assigned during configuration.
    As per your query, if not assigned the messages would be struck.
    Regards,
    Sreenivas.

  • PI to ECC via ABAP Proxy - Outbound Queue for HTTP

    Dear Experts,
    Is there any Outbound Queue for HTTP?
    I've a interface scenario where the receiver is SAP ECC and the receiver adapter XI ABAP proxy. As I see in the communication channel the transport protocol used is HTTP. So I think could there be an outbound queue to manage HTTP connection when PI send the data to SAP ECC?
    Just like when we are sending IDocs to ECC via tRFC, we could check if the IDoc has really been sent to ECC by checking in tcode SM58 (Outbound tRFC).
    In case for ABAP Proxy via HTTP, is there any similar connection to SM58 (IDoc via tRFC)?
    Thank you,
    Suwandi C.

    Hi Kandasami,
    Thank you for the reply. I will check for it.
    Hi Jens,
    Yes, I mean somewhere after the SXMB_MONI in PI and before SXMB_MONI in ECC, is there any queue in between those two?
    Thank you,
    Suwandi C.

  • No Change Document in outbound queue for customer status in table VBUP

    Hello all,
    we face the following issue. A customer status (UVP04), changed by a customer program, is not written in the outbound queue (lbwq) to transfer it in the business warehouse.
    I checked several Function modules (VERKBELG_WRITE_DOCUMENT, MCEX_UPDATE_CALL_11.....) without success.
    Any help would be appreciated.
    jg

    Solution found: Dummy change with VA02, that generates a new record in the outbound queue.

  • Help out for Inbound & Outbound queue

    BW Gurus
    pl. help me on Inbound & Outbound queue, give details as step by step or any document pl. send it on [email protected]
    but i want to understand the through process of it.
    assign points if helpful
    thanks in advance
    charu

    http://help.sap.com/saphelp_nw04/helpdata/en/e7/555e3c0f51a830e10000000a114084/content.htm
    You can check the tRFCs using tcode SM58 ,and analyze it.
    Outbound queue is something which maintains data when it gets posted to R/3. You can check Outbound queue using tcode LBWQ. We generally load the LBWQ data to Delta Queue using JoB Controller.
    WE20 is tocode where you maintain Inbound n Outbound parameters. Like which messages to communicate in between Bw & R/3 system.

  • Deleting an outbound queue SMQ1

    HI,
    Can you please verify, is it ok to delete an outbound queue in smq1? The situation is, we have tried a delta load but we already aborted it since it is not needed anymore. But when we check on smq1, the queue is still there and it's status is running (transaction executing). What will happen if that queue will be deleted? will it cause data lost? Please help. Thanks!
    Kind regards,
    Mike

    Hello Mike,
    This shouldn't be a problem. And there won't be any data loss. however you might see additional table entries in your CRM or ECC(depending on what was the destination) for the LUWs that were already processed in your delta load.
    Apart from that , no issues

  • Struck up with R3AD_* Queues in SMQ1(Outbound Queue in ECC Side)

    Hi ,
    I am using CRM Middleware for replicating business partner(BP) from CRM to ECC
    and material from ECC to CRM.
    BP and Materials are replicating well.
    My Issue is,
    while checking queues in SMQ1 (Outbound Queue in ECC Side), i am getting many queues are pending also
    status as "SYSFAIL".
    QUEUE Names are R3AD_000000123,R3AD_000000139,R3AD_000000141... R3AD_*,etc..
    I tried to unlock the queues and activated, afterthat also queue status is "SYSFAIL". Then i checked in CRM side
    Transaction Code SMW01,
    BDOC Details:
    BDOC State Description: Information no processing.
    BDOC Type :BUS_TRANS_MSG.
    ERROR Message:
       a.Processing of document with GUID 4E57E4A5108162A7E10000000A0BE02A is canceled.
      b.Business transaction type ZEQQ does not exist.
      c.Validation error occurred: Module CRM_DOWNLOAD_BTMBDOC_VAL, BDoc type BUS_TRANS_MSG.
    Thanks and Regards,
    Ravi A

    Maintain a filter in ECC go to Tcode SM30 , then go to table/view and enter CRMRFCPAR click maintain and enter
    User CRM
    Object Name SALESDOCUMENT
    Destination xxxxxxxxxxxx
    Load Type delta download
    Queue Name
    Queue Name
    BAPINAME
    INFO
    InQueue Flag X
    Send XML
    CRM Release 700
    Logical system xxxxxxxxxxx
    this will stop the flow of ecc sales documents to crm
    this will also stop Bdcos in SMW01
    Please let me know if this helped

  • Outbound queue locked due to incorrect password

    Hi Gurus,
    I'm having a problem to activate an Integration Model as I'm getting an error stating that the outbound queue is blocked due to incorrect password.
    I have set up the RFC destination of the SCM ECC logical systems wit a valid user (I tested it). I've changed between using a Dialog user and a Communications Data user. Between every change I made I've cleaned the queue using transaction CFQ1.
    Do you have an I idea of what I might be missing?
    Many thanks,
    Diego

    Diego,
    It is unclear to me which system you are experiencing the problem on.  Either way, the reasons are usually the same.  I will address establishing the ECC>SCM link.  Works the same way in the other direction.
    Every time I have had the problem you are experiencing, I usually find that the fault lies with me, not the system - I have made assumptions that were not correct.
    BD54 ensure that your logical system name is what you think it is.  Unless you are rigorous in your naming conventions, it is easy to become confused between logical names/hostnames/system names for SCM and ECC, ,
    NDV2  ensure that the SCM system is properly identified
    SM59  Make sure your IP address, or hostname is right. Make sure the system you are logging onto interactively is the one being accessed in SM59.  Make sure you have the right userid.  Password is casesensitive on some versions of R/3 and APO, but not casesensitive on others.   I always use UPPERCASE text only for PWs, at least until everything is totally debugged.
    From a technical standpoint, your RFC userid can be interactive or system, I always start with interactive until the intefaces are totally debugged.  You auditors may have an opinion the final settings in the production system in this area..
    Rgds,
    DB49
    I hear and I forget. I see and I remember. I do and I understand. 
    Confucius

  • Groupware Intgration with Notes-Domnioserver Outbound Queues are on sysfail

    Hi Experts,
    we having some issues with Outbound Queues there are on sysfail an i do not know how to fix this i think there could be something wrong with the RFC-Destination to the mapbox.
    for example the queue holding the object GWA_ACTVCHAR at the moment says: "Table is not declared as a table or view in the ABAP Dictionary"
    or the Queue for the "BUPA_MAIN" says: " funktionsmodul for object BUPA_MAIN is not unique in table
    CRMSUBTAB"
    how do i setup the RFC-Destination to the Mapbox in CRM 7.0 or could it be something else
    please advise
    with kind regards
    Kalle Eismann

    Hi,
    I have come across this language error but in different scenario :
    The master data was maintained in two languages (english and japanese) when tried to run some standard report with a selection option as period i encountered the language error. Than i did run the report in decending order of the dates (reduced valid from date like from nov 10 to nov 9) on trial and error basis.
    I found that b/w some period one of the material was not activated for japanese language in basic data 1 view.
    hope this is useful.
    prakash

  • Preventing Outbound Queues during APO Shutdown

    Dear All,
    Here's my query:
    Whenever we go for a APO shutdown with all Users in APO locked, Queues get generated in the R/3 Outbound with SYSFAIL messages: User Locked.  After the shutdown, these take a huge amount of time to be cleared and lead to wastage of time.
    To prevent, we have tried Stopping APO Inbound Queues during the shutdown. However, the problem continues. I would like to try Using program to Close R/3 Outbound Queues during Shutdown as well. Can this affect in any way the Queues to other R/3 partner systems other than APO?
    Also, any other suggestions to prevent this problem during the shutdowns are most welcome.
    What are the precautions/steps taken to prevent such situations at various APO Clients.
    regards
    Sudhir Gulati

    Hi,
    In program RSTRFCQ1 (in R/3) you can define queue destination to be stopped. So you can stop only queues outbound for your APO system.
    You can also restrict by queue name - it tends to be different fro APO-bound queues - CF* and FC* for example.
    We always do that before stopping APO to prevent exactly your problems.
    br,
    Mikhail

  • SMQS - populating host id for new destination

    Hi All,
    We are setting up a new destination from our R3 to SCM system. We have added the logical system, partner profile, port, SMLG and rz12 settings but could not get the host id in smqs to get populated. Other old destinations are fine with populated host id field.
    Checked QSENDDEST table and no host id also defined for our destination. The SMQ1 queue of our R3 is already cleared, checked our settings (see above) and see no issues. I have seen some threads around the net similar to this but none worked so far. Appreciate your help.

    I know this was a long time ago, but did you ever get this resolved? I have the same issue and can still find nothing on google!
    Simon

Maybe you are looking for